Combinatorial algorithms for market equilibria

Algorithmic Game Theory

Volumn 9780521872829, Issue , 2007, Pages 103-134

  Vazirani, Vijay V ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; COMMERCE; CONVEX OPTIMIZATION; COSTS; PHILOSOPHICAL ASPECTS; POLYNOMIAL APPROXIMATION;

COMBINATORIAL ALGORITHM; EQUILIBRIUM PRICE; GENERAL EQUILIBRIUM; MATHEMATICAL ECONOMICS; POLYNOMIAL-TIME ALGORITHMS; PRICING MECHANISM; PRIMAL-DUAL SCHEMATA; STRONGLY POLYNOMIALS;

ECONOMICS;

EID: 84926094098     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1017/CBO9780511800481.007     Document Type: Chapter

References (22)

1. K. Arrow and G. Debreu. Existence of an equilibrium for a competitive economy. Econometrica, 22:265–290, 1954.
2. W.C. Brainard and H.E. Scarf. How to compute equilibrium prices in 1891. Cowles Foundation Discussion Paper, (1270) 2000.
3. X. Deng, C. Papadimitriou, and S. Safra. On the complexity of equilibria. In Proc. ACM Symp. on Theor. Comp., 2002.
4. N. Devanur, C.H. Papadimitriou, A. Saberi, and V.V. Vazirani. Market equilibrium via a primal-dualtype algorithm. In Proc. IEEE Annual Symp. Fdns. of Comp. Sci., 2002. To appear in J. ACM. Journal version available at: http://www-static.cc.gatech.edu/vazirani/market.ps.
5. N. Devanur and V.V. Vazirani. The spending constraint model for market equilibrium: Algorithmic, existence and uniqueness results. In Proc. 36th Symp. on Theory of Computing, 2004.
6. J. Edmonds. Maximum matching and a polyhedron with 0,1-vertices. J. Res. Natl. Bur. Standards, 69:125–130, 1965.
7. J. Edmonds. Optimum branchings. J. Res. Natl. Bur. Standards, Section B, 71:233–240, 1967.
8. E. Eisenberg and D. Gale. Consensus of subjective probabilities: The Pari-Mutuel method. Annals Math. Stat., 30:165–168, 1959.
9. S. Floyd and V. Jacobson. Random early detection gateways for congestion avoidance. IEEE/ACM Trans. Networking, 1(1):397–413, 1993.
10. R. Garg and S. Kapoor. Auction algorithms for market equilibrium. In Proc. 36th Symp. on Theory of Computing, 2004.
11. V. Jacobson. Congestion avoidance and control. In ACM SIGCOMM, pp. 314–329, 1988.
12. K. Jain and V.V. Vazirani. Eisenberg-gale markets: Algorithms and structural properties. In Proc. 39th Symp. on Theory of Computing, 2007.
13. F.P. Kelly. Charging and rate control for elastic traffic. Euro. Trans. on Telecomm., 8:33–37, 1997.
14. F.P. Kelly, A.K. Maulloo, and D.K.H. Tan. Rate control in communication networks. J. Oper. Res. Soc., 49:237–252, 1998.
15. F.P. Kelly and V.V. Vazirani. Rate control as a market equilibrium. Unpublished manuscript 2002. Available at: http://www-static.cc.gatech.edu/vazirani/KV.pdf.
16. S. Low and D. Lapsley. Optimization flow control, 1: basic algorithm and convergence. IEEE/ACM Trans. Networking, 7(6):861–874, 1999.
17. C.S.J.A. Nash-Williams. Edge-disjoint spanning trees of finite graphs. J. London Math. Soc., 36:445–450, 1961.
18. H. Scarf. The Computation of Economic Equilibria (with collaboration of T. Hansen). Cowles Foundation Monograph No. 24., New Haven: Yale University Press, 1973.
19. W.T. Tutte. On the problem of decomposing a graph into n connected factors. J. London Math. Soc., 36:221–230, 1961.
20. V.V. Vazirani. Spending constraint utilities, with applications to the Adwords market. Submitted to Math. of Operations Research, 2006.
21. L. Walras. E´le´ments d’e´conomie politique pure ou theórie 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.).
22. J. Wang, L. Li, S.H. Low, and J.C. Doyle. Cross-layer optimization in TCP/IP networks. IEEE/ACM Trans. Networking, 13:582–268, 2005.