Equilibria in Multiclass and Multidimensional Atomic Congestion Games

DOI10.1287/MOOR.2021.1223MaRDI QIDQ5870354zbMATH OpenOpenAlexFDO

Authors Max Klimm, Andreas Schütz

Publication date 9 January 2023

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/moor.2021.1223

zbMATH Keywords

congestion gameconsistencyflowmultimodal trafficpure Nash equilibrium

Mathematics Subject Classification ID

Potential and congestion games (91A14)

Recommendations

• On the existence of pure Nash equilibria in weighted congestion games
• On the existence of pure Nash equilibria in weighted congestion games
• Congestion Games with Multi-Dimensional Demands
• Congestion games with player-specific costs revisited
• Congestion games with variable demands

Cites work

• A class of games possessing pure-strategy Nash equilibria
• Algorithms for pure Nash equilibria in weighted congestion games
• Approximate pure Nash equilibria in weighted congestion games
• Atomic resource sharing in noncooperative networks
• Characterizing the existence of potential functions in weighted congestion games
• Congestion games with higher demand dimensions
• Congestion games with player-specific payoff functions
• Congestion games with variable demands
• Equilibria on a Congested Transportation Network
• Equilibrium points of nonatomic games
• Fictitious play property for games with identical interests
• scientific article; zbMATH DE number 3139273 (Why is no real title available?)
• Network design with weighted players
• On the complexity of pure-strategy Nash equilibria in congestion and local-effect games
• On the existence of pure Nash equilibria in weighted congestion games
• On the impact of combinatorial structure on congestion games
• Potential games
• Potential games are \textit{necessary} to ensure pure Nash equilibria in cost sharing games
• Pure Nash equilibria in player-specific and weighted congestion games
• Selfish unsplittable flows
• Strong equilibria in games with the lexicographical improvement property
• Strong price of anarchy
• The complexity of pure Nash equilibria
• The Price of Stability for Network Design with Fair Cost Allocation

Cited in

(8)

• Computing solutions of the multiclass network equilibrium problem with affine cost functions
• Non-atomic one-round walks in congestion games
• Congestion games with higher demand dimensions
• A Lemke-like algorithm for the multiclass network equilibrium problem
• Stackelberg Strategies for Atomic Congestion Games
• Dynamic Atomic Congestion Games with Seasonal Flows
• On the existence of pure Nash equilibria in weighted congestion games
• On the existence of pure Nash equilibria in weighted congestion games

This page was built for publication: Equilibria in Multiclass and Multidimensional Atomic Congestion Games

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