Computing better approximate pure Nash equilibria in cut games via semidefinite programming
From MaRDI portal
Publication:6499260
DOI10.1145/3564246.3585236MaRDI QIDQ6499260
Zhile Jiang, Ioannis Caragiannis
Publication date: 8 May 2024
Cites Work
- Unnamed Item
- Unnamed Item
- On the performance of mildly greedy players in cut games
- Convergence and approximation in potential games
- Worst-case equilibria
- Short sequences of improvement moves lead to approximate equilibria in constraint satisfaction games
- Convergence to approximate Nash equilibria in congestion games
- How easy is local search?
- Potential games
- On approximate pure Nash equilibria in weighted congestion games with polynomial latencies
- A class of games possessing pure-strategy Nash equilibria
- Improving approximate pure Nash equilibria in congestion games
- Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria
- Settling the Complexity of Local Max-Cut (Almost) Completely
- How bad is selfish routing?
- Simple Local Search Problems that are Hard to Solve
- The Price of Stability for Network Design with Fair Cost Allocation
- Tight Bounds for Cost-Sharing in Weighted Congestion Games
- On the impact of combinatorial structure on congestion games
- The complexity of pure Nash equilibria
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Approximate Local Search in Combinatorial Optimization
- Computing Approximate Equilibria in Weighted Congestion Games via Best-Responses
- Approximating the Cut-Norm via Grothendieck's Inequality
- Efficient Computation of Approximate Pure Nash Equilibria in Congestion Games
- Algorithmic mechanism design
This page was built for publication: Computing better approximate pure Nash equilibria in cut games via semidefinite programming
