Skip to main content

A Simplex-Like Algorithm for Fisher Markets

  • Conference paper
Book cover Algorithmic Game Theory (SAGT 2010)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 6386))

Included in the following conference series:

Abstract

We propose a new convex optimization formulation for the Fisher market problem with linear utilities. Like the Eisenberg-Gale formulation, the set of feasible points is a polyhedral convex set while the cost function is non-linear; however, unlike that, the optimum is always attained at a vertex of this polytope. The convex cost function depends only on the initial endowments of the buyers. This formulation yields an easy simplex-like pivoting algorithm which is provably strongly polynomial for many special cases.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Adsul, B., Babu, C.S., Garg, J., Mehta, R., Sohoni, M.: Nash equilibria in Fisher market. arXiv:1002.4832 (2010)

    Google Scholar 

  2. Birnbaum, B., Devanur, N.R., Xiao, L.: New convex programs and distributed algorithms for Fisher markets with linear and spending constraint utilities. Working Paper (2010)

    Google Scholar 

  3. Chakraborty, S., Devanur, N.R., Karande, C.: Market equilibrium with transaction costs. arXiv:1001.0393 (2010)

    Google Scholar 

  4. Deng, X., Papadimitriou, C.H., Safra, S.: On the complexity of equilibria. In: STOC 2002 (2002)

    Google Scholar 

  5. Devanur, N.R., Papadimitriou, C.H., Saberi, A., Vazirani, V.V.: Market equilibrium via a primal-dual type algorithm. JACM 55(5) (2008)

    Google Scholar 

  6. Eisenberg, E., Gale, D.: Consensus of subjective probabilities: The pari-mutuel method. Annals Math. Stat. 30, 165–168 (1959)

    Article  MathSciNet  MATH  Google Scholar 

  7. Garg, J.: Algorithms for market equilibrium. First APS Report (2008), http://www.cse.iitb.ac.in/~jugal/aps1.pdf

  8. Garg, J.: Fisher markets with transportation costs. Technical Report (2009), http://www.cse.iitb.ac.in/~jugal/techRep.pdf

  9. Jain, K.: A polynomial time algorithm for computing the Arrow-Debreu market equilibrium for linear utilities. In: FOCS 2004 (2004)

    Google Scholar 

  10. Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.V.: Algorithmic Game Theory. Cambridge University Press, Cambridge (2007)

    Book  MATH  Google Scholar 

  11. Orlin, J.B.: Improved algorithms for computing Fisher’s market clearing prices. In: STOC 2010 (2010)

    Google Scholar 

  12. Shmyrev, V.I.: An algorithm for finding equilibrium in the linear exchange model with fixed budgets. Journal of Applied and Industrial Mathematics 3(4), 505–518 (2009)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Adsul, B., Babu, C.S., Garg, J., Mehta, R., Sohoni, M. (2010). A Simplex-Like Algorithm for Fisher Markets. In: Kontogiannis, S., Koutsoupias, E., Spirakis, P.G. (eds) Algorithmic Game Theory. SAGT 2010. Lecture Notes in Computer Science, vol 6386. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16170-4_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-16170-4_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-16169-8

  • Online ISBN: 978-3-642-16170-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics