[37] Jason Gaitonde and Éva Tardos. Virtues of patience in strategic queuing systems. In Proceedings of the 22nd ACM Conference on Economics and Computation, pages 520–540, 2021.
[38] Yuan Gao and Christian Kroer. First-order methods for large-scale market equilibrium computation. Advances in Neural Information Processing Systems, 33:21738-21750, 2020.
[39] Jugal Garg, Ruta Mehta, Milind Sohoni, and Vijay V Vazirani. A complementary pivot (practical) algorithm for market equilibrium under separable, piecewise-linear concave utilities.
[40] Rahul Garg and Sanjiv Kapoor. Auction algorithms for market equilibrium. In Proceedings of the thirty-sixth annual ACM symposium on Theory of computing, pages 511-518, 2004.
[41] Felix C Gartner. Fundamentals of fault-tolerant distributed computing in asynchronous environments. ACM Computing Surveys (CSUR), 31(1):1-26, 1999.
[42] James Hannan. Approximation to bayes risk in repeated play. In Contributions to the Theory of Games (AM-39), Volume III, pages 97-139. Princeton University Press, 1957.
[43] Sergiu Hart and Andreu Mas-Colell. Simple adaptive strategies: from regret-matching to uncoupled dynamics, volume 4. World Scientific, 2013.
[44] Kamal Jain. A polynomial time algorithm for computing an arrow-debreu market equilibrium for linear utilities. SIAM Journal on Computing, 37(1):303-318, 2007.
[45] Kamal Jain, Mohammad Mahdian, and Amin Saberi. Approximating market equilibria. In 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, 2003. Springer, 2003.
[46] Martin Kaae Jensen. Stability of pure strategy nash equilibrium in best-reply potential games. University of Birmingham, Tech. Rep, 2009.
[47] Frank Kelly. Charging and rate control for elastic traffic. European transactions on Telecommunications, 8(1):33-37, 1997.
[48] Yoav Kolumbus and Noam Nisan. Auctions between regret-minimizing agents. In Proceedings of the ACM Web Conference 2022, pages 100-111, 2022.
[49] Yoav Kolumbus and Noam Nisan. How and why to manipulate your own agent: On the incentives of users of learning agents. Advances in Neural Information Processing Systems, 35:28080-28094, 2022.
[50] Stefanos Leonardos, Barnabé Monnot, Daniél Reijsbergen, Efstratios Skoulakis, and Georgios Piliouras. Dynamical analysis of the eip-1559 ethereum fee market. In Proceedings of the 3rd ACM Conference on Advances in Financial Technologies, pages 114–126, 2021.
[51] Stefanos Leonardos, Daniel Reijsbergen, Daniel Reijsbergen, Barnabé Monnot, and Georgios Piliouras. Optimality despite chaos in fee markets. arXiv preprint arXiv:2212.07175, 2022.
[52] Panayotis Mertikopoulos, Zhengyuan Zhou, et al. Gradient-free online learning in games with delayed rewards. In International Conference on Machine Learning. International Machine Learning Society (IMLS), 2020.
[53] Dov Monderer and Lloyd S Shapley. Potential games. Games and economic behavior, 14(1):124-143, 1996.
[54] Uri Nadav and Georgios Piliouras. No regret learning in oligopolies: Cournot vs. bertrand. In Algorithmic Game Theory: Third International Symposium, SAGT 2010, Athens, Greece, October 18-20, 2010. Proceedings 3, pages 300-311. Springer, 2010.
[55] John F Nash Jr. The bargaining problem. Econometrica: Journal of the econometric society, pages 155-162, 1950.
[56] Abraham Neyman. Correlated equilibrium and potential games. International Journal of Game Theory, 26(2):223-227, 1997.