Communication networks: Pricing, congestion control, routing, and scheduling

Srinivas Shakkottai, R. Srikant

Research output: Chapter in Book/Report/Conference proceedingChapter


This chapter considers three fundamental problems in the general area of communication networks and their relationship to game theory. These problems are (i) allocation of shared bandwidth resources, (ii) routing across shared links, and (iii) scheduling across shared spectrum. Each problem inherently involves agents that experience negative externalities under which the presence of one degrades the utility perceived by others. Two approaches to solving such problems are (i) to find a globally optimal allocation and simply implement it in a fait accompli fashion, and (ii) request information from the competing agents (traffic flows) and construct a mechanism to allocate resources. Often, only the second option is viable, since a centralized solution using complete information might be impractical (or impossible) with many millions of competing flows, each one having private information about the application that it corresponds to. Hence, a game theoretical analysis of these problems is natural. In what follows, we will present results on each problem and characterize the efficiency loss that results from the mechanism employed.

Original languageEnglish (US)
Title of host publicationHandbook of Dynamic Game Theory
Number of pages42
ISBN (Electronic)9783319443744
ISBN (Print)9783319443737
StatePublished - Aug 12 2018


  • Communication networks
  • Congestion control
  • Packet scheduling
  • Traffic routing
  • Utility maximization

ASJC Scopus subject areas

  • Mathematics(all)
  • Economics, Econometrics and Finance(all)
  • Business, Management and Accounting(all)


Dive into the research topics of 'Communication networks: Pricing, congestion control, routing, and scheduling'. Together they form a unique fingerprint.

Cite this