CONGESTION GAMES AND POTENTIALS RECONSIDERED

DOI10.1142/S0219198999000219zbMATH Open1045.91501OpenAlexW1957147520MaRDI QIDQ4816625FDOQ4816625

Authors Giovanni Facchini, Mark Voorneveld, Peter Borm, Freek van Megen, Stef Tijs 

Publication date 10 September 2004

Published in International Game Theory Review (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0219198999000219

Mathematics Subject Classification ID

Noncooperative games (91A10) (n)-person games, (n>2) (91A06) Other game-theoretic models (91A40)

Recommendations

• Congestion games revisited
• Games with congestion-averse utilities
• Congestion models and weighted Bayesian potential games
• Congestion games with player-specific payoff functions
• Strong equilibrium in congestion games

Cites Work

• A Tiebout theorem
• A class of games possessing pure-strategy Nash equilibria
• Congestion games with player-specific payoff functions
• Congestion models and weighted Bayesian potential games
• Equilibria in a model with partial rivalry
• Minimality of consistent solutions for strategic games, in particular for potential games
• Potential games
• Strong equilibrium in congestion games

Cited In (34)

• An axiomatization of the Nash equilibrium concept
• A game-theoretical model of the landscape theory
• On Satisfiability Games and the Power of Congestion Games
• Games with congestion-averse utilities
• Potential games with continuous player sets
• Bounding the inefficiency of equilibria in nonatomic congestion games
• Weighted Boolean formula games
• Nonspecific networking
• The complexity of welfare maximization in congestion games
• An application of optimization theory to the study of equilibria for games: a survey
• Potential in congestion game with different types of vehicles
• Totally unimodular congestion games
• Computing pure Nash and strong equilibria in bottleneck congestion games
• Selfish routing with incomplete information
• Equilibrium and potential in coalitional congestion games
• A universal construction generating potential games
• Congestion games with capacitated resources
• Network topology and the efficiency of equilibrium
• Rosenthal's potential and a discrete version of the Debreu-Gorman theorem
• On the convergence of multicast games in directed networks
• Social optimality and cooperation in nonatomic congestion games.
• The cutting power of preparation
• A survey of static and dynamic potential games
• Solution-based congestion games
• Designing fast converging cost sharing methods for multicast transmissions
• A selective tour through congestion games
• Nash equilibria in all-optical networks
• Computing the strong Nash equilibrium for Markov chains games
• Equilibria in bottleneck games
• Informational Braess' paradox: the effect of information on traffic congestion
• Congestion games revisited
• Greediness and equilibrium in congestion games
• Strong equilibria in games with the lexicographical improvement property
• Computing the strong \(L_p\)-Nash equilibrium for Markov chains games: convergence and uniqueness

This page was built for publication: CONGESTION GAMES AND POTENTIALS RECONSIDERED

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