Non-atomic one-round walks in congestion games
From MaRDI portal
Publication:1731512
DOI10.1016/j.tcs.2018.06.038zbMath1422.91154OpenAlexW2810387876WikidataQ129608535 ScholiaQ129608535MaRDI QIDQ1731512
Publication date: 13 March 2019
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2018.06.038
Related Items (2)
Congestion games with priority-based scheduling ⋮ The price of anarchy of affine congestion games with similar strategies
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the performance of approximate equilibria in congestion games
- Tight bounds for selfish and greedy load balancing
- Performance of one-round walks in linear congestion games
- Stackelberg strategies for atomic congestion games
- Stackelberg strategies for selfish routing in general multicommodity networks
- How much can taxes help selfish routing?
- A class of games possessing pure-strategy Nash equilibria
- A Unifying Tool for Bounding the Quality of Non-cooperative Solutions in Weighted Congestion Games
- Exact Price of Anarchy for Polynomial Congestion Games
- Intrinsic Robustness of the Price of Anarchy
- Taxes for linear atomic congestion games
- The speed of convergence in congestion games under best-response dynamics
- The effectiveness of stackelberg strategies and tolls for network congestion games
- On Stackelberg Strategies in Affine Congestion Games
- Pricing network edges for heterogeneous selfish users
- The price of anarchy of finite congestion games
- Stackelberg Scheduling Strategies
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Algorithmic Game Theory
- Convergence and Approximation in Potential Games
- Equilibrium points in n -person games
- The Price of Routing Unsplittable Flow
- The price of anarchy is independent of the network topology
This page was built for publication: Non-atomic one-round walks in congestion games
