Eisenberg-Gale markets: Algorithms and game-theoretic properties

Games and Economic Behavior

Volumn 70, Issue 1, 2010, Pages 84-106

  Jain, Kamal ^a   Vazirani, Vijay V ^b  

^a Georgia Institute of Technology ^*  (United States)

^b Georgia Institute of Technology   (United States)

Author keywords

Ascending price auctions; Combinatorial algorithm; Competition monotonicity; Convex program; Fairness; Fisher market model; General equilibrium theory; Primal dual algorithm; Resource allocation; Weak gross substitutability

Indexed keywords

EID: 77955557885     PISSN: 08998256     EISSN: 10902473     Source Type: Journal    
DOI: 10.1016/j.geb.2008.11.011     Document Type: Article

References (44)

1. Ahlswede R., Cai N., Li S.Y.R., Yeung R.W. Network information flow. IEEE Transactions Info. Theory 2000, 46:1204-1216.
2. Barahona F. Packing spanning trees. Mathematics Operation Res. 1995, 20:104-115.
3. Bondareva O.N. Some applications of linear programming to cooperative games. Prob. Kibernetiki 1963, 10:119-139.
4. Brainard, W.C., Scarf, H.E., 2000. How to compute equilibrium prices in 1891. Cowles Foundation Discussion Paper, 1270.
5. Chakrabarty, D., Devanur, N., 2006. On competitiveness in uniform utility allocation markets. Unpublished manuscript.
6. Chakrabarty, D., Devanur, N., Vazirani, V., 2006. New results on rationality and strongly polynomial solvability in Eisenberg-Gale markets. In: WINE.
7. Codenotti, B., Varadarajan, K., 2004. Efficient computation of equilibrium prices for markets with Leontief utilities. In: ICALP.
8. Cunningham W.H. Minimum cuts, modular functions and matroid polyhedra. Networks 1985, 15:205-215.
9. Dahlhaus E., Johnson D.S., Papadimitriou C.H., Seymour P.D., Yannakakis M. The complexity of multiterminal cuts. SIAM J. Computing 1994, 23:864-894.
10. Devanur N., Papadimitriou C.H., Saberi A., Vazirani V.V. Market equilibrium via a primal-dual-type algorithm. J. ACM 2008, 55(5). article 22.
11. Edmonds J. Optimum branchings. J. Res. Nat. Bureau Standards. Section B 1967, 71:233-240.
12. Edmonds J. Submodular functions, matroids, and certain polyhedra. Combinatorial Structures and their Applications 1970, 69-87. Gordon and Breach. R. Guy, H. Hanani, N. Sauer, J. Sch/Snheim (Eds.).
13. Eisenberg E. Aggregation of utility functions. Manage. Sci. 1961, 7:337-350.
14. Eisenberg E., Gale D. Consensus of subjective probabilities: The Pari-Mutuel method. The Annals Math. Statist. 1959, 30:165-168.
15. Fleischer L., Fujishige S., Iwata Satoru A strongly polynomial-time algorithm for minimizing submodular functions. J. ACM 2001, 48:761-777.
16. Floyd S., Jacobson V. Random early detection gateways for congestion avoidance. IEEE/ACM Transactions Networking 1993, 1(1):397-413.
17. Garg N., Vazirani V.V., Yannakakis M. Multiway cuts in directed and node weighted graphs. Lecture Notes in Computer Sci. 1994, vol. 820:487-498. Springer-Verlag, Berlin.
18. Garg, D., Jain, K., Talwar, K., Vazirani, V., 2005. A primal-dual algorithm for computing Fisher equilibrium in absence of gross substitutability property. In: WINE.
19. Goel, A., Meyerson, A., Plotkin, S., 2001. Approximate majorization and fair online load balancing. In: SODA.
20. Groenevelt H. Two algorithms for maximizing a separable concave function over a polymatroid feasible region. Europ. J. Operational Res. 1991, 54:227-236.
21. Hu T.C. Multicommodity network flows. Operations Res. 1963, 14:344-360.
22. Jacobson, V., 1988. Congestion avoidance and control. In: ACM SIGCOMM, pp. 314-329.
23. Jain K., Vazirani V.V. Approximation algorithms for the metric facility location and k-median problems using the primal-dual schema and Lagrangian relaxation. J. ACM 2001, 48:274-296.
24. Jain, K., Vazirani, V.V., 2002. Equitable cost allocations via primal-dual-type algorithms. In: STOC.
25. Jain, K., Vazirani, V.V., Ye, Y., 2005. Market equilibrium for homothetic, quasi-concave utilities and economies of scale in production. In: SODA.
26. Kelly F.P. Charging and rate control for elastic traffic. Europ. Transactions Telecommunications 1997, 8:33-37.
27. Kelly F.P., Vazirani V.V. Rate control as a market equilibrium Unpublished manuscript. Available at:. http://www.cc.gatech.edu/vazirani/KV.pdf.
28. Kelly F.P., Maulloo A.K., Tan D.K.H. Rate control in communication networks. J. Operational Res. Society 1998, 49:237-252.
29. Koutsoupias, E., Papadimitriou, C.H., 1999. Worst case equilibria. In: Proceedings of STACS.
30. Low S.H. A duality model of TCP and queue management algorithms. IEEE/ACM Transactions Networking 2003, 11(4):525-536. (August).
31. Low S., Lapsley D. Optimization flow control, 1: Basic algorithm and convergence. IEEE/ACM Transactions Networking 1999, 7(6):861-874.
32. Low S.H., Peterson Larry, Wang Limin Understanding vegas: A duality model. J. ACM 2002, 49(2):207-235. (March).
33. Megiddo N. Optimal flows in networks with multiple sources and sinks. Math. Programming 1974, 7:97-107.
34. Megiddo N. A note on the complexity of p-matrix lcp and computing an equilibrium IBM Research Report 6439. Available at:. http://theory.stanford.edu/~megiddo/pdf/plcp.pdf.
35. Megiddo N., Papadimitriou C.H. On total functions, existence theorems, and computational complexity. Theoretical Computer Sci. 1991, 81:317-324.
36. Nagano, K., 2007. On convex minimization over base polytopes. In: IPCO.
37. Nash-Williams C.S.J.A. Edge-disjoint spanning trees of finite graphs. J. London Math. Society 1961, 36:445-450.
38. Schrijver A. Theory of Linear and Integer Programming 1986, John Wiley & Sons, New York, NY.
39. Schrijver A. A combinatorial algorithm minimizing submodular functions in strongly polynomial time. J. Combinatorial Theory, Ser. B 2000, 80:346-355.
40. Shapley L.S. On balanced sets and cores. Naval Res. Logist. Quart. 1967, 14:453-460.
41. Tutte W.T. On the problem of decomposing a graph into n connected factors. J. London Math. Society 1961, 36:221-230.
42. Vazirani V.V. Combinatorial algorithms for market equilibria. Algorithmic Game Theory 2007, 103-134. Cambridge University Press. N. Nisan, T. Roughgarden, E. Tardos, V.V. Vazirani (Eds.).
43. Wang J., Li L., Low S.H., Doyle J.C. Cross-layer optimization in TCP/IP networks. IEEE/ACM Transactions Networking 2005, 13:582-595.
44. Williamson, D.P., Goemans, M.X., Mihail, M., Vazirani, V.V., 1993. A primal-dual approximation algorithm for generalized Steiner network problems. In: Proceedings, 25th Annual ACM Symposium on Theory of Computing.