Network Games

S. Rasoul Etesami () and Tamer Başar ()
Additional contact information
S. Rasoul Etesami: University of Illinois at Urbana-Champaign, Department of Industrial and Systems Engineering
Tamer Başar: University of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Electrical and Computer Engineering

Chapter 12 in Handbook of Dynamic Game Theory, 2018, pp 547-593 from Springer

Abstract: Abstract This chapter provides a general overview of the topic of network games, its application in a number of areas, and recent advances, by focusing on four major types of games, namely, congestion games, resource allocation games, diffusion games, and network formation games. Several algorithmic aspects and methodologies for analyzing such games are discussed, and connections between network games and other relevant topical areas are identified.

Keywords: Network games; Congestion games; Diffusion games; Potential games; Resource allocation; Network formation; Nash equilibrium; Price of anarchy (search for similar items in EconPapers)
Date: 2018
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-319-44374-4_10

Ordering information: This item can be ordered from
http://www.springer.com/9783319443744

DOI: 10.1007/978-3-319-44374-4_10

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().