IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-030-24455-2_9.html
   My bibliography  Save this book chapter

“Beat-Your-Rival” Routing Games

In: Multilevel Strategic Interaction Game Models for Complex Networks

Author

Listed:
  • Gideon Blocq

    (Technion - Israel Institute of Technology, Viterbi Faculty of Electrical Engineering)

  • Ariel Orda

    (Technion - Israel Institute of Technology, Viterbi Faculty of Electrical Engineering)

Abstract

To date, game theoretic models have been employed in virtually all networking contexts. These include control tasks at the network layer, such as flow control and routing (e.g., [14, 36, 161, 191, 202, 224] and references therein), as well as numerous studies on control tasks at the link and MAC layers. A fundamental assumption in all of these referenced studies is that the selfish agents compete over resources in the network and aim to optimize their own performance; agents do not care (either way) about the performance of their competitors. However, and typically in the context of routing, scenarios exist in which this assumption is not warranted.

Suggested Citation

  • Gideon Blocq & Ariel Orda, 2019. "“Beat-Your-Rival” Routing Games," Springer Books, in: Eitan Altman & Konstantin Avrachenkov & Francesco De Pellegrini & Rachid El-Azouzi & Huijuan Wang (ed.), Multilevel Strategic Interaction Game Models for Complex Networks, chapter 0, pages 167-184, Springer.
    • Handle: RePEc:spr:sprchp:978-3-030-24455-2_9
    DOI: 10.1007/978-3-030-24455-2_9
    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

    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-030-24455-2_9. 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.