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

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

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (28)

• 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
• Nonspecific networking
• The complexity of welfare maximization in congestion games
• An application of optimization theory to the study of equilibria for games: a survey
• Computing pure Nash and strong equilibria in bottleneck congestion games
• Informational Braess’ Paradox: The Effect of Information on Traffic Congestion
• Selfish routing with incomplete information
• A universal construction generating potential games
• Congestion games with capacitated resources
• Network topology and the efficiency of equilibrium
• On the convergence of multicast games in directed networks
• Weighted Boolean Formula Games
• 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
• Nash equilibria in all-optical networks
• Computing the strong Nash equilibrium for Markov chains games
• Equilibria in bottleneck games
• Congestion games revisited
• 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)