Computer Science – Computer Science and Game Theory
Scientific paper
2011-11-16
Computer Science
Computer Science and Game Theory
Scientific paper
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 by 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.
Kuniavsky Sergey
Smorodinsky Rann
No associations
LandOfFree
Equilibrium and Potential in Coalitional Congestion Games does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Equilibrium and Potential in Coalitional Congestion Games, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Equilibrium and Potential in Coalitional Congestion Games will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-348753