Skip to main content
SpringerLink
Log in

Making Economic Theory Operational

  • Conference paper
Internet and Network Economics (WINE 2006)

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

Included in the following conference series:

  • 992 Accesses

Abstract

We focus on the opportunity the Internet has provided for a fully operational Economic Theory. We should review a few of the current development of the algorithmic approach in its study and postulate on the important issues that lie ahead of us.

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

Access this chapter

Log in via an institution
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. Gates, B.: The Road Ahead. Penguin (1996)

    Google Scholar 

  2. Lange, O.: The Computer and the Market. In: Socialism, Capitalism and Economic Growth: Essays Presented to Maurice Dobb, pp. 158–161. Cambridge University Press, New York (1961)

    Google Scholar 

  3. Scarf, H.: On the Computation of Equilibrium Prices. In: Ten Economic Studies in the Tradition of Irving Fisher, pp. 207–230. Wiley, New York (1967)

    Google Scholar 

  4. Simon, H.: Models of Man. John Wiley, Chichester (1957)

    MATH  Google Scholar 

  5. Papadimitriou, C.H., Yannakakis, M.: On complexity as bounded rationality (extended abstract). In: Proceedings of the Twenty-Sixth Annual ACM Symposium on the Theory of Computing, Montréal, Québec, Canada, pp. 726–733 (1994)

    Google Scholar 

  6. Deng, X., Papadimitriou, C.H.: On the complexity of cooperative solution concepts. Math. Oper. Res. 19, 257–266 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  7. Deng, X., Ibaraki, T., Nagamochi, H.: Combinatorial optimization games. In: Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms, New York, Philadelphia, pp. 720–729. ACM-SIAM (1997)

    Google Scholar 

  8. Bikhchandani, S., Mamer, J.W.: Competitive equilibrium in an exchange economy with indivisibilities. Journal of Economic Theory 74(2), 385–413 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  9. Deng, X., Papadimitriou, C.H., Safra, S.: On the complexity of price equilibria. Journal of Computer System and Science 67(2), 311–324 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  10. Ye, Y.: Exchange market equilibria with leontief’s utility: Freedom of pricing leads to rationality. In: Deng, X., Ye, Y. (eds.) WINE 2005. LNCS, vol. 3828, pp. 14–23. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  11. Codenotti, B., Saberi, A., Varadarajan, K.R., Ye, Y.: Leontief economies encode nonzero sum two-player games. In: Proceedings of the seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2006), Miami, FL, pp. 659–667. ACM Press, New York (2006)

    Chapter  Google Scholar 

  12. Nenakov, E.I., Primak, M.E.: One algorithm for finding solutions of the arrow-debreu model. Kibernetica 3, 127–128 (1983)

    Google Scholar 

  13. Devanur, N.R., Papadimitriou, C.H., Saberi, A., Vazirani, V.V.: Market equilibrium via a primal-dual-type algorithm. In: Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), pp. 389–395. IEEE COMPUTER SOCIETY, Los Alamitos (2002)

    Chapter  Google Scholar 

  14. Jain, K.: A polynomial time algorithm for computing an Arrow–Debreu market equilibrium for linear utilities. In: Proceedings of 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2004), Rome, Italy, pp. 286–294. IEEE Computer Society Press, Los Alamitos (2004)

    Google Scholar 

  15. Cai, M., Deng, X.: Arbitrage in frictional foreign exchange market. Electronic Notes in Theoretical Computer Science 78 (2003)

    Google Scholar 

  16. Daskalakis, C., Goldberg, P.W., Papadimitriou, C.H.: The complexity of computing a Nash equilibrium. In: Proceedings of the Thirty-Eighth Annual ACM Symposium on Theory of Computing, Seattle, W.A., USA, pp. 71–78. ACM Press, New York (2006)

    Chapter  Google Scholar 

  17. Chen, X., Deng, X.: Settling the complexity of 2-player nash-equilibrium. In: 46th Symposium on Foundations of Computer Science (FOCS 2006) (to appear, 2006)

    Google Scholar 

  18. Sen, A.K.: Collective choice and social welfare. Holden-Day (1970)

    Google Scholar 

  19. Buchanan, J.M., Tullock, G.: The Calculus of Consent: Logical Foundations of Constitutional Democracy. University of Michigan Press (1962)

    Google Scholar 

  20. Daskalakis, C., Fabrikant, A., Papadimitriou, C.H.: The game world is flat: The complexity of nash equilibria in succinct games. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4051, pp. 513–524. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  21. Savani, R., Stengel, B.: Hard-to-solve bimatrix games. Econometrica 74(2), 397–429 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  22. Gilboa, I., Zemel, E.: Nash and correlated equilibria: Some complexity considerations. Games and Economic Behavior 1, 80–93 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  23. Chen, X., Deng, X., Teng, S.H.: Computing nash equilibria: Approximation and smoothed complexity. In: 46th Symposium on Foundations of Computer Science (FOCS 2006) (to appear, 2006)

    Google Scholar 

  24. Spielman, D.A., Teng, S.H.: Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time. Journal of the ACM 51(3), 385–463 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  25. Chen, X., Teng, S.H., Valiant, P.: The approximation complexity of win-lose games. In: The eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2007) (to appear, 2007)

    Google Scholar 

  26. Abbott, T., Kane, D., Valiant, P.: On the complexity of two-player win-lose games. In: Proceedings of the 45th Symposium on Foundations of Computer Science (FOCS 2005), pp. 113–122 (2005)

    Google Scholar 

  27. Huang, L.S., Teng, S.H.: On the approximation and smoothed complexity of leontief market equilibria. In: ECCC (2006)

    Google Scholar 

  28. Kontogiannis, S., Panagopoulou, P., Spirakis, P.: Polynomial algorithms for approximating nash equilibria of bimatrix games. In: Spirakis, P.G., Mavronicolas, M., Kontogiannis, S.C. (eds.) WINE 2006. LNCS, vol. 4286, pp. 286–296. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  29. Constantinos Daskalakis, A.M., Papadimitriou, C.: A note on approximate nash equilibria. In: Spirakis, P.G., Mavronicolas, M., Kontogiannis, S.C. (eds.) WINE 2006. LNCS, vol. 4286, pp. 297–306. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  30. Chen, X., Deng, X.: On algorithms for discrete and approximate brouwer fixed points. In: Gabow, H.N., Fagin, R. (eds.) Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, M.D., USA, pp. 323–330. ACM Press, New York (2005)

    Google Scholar 

  31. Codenotti, B., Pemmaraju, S., Varadarajan, K.: The computation of market equilibria. SIGACTN: SIGACT News (ACM Special Interest Group on Automata and Computability Theory) 35(4) (2004)

    Google Scholar 

  32. Arrow, K., Debreu, G.: Existence of an equilibrium for a competitive economy. Econometrica 22(3), 265–290 (1954)

    Article  MATH  MathSciNet  Google Scholar 

  33. Uzawa, H.: Walras’s existence theorem and brouwer’s fixed point theorem. Economic Studies Quarterly 13, 59–62 (1962)

    Google Scholar 

  34. Friedman, D., Rust, J.: The Double Auction Market: Institutions, Theories, and Evidence. Addison Wesley Publishing Company, Reading (1993)

    Google Scholar 

  35. Goldberg, A.V., Hartline, J.D., Wright, A.: Competitive auctions and digital goods. In: Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2001), pp. 735–744. ACM Press, New York (2001)

    Google Scholar 

  36. Huber, P.: Two cheers for price discrimination. Forbes, 142 (September 27, 1993)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, City University of Hong Kong, Hong Kong

    Xiaotie Deng

Authors
  1. Xiaotie Deng
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Engineering and Informatics, University of Patras, 26500, Rio, Patras, Greece

    Paul Spirakis

  2. Department of Computer Science, University of Cyprus, CY-1678, Nicosia, Cyprus

    Marios Mavronicolas

  3. R.A. Computer Technology Institute, N. Kazantzakis Str., University Campus, 26500, Rio–Patra, Greece

    Spyros Kontogiannis

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Deng, X. (2006). Making Economic Theory Operational. In: Spirakis, P., Mavronicolas, M., Kontogiannis, S. (eds) Internet and Network Economics. WINE 2006. Lecture Notes in Computer Science, vol 4286. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11944874_23

Download citation

  • DOI: https://doi.org/10.1007/11944874_23

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-68138-0

  • Online ISBN: 978-3-540-68141-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation