Congestion Games with Mixed Objectives
From MaRDI portal
Publication:2958352
DOI10.1007/978-3-319-48749-6_47zbMath1486.91006arXiv1607.05143OpenAlexW3102005285MaRDI QIDQ2958352
Lennart Leder, Matthias Feldotto, Alexander Skopalik
Publication date: 1 February 2017
Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1607.05143
complexityconvergenceexistenceapproximationcongestion gamesbottleneck congestion gamespure Nash equilibrium
Related Items (2)
Congestion Games with Complementarities ⋮ Computing equilibrium in network utility-sharing and discrete election games
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
- 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