Equilibrium and potential in coalitional congestion games

Sergey Kuniavsky () and Rann Smorodinsky ()

Theory and Decision, 2014, vol. 76, issue 1, 69-79

Abstract: The model of congestion games is widely used to analyze games related to traffic and communication. A central property of these games is that they are potential games and hence posses a pure Nash equilibrium. In reality, it is often the case that some players cooperatively decide on their joint action in order to maximize the coalition’s total utility. This is modeled by Coalitional Congestion Games. Typical settings include truck drivers who work for the same shipping company, or routers that belong to the same ISP. The formation of coalitions will typically imply that the resulting coalitional congestion game will no longer posses a pure Nash equilibrium. In this paper, we provide conditions under which such games are potential games and posses a pure Nash equilibrium. Copyright Springer Science+Business Media New York 2014

Keywords: Congestion games; Equilibrium; Potential; Coalitions; C72 (search for similar items in EconPapers)
Date: 2014
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1007/s11238-013-9357-4 (text/html)
Access to full text is restricted to subscribers.

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:kap:theord:v:76:y:2014:i:1:p:69-79

Ordering information: This journal article can be ordered from
http://www.springer. ... ry/journal/11238/PS2

DOI: 10.1007/s11238-013-9357-4

Access Statistics for this article

Theory and Decision is currently edited by Mohammed Abdellaoui

More articles in Theory and Decision from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().