Game efficiency through linear programming duality
From MaRDI portal
Publication:5090446
DOI10.4230/LIPIcs.ITCS.2019.66OpenAlexW2964196815MaRDI QIDQ5090446
Publication date: 18 July 2022
Full work available at URL: https://arxiv.org/abs/1708.06499
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Worst-case equilibria
- Stackelberg strategies and collusion in network games with splittable flow
- Strategically zero-sum games: The class of games whose completely mixed equilibria cannot be improved upon
- Subjectivity and correlation in randomized strategies
- Bounding the inefficiency of equilibria in nonatomic congestion games
- Local smoothness and the price of anarchy in splittable congestion games
- Bounding the inefficiency of outcomes in generalized second price auctions
- A geometric approach to the price of anarchy in nonatomic congestion games
- A Unifying Tool for Bounding the Quality of Non-cooperative Solutions in Weighted Congestion Games
- The Design of Approximation Algorithms
- The Impact of Oligopolistic Competition in Networks
- Intrinsic Robustness of the Price of Anarchy
- How bad is selfish routing?
- Weighted Congestion Games: Price of Anarchy, Universal Worst-Case Examples, and Tightness
- The Design of Competitive Online Algorithms via a Primal—Dual Approach
- Online Non-preemptive Scheduling in a Resource Augmentation Model based on Duality
- The Price of Anarchy in Auctions
- The price of anarchy in large games
- Robust Price of Anarchy Bounds via LP and Fenchel Duality
- Coevolutionary opinion formation games
- Simultaneous auctions are (almost) efficient
- Composable and efficient mechanisms
- Equilibrium points in n -person games
This page was built for publication: Game efficiency through linear programming duality