Skip to main content

Algorithms, Games, and the Internet

Extended Abstract

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2076))

Included in the following conference series:

Abstract

Over the past fifty years, researchers in Theoretical Computer Science have sought and achieved a productive foundational understanding of the von Neumann computer and its software, employing the mathematical tools of Logic and Combinatorics. The next half century appears now much more confusing (half- centuries tend to look like that in the beginning). What computational artifact will be the object of the next great modeling adventure of our field? And what mathematical tools will be handy in this endeavor?

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

References

  1. J. Feigenbaum, C.H. Papadimitriou, S. Shenker, “Sharing the cost of multicast transmissions,” Proc. STOC 2000.

    Google Scholar 

  2. E. Koutsoupias, C.H. Papadimitriou, “Worst-case equilibria,” Proc. STACS 1998.

    Google Scholar 

  3. A. Mas-Colell, M.D. Winston, J.R. Green Microeconomic Theory, Oxford University Press 1995.

    Google Scholar 

  4. N. Nisan, “Algorithms for selfish agents-Mechanism design for distributed computation,” Proc. STACS 1999.

    Google Scholar 

  5. M.J. Osborne, A. Rubinstein, A Course in Game Theory, MIT Press, 1994.

    Google Scholar 

  6. T. Roughgarden, E. Tardos, “How Bad is Selfish Routing? (Extended Abstract),” Proc. FOCS 2000.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Papadimitriou, C.H. (2001). Algorithms, Games, and the Internet. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds) Automata, Languages and Programming. ICALP 2001. Lecture Notes in Computer Science, vol 2076. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48224-5_1

Download citation

  • DOI: https://doi.org/10.1007/3-540-48224-5_1

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42287-7

  • Online ISBN: 978-3-540-48224-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics