Skip to main content

Learning the Internet

  • Conference paper
  • First Online:
Computational Learning Theory (COLT 2002)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2375))

Included in the following conference series:

Abstract

The Internet is arguably the most important, complex, interesting, and intellectually challenging computational artifact of our time, and it is therefore worthy of the research community’s attention. The most novel and defining characteristic of the Internet is its nature as an artifact that was not designed by a single entity, but emerged from the complex interaction of many economic agents (network operators, service providers, users, etc.), in various and varying degrees of collaboration and competition. There is a nascent research area that combines algorithmic thinking with concepts from Game Theory, as well as the realities of the Internet, in order to better understand it. This line of research may actually bring back to the fore certain foundational aspects of Game Theory (namely, the nature of equilibria as well as their relationship to repeated play and evolution) in which the methodology of Learning Theory has much to contribute.

The Internet is also an information repository of unprecedented extent, diversity, availability, and lack of structure, and it has therefore become an arena for the development of a new generation of sophisticated techniques for information retrieval and data mining (and to which Learning Theory has obviously much to offer). It has been suggested that economic considerations are crucial in formulating problems also in this environment, and can shed new light on important topics such as clustering and privacy.

Because of its spontaneous emergence, the Internet is the first computational artifact that must be studied as a mysterious object (akin to matter, market, and intelligence) whose laws we must derive by observation, experiment, and the development of falsifiable theories. Recently, a plausible explanation of the skewed degree distributions one observes in the Internet topology was based on simple models of network creation, in which arriving nodes choose connections that achieve a favorable tradeoff among criteria such as last-mile distance and communication delays. These topics will be illustrated in terms of recent models and results by the speaker and co-authors, generally available at the speaker’s web page.

Research supported by two NSF ITR grants, and an IBM award.

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

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Papadimitriou, C. (2002). Learning the Internet. In: Kivinen, J., Sloan, R.H. (eds) Computational Learning Theory. COLT 2002. Lecture Notes in Computer Science(), vol 2375. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45435-7_27

Download citation

  • DOI: https://doi.org/10.1007/3-540-45435-7_27

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43836-6

  • Online ISBN: 978-3-540-45435-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics