Spending constraint utilities with applications to the adwords market

Mathematics of Operations Research

Volumn 35, Issue 2, 2010, Pages 458-478

  Vazirani, Vijay V ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

Adwords market; Combinatorial algorithms; Fisher's model; Linear utilities; Market equilibrium; Piecewise linear concave utilities; Primal dual algorithms; Search engines; Weak gross substitutability

Indexed keywords

ADWORDS MARKET; COMBINATORIAL ALGORITHM; MARKET EQUILIBRIA; MARKET EQUILIBRIUM; PIECEWISE-LINEAR; PRIMAL DUAL ALGORITHMS;

ALGORITHMS; COMBINATORIAL MATHEMATICS; INFORMATION RETRIEVAL; INTERNET; MATHEMATICAL MODELS; PIECEWISE LINEAR TECHNIQUES; SEARCH ENGINES; WORLD WIDE WEB;

COMMERCE;

EID: 77953085083     PISSN: 0364765X     EISSN: 15265471     Source Type: Journal    
DOI: 10.1287/moor.1100.0450     Document Type: Article

References (20)

1. Ahuja, R. K., T. L. Magnanti, J. B. Orlin. 1993. Network Flows: Theory, Algorithms and Applications. Prentice Hall, NJ.
2. Arrow, K., G. Debreu. 1954. Existence of an equilibrium for a competitive economy. Econometrica 22 265-290.
3. Birnbaum, B., N. Devanur, L. Xiao. 2010. New convex programs and distributed algorithms for Fisher markets with linear and spending constraint utilities. Unpublished manuscript.
4. Brainard, W. C., H. E. Scarf. 2000. How to compute equilibrium prices in 1891. Cowles Foundation Discussion Paper 1270, Yale University, New Haven, CT.
5. Bridel, P. 2002. Walras and the money-in-the-utility-function tradition. Eur. J. History Econom. Thought 9(2) 268-292.
6. Chen, X., D. Dai, Y. Du, S.-H. Teng. 2009. Settling the complexity of arrow-debreu equilibria in markets with additively separable utilities. Algorithms and Computation, Vol.5878, Lecture Notes in Computer Science. Springer, Berlin.
7. Chen, X., S.-H. Teng. 2009. Spending is not easier than trading: On the computational equivalence of Fisher and Arrow-Debreu equilibria. Proc. 20th Internat. Sympos. Algorithms Comput., Honolulu, 647-656.
8. Cook, W. J., W. H. Cunningham, W. R. Pulleyblank, A. Schrijver. 1998. Combinatorial Optimization. John Wiley and Sons, Inc., New York.
9. Devanur, N., V. V. Vazirani. 2004. The spending constraint model for market equilibrium: Algorithmic, existence and uniqueness results. Proc. 36th Annual ACM Sympos. Theory ofComput., Chicago, 519-528.
10. Devanur, N., C. H. Papadimitriou, A. Saberi, V. V. Vazirani. 2008. Market equilibrium via a primal-dual algorithm for a convex program. J. Assoc. Comput. Machinery 55(5).
11. Eisenberg, E., D. Gale. 1959. Consensus of subjective probabilities: The Pari-Mutuel method. Ann. Math. Statist. 30 165-168.
12. Gale, D. 1977. Piecewise linear exchange equilibrium. J. Math. Econom. 4 81-86.
13. Megiddo, N. 1988. A noteon thecomplexity of p-matrix lcp and computing an equilibrium. IBM Research Report 6439. http://theory.stanford.edu-megiddo/pdf/ plcp.pdf.
14. Megiddo, N., C. H. Papadimitriou. 1991. On total functions, existence theorems, and computational complexity. Theoret. Comput. Sci. 81 317-324.
15. Nisan, N., J. Bayer, D. Chandra, T. Franji, R. Gardner, Y. Matias, N. Rhodes, M. Seltzer, D. Tom, H. Varian. 2009. Google's auction for TV ads. Proc. 36th International Colloqium Automata, Languages and Programming, European Association for Theoretical Computer Science, Rhodes, Greece, 309-327.
16. Patinkin, D. 1965. Money, Interest, and Prices. An Integration of Monetary and Value Theory. Harper and Row, New York.
17. Vazirani, V. V. 2008. Nash bargaining via flexible budget markets. JACM. Submitted for publication.
18. Vazirani, V. V. 2010. Seeking combinatorial algorithms for convex programs. Noam Nisan's Algorithmic Game Theory Blog. Accessed January 12, 2010. http://agtb.wordpress.com/.
19. Vazirani, V. V., L. Wang. 2009. Continuity properties of equilibria in some Fisher and Arrow-Debreu market models. Proc. 5th Workshop Internet Network Economics, Rome, 422-429.
20. Vazirani, V. V., M. Yannakakis. 2010. Market equilibria under separable, piecewise-linear, concave utilities. Proc. First Sympos. Innovations Comput. Sci., Beijing