Eisenberg-Gale markets: Algorithms and structural properties

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2007, Pages 364-373

  Jain, Kamal ^a   Vazirani, Vijay V ^b  

^a MICROSOFT RESEARCH   (United States)

^b Georgia Institute of Technology   (United States)

Author keywords

Convex programs; Equilibria; KKT conditions; Markets; Primal dual algorithms; Resource allocation

Indexed keywords

CONVEX PROGRAMS; KKT CONDITIONS; PRICE AUCTIONS; PRIMAL-DUAL ALGORITHMS;

COMBINATORIAL MATHEMATICS; MARKETING; POLYNOMIALS; RESOURCE ALLOCATION;

ALGORITHMS;

EID: 35448998849     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1250790.1250845     Document Type: Conference Paper

References (32)

1. O. N. Bondareva. Some applications of linear programming to cooperative games. Problemy Kibernetiki, 10:119-139, 1963.
2. W. C Brainard and H. E. Scarf. How to compute equilibrium prices in 1891. Cowles Foundation Discussion Paper, (1270), 2000.
3. D. Chakrabarty and N. Devanur. On competitiveness in uniform utility allocation markets. Unpublished manuscript, 2006.
4. D. Chakrabarty, N. Devanur, and V. Vazirani. New results on rationality and strongly polynomial solvability in eisenberg-gale markets. In WINE, 2006.
5. B. Codenotti and K. Varadarajan. Efficient computation of equilibrium prices for markets with Leontief utilities. In ICALP, 2004.
6. N. Devanur, C. H. Papadimitriou, A. Saberi, and V. V. Vazirani. Market equilibrium via a primal-dual-type algorithm. In FOCS, 2002. To appear in Journal of the ACM. Journal version available at: http://www.cc.gatech. edu/vazlrani/market.ps.
7. J. Edmonds. Optimum branchings. Journal of Research of the National Bureau of Standards. Section B, 71:233-240, 1967.
8. E. Eisenberg. Aggregation of utility functions. Management Sciences, 7:337-350, 1961.
9. E. Eisenberg and D. Gale. Consensus of subjective probabilities: the Pari-Mutuel method. The Annals of Mathematical Statistics, 30:165-168, 1959.
10. L. Fleischer, S. Fujishige, and S. Iwata. A strongly polynomial-time algorithm for minimizing submodular functions. Journal of the ACM, 48:761-777, 2001.
11. S. Floyd and V. Jacobson, random early detection gateways for congestion avoidance. IEEE/ACM Transactions on Networking, 1(1):397-413, 1993.
12. D. Garg, K. Jain, K. Talwar, and V. Vazirani. A primal-dual algorithm for computing Fisher equilibrium in absence of gross substitutability property. In WINE, 2005.
13. A. Goel, A. Meyerson, and S. Plotkin. Approximate majorization and fair online load balancing. In SODA, 2001.
14. H. Groenevelt. Two algorithms for maximizing a separable concave function over a polymatroid feasible region. European Journal of Operational Research, 54:227-236, 1991.
15. T. Hu. Multicommodity network flows. Operations Research, 14:344-360, 1963.
16. V. Jacobson. Congestion avoidance and control. In ACM SIGCOMM, pages 314-329, 1988.
17. K. Jain and V. Vazirani. Approximation algorithms for the metric facility location and k-median problems using the primal-dual schema and Lagrangian relaxation. Journal of the ACM, 48:274-296, 2001.
18. K. Jain and V. V. Vazirani. Equitable cost allocations via primal-dual-type algorithms. In STOC, 2002.
19. K. Jain, V. V. Vazirani, and Y. Ye. Market equilibrium for homothetic, quasi-concave utilities and economies of scale in production. In SODA, 2005.
20. F. P. Kelly. Charging and rate control for elastic traffic. European Transactions on Telecommunications, 8:33-37, 1997.
21. F. P. Kelly, A. K. Maulloo, and D. K. H. Tan. Rate control in communication networks. Journal of Operational Research Society, 49:237-252, 1998.
22. F. P. Kelly and V. V. Vazirani. Rate control as a market equilibrium. Unpublished manuscript 2002. Available at: http://www.cc.gatech.edu/vazirani/KV. pdf.
23. E. Koutsoupias and C. H. Papadimitriou. Worst case equilibria. In Proceedings of STACS, 1999.
24. S. Low and D. Lapsley. Optimization flow control, 1: basic algorithm and convergence. IEEE/ACM Transactions on Networking, 7(6):861-874, 1999.
25. N. Megiddo. Optimal flows in networks with multiple sources and sinks. Mathematical Programming, 7:97-107, 1974.
26. K. Nagano. On convex minimization over base polytopes. In IPCO, 2007.
27. C. S. J. A. Nash-Williams. Edge-disjoint spanning trees of finite graphs. J. London Math Soc, 36:445-450, 1961.
28. A. Schrijver. Theory of Linear and Integer Programming. John Wiley & Sons, New York, NY, 1986.
29. A. Schrijver. A combinatorial algorithm minimizing submodular functions in strongly polynomial time. Journal of Combinatorial Theory, Series B, 80:346-355, 2000.
30. L. S. Shapley. On balanced sets and cores. Naval Research Logistics Quarterly, 14:453-460, 1967.
31. W. T. Tutte. On the problem of decomposing a graph into n connected factors. J. London Math Soc, 36:221-230, 1961.
32. J. Wang, L. Li, S. H. Low, and J. C. Doyle. Cross-layer optimization in TCP/IP networks. IEEE/ACM Trans. on Networking, 13:582-268, 2005.