scholarly journals Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games

2017 ◽  
pp. 191-204 ◽  
Author(s):  
Matthias Feldotto ◽  
Martin Gairing ◽  
Grammateia Kotsialou ◽  
Alexander Skopalik
Keyword(s):  
Shapley Value ◽  
Nash Equilibria ◽  
Congestion Games

Classes of Potential Games

2017 ◽  
Author(s):  
João P. Hespanha
Keyword(s):  
Resource Allocation ◽  
Nash Equilibrium ◽  
Nash Equilibria ◽  
Potential Games ◽  
Congestion Games ◽  
Fictitious Play ◽  
Resource Allocation Problem ◽  
Distributed Resource Allocation ◽  
Symmetric Games ◽  
The Cost

This chapter discusses several classes of potential games that are common in the literature and how to derive the Nash equilibrium for such games. It first considers identical interests games and dummy games before turning to decoupled games and bilateral symmetric games. It then describes congestion games, in which all players are equal, in the sense that the cost associated with each resource only depends on the total number of players using that resource and not on which players use it. It also presents other potential games, including the Sudoku puzzle, and goes on to analyze the distributed resource allocation problem, the computation of Nash equilibria for potential games, and fictitious play. It concludes with practice exercises and their corresponding solutions, along with additional exercises.

Pure Nash Equilibria in Player-Specific and Weighted Congestion Games

2006 ◽  
pp. 50-61 ◽  
Author(s):  
Heiner Ackermann ◽  
Heiko Röglin ◽  
Berthold Vöcking
Keyword(s):  
Nash Equilibria ◽  
Congestion Games

Computing approximate pure Nash equilibria in congestion games

2012 ◽  
Vol 11 (1) ◽  
pp. 26-29 ◽  
Author(s):  
Ioannis Caragiannis ◽  
Angelo Fanelli ◽  
Nick Gravin ◽  
Alexander Skopalik
Keyword(s):  
Nash Equilibria ◽  
Congestion Games

scholarly journals Approximate Pure Nash Equilibria in Weighted Congestion Games

2015 ◽  
Vol 3 (1) ◽  
pp. 1-32 ◽  
Author(s):  
Ioannis Caragiannis ◽  
Angelo Fanelli ◽  
Nick Gravin ◽  
Alexander Skopalik
Keyword(s):  
Nash Equilibria ◽  
Congestion Games

scholarly journals On the Existence of Pure Nash Equilibria in Weighted Congestion Games

2012 ◽  
Vol 37 (3) ◽  
pp. 419-436 ◽  
Author(s):  
Tobias Harks ◽  
Max Klimm
Keyword(s):  
Nash Equilibria ◽  
Congestion Games

Convergence to approximate Nash equilibria in congestion games

2011 ◽  
Vol 71 (2) ◽  
pp. 315-327 ◽  
Author(s):  
Steve Chien ◽  
Alistair Sinclair
Keyword(s):  
Nash Equilibria ◽  
Congestion Games ◽  
Approximate Nash Equilibria

scholarly journals Pure Nash equilibria in player-specific and weighted congestion games

2009 ◽  
Vol 410 (17) ◽  
pp. 1552-1563 ◽  
Author(s):  
Heiner Ackermann ◽  
Heiko Röglin ◽  
Berthold Vöcking
Keyword(s):  
Nash Equilibria ◽  
Congestion Games

scholarly journals How hard is it to find extreme Nash equilibria in network congestion games?

2009 ◽  
Vol 410 (47-49) ◽  
pp. 4989-4999 ◽  
Author(s):  
Elisabeth Gassner ◽  
Johannes Hatzl ◽  
Sven O. Krumke ◽  
Heike Sperber ◽  
Gerhard J. Woeginger
Keyword(s):  
Nash Equilibria ◽  
Congestion Games ◽  
Network Congestion

scholarly journals Approximate pure nash equilibria in weighted congestion games

2012 ◽  
Author(s):  
Ioannis Caragiannis ◽  
Angelo Fanelli ◽  
Nick Gravin ◽  
Alexander Skopalik
Keyword(s):  
Nash Equilibria ◽  
Congestion Games
Sign in / Sign up

Export Citation Format

Share Document