Congestion games with capacitated resources
From MaRDI portal
Publication:904685
DOI10.1007/s00224-014-9541-0zbMath1327.91041OpenAlexW2154639153MaRDI QIDQ904685
Stefano Moretti, Laurent Gourvès, Nguyen Kim Thang, Jérôme Monnot
Publication date: 13 January 2016
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-014-9541-0
Analysis of algorithms and problem complexity (68Q25) Noncooperative games (91A10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Worst-case equilibria
- Graphical congestion games
- Algorithmic game theory. 5th international symposium, SAGT 2012, Barcelona, Spain, October 22--23, 2012. Proceedings
- The structure and complexity of Nash equilibria for a selfish routing game
- The college admissions problem is not equivalent to the marriage problem
- Predictive routing to enhance QoS for stream-based flows sharing excess bandwidth.
- Potential games
- Congestion games with player-specific payoff functions
- A class of games possessing pure-strategy Nash equilibria
- The Price of Stability for Network Design with Fair Cost Allocation
- On the impact of combinatorial structure on congestion games
- A Unified Approach to Congestion Games and Two-Sided Markets
- Convergence time to Nash equilibrium in load balancing
- The complexity of pure Nash equilibria
- The price of anarchy of finite congestion games
- Capacitated Network Design Games
- Congestion Games with Capacitated Resources
- Selfish Routing in Capacitated Networks
- Equilibrium points in n -person games
- Computing Nash equilibria for scheduling on restricted parallel links
- College Admissions and the Stability of Marriage
This page was built for publication: Congestion games with capacitated resources
