Equilibria in Multiclass and Multidimensional Atomic Congestion Games

DOI10.1287/moor.2021.1223zbMath1505.91050OpenAlexW4214735404MaRDI QIDQ5870354

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

consistencyflowpure Nash equilibriumcongestion gamemultimodal traffic

Mathematics Subject Classification ID

Potential and congestion games (91A14)

Cites Work

• Unnamed Item
• Characterizing the existence of potential functions in weighted congestion games
• Network design with weighted players
• Strong price of anarchy
• Pure Nash equilibria in player-specific and weighted congestion games
• Potential games
• Congestion games with player-specific payoff functions
• Fictitious play property for games with identical interests
• Equilibrium points of nonatomic games
• Strong equilibria in games with the lexicographical improvement property
• A class of games possessing pure-strategy Nash equilibria
• Selfish unsplittable flows
• Congestion Games with Variable Demands
• Congestion Games with Higher Demand Dimensions
• Approximate Pure Nash Equilibria in Weighted Congestion Games
• On the Complexity of Pure-Strategy Nash Equilibria in Congestion and Local-Effect Games
• The Price of Stability for Network Design with Fair Cost Allocation
• On the impact of combinatorial structure on congestion games
• Algorithms for pure Nash equilibria in weighted congestion games
• The complexity of pure Nash equilibria
• Equilibria on a Congested Transportation Network
• Potential Games Are Necessary to Ensure Pure Nash Equilibria in Cost Sharing Games
• On the Existence of Pure Nash Equilibria in Weighted Congestion Games
• Atomic resource sharing in noncooperative networks