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?
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
J. Feigenbaum, C.H. Papadimitriou, S. Shenker, “Sharing the cost of multicast transmissions,” Proc. STOC 2000.
E. Koutsoupias, C.H. Papadimitriou, “Worst-case equilibria,” Proc. STACS 1998.
A. Mas-Colell, M.D. Winston, J.R. Green Microeconomic Theory, Oxford University Press 1995.
N. Nisan, “Algorithms for selfish agents-Mechanism design for distributed computation,” Proc. STACS 1999.
M.J. Osborne, A. Rubinstein, A Course in Game Theory, MIT Press, 1994.
T. Roughgarden, E. Tardos, “How Bad is Selfish Routing? (Extended Abstract),” Proc. FOCS 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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