IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-319-44374-4_29.html
   My bibliography  Save this book chapter

Communication Networks: Pricing, Congestion Control, Routing, and Scheduling

In: Handbook of Dynamic Game Theory

Author

Listed:
  • Srinivas Shakkottai

    (Texas A&M University, Department of Electrical and Computer Engineering)

  • R. Srikant

    (University of Illinois at Urbana-Champaign, Department of Electrical and Computer Engineering)

Abstract

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.

Suggested Citation

  • Srinivas Shakkottai & R. Srikant, 2018. "Communication Networks: Pricing, Congestion Control, Routing, and Scheduling," Springer Books, in: Tamer Başar & Georges Zaccour (ed.), Handbook of Dynamic Game Theory, chapter 26, pages 1143-1184, Springer.
    • Handle: RePEc:spr:sprchp:978-3-319-44374-4_29
    DOI: 10.1007/978-3-319-44374-4_29
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-3-319-44374-4_29. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.