Algorithms, Games, and the Internet

Extended Abstract
  • Christos H. Papadimitriou
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2076)

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?

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    J. Feigenbaum, C.H. Papadimitriou, S. Shenker, “Sharing the cost of multicast transmissions,” Proc. STOC 2000.Google Scholar
  2. 2.
    E. Koutsoupias, C.H. Papadimitriou, “Worst-case equilibria,” Proc. STACS 1998.Google Scholar
  3. 3.
    A. Mas-Colell, M.D. Winston, J.R. Green Microeconomic Theory, Oxford University Press 1995.Google Scholar
  4. 4.
    N. Nisan, “Algorithms for selfish agents-Mechanism design for distributed computation,” Proc. STACS 1999.Google Scholar
  5. 5.
    M.J. Osborne, A. Rubinstein, A Course in Game Theory, MIT Press, 1994.Google Scholar
  6. 6.
    T. Roughgarden, E. Tardos, “How Bad is Selfish Routing? (Extended Abstract),” Proc. FOCS 2000.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Christos H. Papadimitriou
    • 1
  1. 1.Computer Science DivisionUC BerkeleyBerkeleyUSA

Personalised recommendations