Potential functions and the inefficiency of equilibria

MaRDI QIDQ5491025zbMATH OpenFDO

Authors Tim Roughgarden

Publication date 26 September 2006

zbMATH Keywords

Game theoryinefficiency of equilibriaNash equilibriumnetwork designpotential functionsprice of anarchyprice of stabilityresource allocationselfish routing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25) Noncooperative games (91A10) Hierarchical games (including Stackelberg games) (91A65)

Recommendations

• Network formation games and the potential function method
• Convergence and approximation in potential games
• An application of optimization theory to the study of equilibria for games: a survey
• Bounding the potential function in congestion games and approximate pure Nash equilibria
• Potential Functions in Strategic Games

Cited in

(12)

• Self-organizing flows in social networks
• Self-organizing flows in social networks
• An application of optimization theory to the study of equilibria for games: a survey
• On the efficiency of markets with two-sided proportional allocation mechanisms
• The price of matching with metric preferences
• Introduction to the inefficiency of equilibria
• Network formation games and the potential function method
• Nash equilibria with minimum potential in undirected broadcast games
• Selfishness level of strategic games
• Welfare guarantees for proportional allocations
• Centralization in block-building and proposer-builder separation
• Network design with weighted players

This page was built for publication: Potential functions and the inefficiency of equilibria

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5491025)