An auction-based market equilibrium algorithm for the separable gross substitutability case

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3122, Issue , 2004, Pages 128-138

  Garg, Rahul ^a   Kapoor, Sanjiv ^b   Vazirani, Vijay ^c  

^a IBM RESEARCH INDIA   (India)

^b Illinois Institute of Technology   (United States)

^c GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; COMMERCE; OPTIMIZATION; POLYNOMIAL APPROXIMATION;

AUCTION-BASED MARKET; GENERAL CLASS; MARKET EQUILIBRIA; POLYNOMIAL-TIME; POLYNOMIAL-TIME ALGORITHMS; UTILITY FUNCTIONS;

ALGORITHMS;

EID: 33744936099     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27821-4_12     Document Type: Article

References (18)

1. K. Arrow, H. Block, and L.Hurwicz. On the stability of the competitive equilibrium, II. Econometrica, 27(1):82-109, 1959.
2. Vipul Bansal and Rahul Garg. Simultaneous Independent Online Auctions with Discrete Bid Increments. Electronic Commerce Research Journal: Special issue on Dynamic Pricing Policies in Electronic Commerce, To Appear.
3. Dimitri P. Bertsekas. Auction Algorithms for Network Flow Problems: A Tutorial Introduction. Computational Optimization and Applications, 1:7-66, 1992.
4. Gabrielle Demange, David Gale, and Marilda Sotomayor. Multi-item Auctions. Journal of Political Economy, 94(4):863-872, 1986.
5. X. Deng, C. Papadimitriou, and S. Safra. On the Complexity of Equilibria. In 34th ACM Symposium on Theory of Computing (STOC 2002), Montreal, Quebec, Canada, May 2002.
6. N. Devanur, C. Papadimitriou, A. Saberi, and V. Vazirani. Market Equilibrium via a Primal-Dual-Type Algorithm. In 43rd Symposium on Foundations of Computer Science (FOCS 2002), 389-395, November 2002.
7. N. R. Devanur and V. Vazirani. An Improved Approximation Scheme for Computing the Arrow-Debreu Prices for the Linear Case. In Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2003), 2003.
8. N. R. Devanur and V.V. Vazirani. The Spending Constraint Model for Market Equilibrium: Algorithmic, Existence and Uniqueness Results. Proceedings of the 36th Annual ACM Symposium on the Theory of Computing, 2004.
9. E. Eisenberg and D. Gale. Consensus of Subjective Probabilities: The Pari-Mutuel Method. Annals of Mathematical Statistics, 30:165-168, 1959.
10. Rahul Garg and Sanjiv Kapoor. Auction Algorithms for Market Equilibrium. Proceedings of the 36th Annual ACM Symposium on the Theory of Computing, 2004.
11. J. Greenberg. An elementary proof of the existence of a competitive equilibrium with weak gross substitutes. The Quarterly Journal of Economics, 91:513-516, 1977.
12. F. Gul and E. Stacchetti. Walrasian equilibrium with gross substitutes. Journal of Economic Theory, 87:95-124, 1999.
13. K. Jain, M. Mahdian, and A. Saberi. Approximating Market Equilibrium. Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX 2003), 2003.
14. Kamal Jain. A Polynomial Time Algorithm for Computing the Arrow-Debreau Market equilibrium for Linear Utilities. Preprint.
15. H. W. Kuhn. The Hungarian Method for the Assignment Problem. Naval Research Logistics Quarterly, 2:83-97, 1955.
16. C. Papadimtriou. Algorithms, games, and the internet. Proceedings of the 33rd Annual ACM Symposium on the Theory of Computing, 749-753, 2001.
17. V. V. Vazirani. Market Equilibrium When Buyers Have Spending Constraints. Submitted, 2003.
18. Yinyu Ye. A Path to the Arrow-Debreu Competetive Market Equilibrium. Preprint, 2004.