Distributed algorithms via gradient descent for fisher markets

Proceedings of the ACM Conference on Electronic Commerce

Volumn , Issue , 2011, Pages 127-136

  Birnbaum, Benjamin ^a   Devanur, Nikhil R ^b   Xiao, Lin ^b  

^a UNIVERSITY OF WASHINGTON   (United States)

^b MICROSOFT RESEARCH   (United States)

Author keywords

distributed algorithm; gradient descent; market equilibrium; proportional response

Indexed keywords

ALGORITHMIC GAME THEORY; BREGMAN DIVERGENCES; CONVEX PROGRAMS; DESIGN OF ALGORITHMS; DISTRIBUTED ALGORITHM; EUCLIDEAN DISTANCE; FAST CONVERGENCE; GRADIENT DESCENT; GRADIENT DESCENT ALGORITHMS; LIPSCHITZ CONTINUOUS; MARKET EQUILIBRIUM; PROPORTIONAL RESPONSE; RESEARCH GOALS;

ALGORITHMS; ELECTRONIC COMMERCE; GAME THEORY;

CONVERGENCE OF NUMERICAL METHODS;

EID: 79959620929     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1993574.1993594     Document Type: Conference Paper

References (49)

1. Baruch Awerbuch, Yossi Azar, Amir Epstein, Vahab S. Mirrokni, and Alexander Skopalik. Fast convergence to nearly optimal solutions in potential games. In ACM Conference on Electronic Commerce, pages 264-273, 2008.
2. K. Arrow, H. Block, and L. Hurwicz. On the stability of the competitive equilibrium: II. Econometrica, 27(1):82-109, 1959.
3. Heiner Ackermann, Paul W. Goldberg, Vahab S. Mirrokni, Heiko Röglin, and Berthold Vöcking. Uncoordinated two-sided matching markets. In ACM Conference on Electronic Commerce, pages 256-263, 2008.
4. D. P. Bertsekas. Nonlinear Programming. Athena Scientific, 2nd edition, 1999.
5. L. Bregman. The relaxation method of finding the common points of convex sets and its application to the solution of problems in convex programming. U.S.S.R. Comput. Math. and Math. Phys., 7:200-217, 1967.
6. Dimitri P. Bertsekas and John N. Tsitsiklis. Parallel and Distributed Computation: Numerical Methods. Athena Scientific, 1997.
7. A. Beck and M. Teboulle. Mirror descent and nonlinear projected subgradient methods for convex optimization. Operations Research Letters, 31:167-175, 2003.
8. Xi Chen and Xiaotie Deng. Settling the complexity of two-player Nash equilibrium. In FOCS, pages 261-272, 2006.
9. Xi Chen, Decheng Dai, Ye Du, and Shang-Hua Teng. Settling the complexity of Arrow-Debreu equilibria in markets with additively separable utilities. In FOCS, 2009.
10. Richard Cole and Lisa Fleischer. Fast-converging tatonnement algorithms for one-time and ongoing market problems. In STOC, pages 315-324, 2008.
11. Bruno Codenotti, Benton McCune, and Kasturi R. Varadarajan. Market equilibrium via the excess demand function. In STOC, pages 74-83, 2005.
12. Bruno Codenotti, Sriram V. Pemmaraju, and Kasturi R. Varadarajan. On the polynomial time computation of equilibria for certain exchange economies. In SODA, pages 72-81, 2005.
13. Steve Chien and Alistair Sinclair. Convergence to approximate Nash equilibria in congestion games. In SODA, pages 169-178, 2007.
14. Bruno Codenotti, Amin Saberi, Kasturi R. Varadarajan, and Yinyu Ye. Leontief economies encode nonzero sum two-player games. In SODA, pages 659-667, 2006.
15. G. Chen and M. Teboulle. Convergence analysis of a proximal-like minimization algorithm using Bregman functions. SIAM Journal on Optimization, 3(3):538-543, August 1993.
16. Xi Chen and Shang-Hua Teng. Spending is not easier than trading: On the computational equivalence of Fisher and Arrow-Debreu equilibria. CoRR, abs/0907.4130, 2009.
17. Bruno Codenotti and Kasturi Varadarajan. Algorithmic Game Theory, chapter Computation of Market Equilibria by Convex Programming. Cambridge University Press, 2007.
18. Nikhil R Devanur. Fisher markets and convex programs. Working paper available from http://research.microsoft.com/en-us/um/people/nikdev/, 2009.
19. Constantinos Daskalakis, Paul W. Goldberg, and Christos H. Papadimitriou. The complexity of computing a Nash equilibrium. In STOC, pages 71-78, 2006.
20. Nikhil R. Devanur and Ravi Kannan. Market equilibria in polynomial time for fixed number of goods or agents. In FOCS, pages 45-53, 2008.
21. Xiaotie Deng, Christos H. Papadimitriou, and Shmuel Safra. On the complexity of equilibria. In STOC, pages 67-71, 2002.
22. Nikhil R. Devanur, Christos H. Papadimitriou, Amin Saberi, and Vijay V. Vazirani. Market equilibrium via a primal-dual algorithm for a convex program. J. ACM, 55(5), 2008.
23. Nikhil R. Devanur and Vijay V. Vazirani. The spending constraint model for market equilibrium: algorithmic, existence and uniqueness results. In STOC, pages 519-528, 2004.
24. Edmund Eisenberg and David Gale. Consensus of subjective probabilities: The pari-mutuel method. Ann. Math. Statist., 30(1):165-168, 1959.
25. Lisa Fleischer, Rahul Garg, Sanjiv Kapoor, Rohit Khandekar, and Amin Saberi. A fast and simple algorithm for computing market equilibria. In WINE, pages 19-30, 2008.
26. Rahul Garg and Sanjiv Kapoor. Auction algorithms for market equilibrium. Math. Oper. Res., 31(4):714-729, 2006.
27. Kamal Jain. A polynomial time algorithm for computing an Arrow-Debreu market equilibrium for linear utilities. SIAM J. Comput., 37(1):303-318, 2007.
28. Kamal Jain and Vijay V. Vazirani. Eisenberg-Gale markets: algorithms and game-theoretic properties. Games and Economic Behavior, 70(1), 2010.
29. F. P. Kelly. Charging and rate control for elastic traffic. European Transactions on Telecommunications, 8:33-37, 1997.
30. F. P. Kelly, A. K. Maulloo, and D. K. H. Tan. Rate control in communication networks: shadow prices, proportional fairness and stability. Journal of the Operational Research Society, 49:237-252, 1998.
31. F. P. Kelly and V. V. Vazirani. Rate control as a market equilibrium. Manuscript, 2002.
32. Dave Levin, Katrina LaCurts, Neil Spring, and Bobby Bhattacharjee. Bittorrent is an auction: analyzing and improving bittorrent's incentives. In SIGCOMM '08: Proceedings of the ACM SIGCOMM 2008 conference on Data communication, pages 243-254, New York, NY, USA, 2008. ACM.
33. A. Nemirovski. Lectures on modern convex optimization. Lecture notes, Georgia Institute of Technology, 2005.
34. 2). Soviet Math. Docl. (Doklady AN SSSR), 269:543-547, 1983.
35. Yu. Nesterov. Introductory Lectures on Convex Optimization: A Basic Course. Kluwer, Boston, 2004.
36. Yu. Nesterov. Smooth minimization of nonsmooth functions. Mathematical Programming, 103(1):127-152, 2005.
37. A. Nemirovsky and D. Yudin. Problem Complexity and Method Efficiency in Optimization. J. Wiley & Sons, New York, 1983.
38. R. T. Rockafellar. Convex Analysis. Princeton University Press, 1970.
39. R.W. Rosenthal. A class of games possessing pure-strategy Nash equilibria. International Journal of Game Theory, 2:65-67, 1973.
40. V. Shmyrev. An algorithm for finding equilibrium in the linear exchange model with fixed budgets. Journal of Applied and Industrial Mathematics, 3:505-518, 2009.
41. P. Tseng. On accelerated proximal gradient methods for convex-concave optimization. Submitted to SIAM Journal on Optimization, 2008.
42. H. Uzawa. Walras' tatonnement in the theory of exchange. Review of Economic Studies, 27:182-94, 1960.
43. Vijay V. Vazirani. Algorithmic Game Theory, chapter Combinatorial Algorithms for Market Equilibria. Cambridge University Press, 2007.
44. Vijay V. Vazirani. Spending constriant utilities, with applications to the adwords market. Math. of Operations Research, 35(2), 2010. A manuscript has been publicly available since 2003.
45. Vijay V. Vazirani and Mihalis Yannakakis. Market equilibrium under separable, piecewise-linear, concave utilities. In ICS, 2010.
46. L. Walras. Éléments d'économie politique pure ou théorie de la richesse sociale (Elements of Pure Economics, or the theory of social wealth). Lausanne, Paris, 1874. (1899, 4th ed.; 1926, rev ed., 1954, Engl. transl.).
47. Fang Wu and Li Zhang. Proportional response dynamics leads to market equilibrium. In STOC '07: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, pages 354-363, New York, NY, USA, 2007. ACM.
48. Y. Ye. A path to the Arrow-Debreu competitive market equilibrium. Mathematical Programming, 111:315-348, 2008.
49. Li Zhang. Proportional response dynamics in the Fisher market. In ICALP '09: Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming, pages 583-594, Berlin, Heidelberg, 2009. Springer-Verlag.