On the performance of mildly greedy players in cut games
From MaRDI portal
Publication:346481
DOI10.1007/s10878-015-9898-2zbMath1414.91070OpenAlexW2283522456MaRDI QIDQ346481
Publication date: 29 November 2016
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-015-9898-2
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Convergence and approximation in potential games
- Convergence to approximate Nash equilibria in congestion games
- 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
- On best response dynamics in weighted congestion games with polynomial delays
- Non-cooperative facility location and covering games
- Some anomalies of farsighted strategic behavior
- A class of games possessing pure-strategy Nash equilibria
- A Unifying Tool for Bounding the Quality of Non-cooperative Solutions in Weighted Congestion Games
- The speed of convergence in congestion games under best-response dynamics
- On the impact of combinatorial structure on congestion games
- Settling the complexity of computing two-player Nash equilibria
- The complexity of pure Nash equilibria
- Exact and Approximate Equilibria for Optimal Group Network Formation
- The Complexity of Computing a Nash Equilibrium
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Efficient Computation of Approximate Pure Nash Equilibria in Congestion Games