Computing pure Nash and strong equilibria in bottleneck congestion games
From MaRDI portal
Publication:378094
DOI10.1007/s10107-012-0521-3zbMath1288.91010OpenAlexW2759949687MaRDI QIDQ378094
Martin Hoefer, Alexander Skopalik, Max Klimm, Tobias Harks
Publication date: 11 November 2013
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-012-0521-3
Noncooperative games (91A10) Communication networks in operations research (90B18) Games involving graphs (91A43) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Combinatorial games (91A46)
Related Items (7)
Congestion Games with Complementarities ⋮ Congestion games with mixed objectives ⋮ Bottleneck Routing with Elastic Demands ⋮ Bottleneck routing with elastic demands ⋮ Congestion Games with Mixed Objectives ⋮ A logarithmic approximation for polymatroid congestion games ⋮ Computation and efficiency of potential function minimizers of combinatorial congestion games
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convergence to approximate Nash equilibria in congestion games
- Strong equilibrium in cost sharing connection games
- Atomic routing games on maximum congestion
- Strong price of anarchy
- Efficient graph topologies in network routing games
- How easy is local search?
- The directed subgraph homeomorphism problem
- Equilibria in a model with partial rivalry
- Strong equilibrium in congestion games
- Potential games
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- A matroid approach to finding edge connectivity and packing arborescences
- Congestion games with player-specific payoff functions
- Strong equilibria in games with the lexicographical improvement property
- A class of games possessing pure-strategy Nash equilibria
- Bottleneck Congestion Games with Logarithmic Price of Anarchy
- On the Complexity of Pareto-optimal Nash and Strong Equilibria
- On the Inefficiency of Equilibria in Linear Bottleneck Congestion Games
- Routing (un-) splittable flow in games with player-specific affine latency functions
- On the impact of combinatorial structure on congestion games
- Congestion Games with Player-Specific Constants
- The complexity of pure Nash equilibria
- Bottleneck links, variable demand, and the tragedy of the commons
- Nash Dynamics in Constant Player and Bounded Jump Congestion Games
- Approximate Strong Equilibrium in Job Scheduling Games
- On the Value of Coordination in Network Design
- Improved Bounds for Matroid Partition and Intersection Algorithms
- CONGESTION GAMES AND POTENTIALS RECONSIDERED
- Concurrent imitation dynamics in congestion games
- Network formation games with local coalitions
- Strong Price of Anarchy for Machine Load Balancing
- Combinatorial optimization. Theory and algorithms.
This page was built for publication: Computing pure Nash and strong equilibria in bottleneck congestion games
