Congestion games with mixed objectives

DOI10.1007/S10878-017-0189-YzbMath1411.91139OpenAlexW2766040753MaRDI QIDQ1631669

Lennart Leder, Matthias Feldotto, Alexander Skopalik

Publication date: 6 December 2018

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://research.utwente.nl/en/publications/congestion-games-with-mixed-objectives(478db962-db17-469f-b854-7730266588e5).html

zbMATH Keywords

complexityconvergenceexistenceapproximationcongestion gamesbottleneck congestion gamespure Nash equilibrium

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Noncooperative games (91A10) Games involving graphs (91A43)

Cites Work

• Unnamed Item
• Unnamed Item
• Computing pure Nash and strong equilibria in bottleneck congestion games
• Convergence to approximate Nash equilibria in congestion games
• Pure Nash equilibria in player-specific and weighted congestion games
• The directed subgraph homeomorphism problem
• Potential games
• Congestion games with player-specific payoff functions
• A class of games possessing pure-strategy Nash equilibria
• Selfish unsplittable flows
• Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria
• Approximate Pure Nash Equilibria in Weighted Congestion Games
• On the Complexity of Pure-Strategy Nash Equilibria in Congestion and Local-Effect Games
• On the impact of combinatorial structure on congestion games
• Congestion Games with Player-Specific Constants
• Complexity of Pure Nash Equilibria in Player-Specific Network Congestion Games
• Bottleneck links, variable demand, and the tragedy of the commons
• Efficient Computation of Approximate Pure Nash Equilibria in Congestion Games

This page was built for publication: Congestion games with mixed objectives