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