[19] Yun Kuen Cheung, Richard Cole, and Yixin Tao. Dynamics of distributed updating in fisher markets. In Proceedings of the 2018 ACM Conference on Economics and Computation, pages 351-368, 2018.
[20] Yun Kuen Cheung, Martin Hoefer, and Paresh Nakhe. Tracing equilibrium in dynamic markets via distributed adaptation. arXiv preprint arXiv:1804.08017, 2018.
[21] Bruno Codenotti, Sriram V Pemmaraju, and Kasturi R Varadarajan. On the polynomial time computation of equilibria for certain exchange economies. In SODA, volume 5, pages 72-81, 2005.
[22] Richard Cole, Nikhil Devanur, Vasilis Gkatzelis, Kamal Jain, Tung Mai, Vijay V Vazirani, and Sadra Yazdanbod. Convex program duality, fisher markets, and nash social welfare. In Proceedings of the 2017 ACM Conference on Economics and Computation, pages 459-460, 2017.
[23] Richard Cole and Lisa Fleischer. Fast-converging tatonnement algorithms for one-time and ongoing market problems. In Proceedings of the fortieth annual ACM symposium on Theory of computing, pages 315-324, 2008.
[24] Constantinos Daskalakis, Maxwell Fishelson, and Noah Golowich. Near-optimal no-regret learning in general games. Advances in Neural Information Processing Systems, 34, 2021.
[25] Xiaotie Deng, Christos Papadimitriou, and Shmuel Safra. On the complexity of price equilibria. Journal of Computer and System Sciences, 67(2):311-324, 2003.
[26] Nikhil R Devanur, Christos H Papadimitriou, Amin Saberi, and Vijay V Vazirani. Market equilibrium via a primal-dual algorithm for a convex program. Journal of the ACM (JACM), 55(5):1-18, 2008.
[27] Nikhil R Devanur and Vijay V Vazirani. An improved approximation scheme for computing arrow-debreu prices for the linear case. In FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science: 23rd Conference, Mumbai, India, December 15-17, 2003. Proceedings 23, pages 149-155. Springer, 2003.
[28] Ran Duan and Kurt Mehlhorn. A combinatorial polynomial algorithm for the linear arrow-debreu market. Information and Computation, 243:112-132, 2015.
[29] Krishnamurthy Dvijotham, Yuval Rabani, and Leonard J Schulman. Convergence of incentive-driven dynamics in fisher markets. Games and Economic Behavior, 134:361-375, 2022.
[30] Federico Echenique and Adam Wierman. Finding a walrasian equilibrium is easy for a fixed number of agents. 2011.
[31] Edmund Eisenberg and David Gale. Consensus of subjective probabilities: The parti-mutuel method. The Annals of Mathematical Statistics, 30(1):165-168, 1959.
[32] Kfir Eliaz and Alexander Frug. Bilateral trade with strategic gradual learning. Games and Economic Behavior, 107:380-395, 2018.
[33] Michal Feldman, Kevin Lai, and Li Zhang. The proportional-share allocation market for computational resources. IEEE Transactions on Parallel and Distributed Systems, 20(8):1075-1088, 2008.
[34] Zhe Feng, Chara Podimata, and Vasilis Syrgkanis. Learning to bid without knowing your value. In Proceedings of the 2018 ACM Conference on Economics and Computation, EC '18, page 505-522, New York, NY, USA, 2018. Association for Computing Machinery.
[35] Dylan J Foster, Noah Golowich, and Sham M Kakade. Hardness of independent learning and sparse equilibrium computation in markov games. arXiv preprint arXiv:2303.12287, 2023.
[36] Jason Gaitonde and Éva Tardos. Stability and learning in strategic queuing systems. In Proceedings of the 21st ACM Conference on Economics and Computation, pages 319-347, 2020.