Game efficiency through linear programming duality
From MaRDI portal
Recommendations
Cites work
- 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
- Bounding the inefficiency of equilibria in nonatomic congestion games
- Bounding the inefficiency of outcomes in generalized second price auctions
- Coevolutionary opinion formation games
- Composable and efficient mechanisms
- Equilibrium points in n -person games
- How bad is selfish routing?
- Intrinsic robustness of the price of anarchy
- Local smoothness and the price of anarchy in splittable congestion games
- Mechanism design. A linear programming approach.
- Online Non-preemptive Scheduling in a Resource Augmentation Model based on Duality
- Robust price of anarchy bounds via LP and Fenchel duality
- Sequential auctions and externalities
- Simultaneous auctions are (almost) efficient
- 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
- The design of approximation algorithms
- The Design of Competitive Online Algorithms via a Primal—Dual Approach
- The impact of oligopolistic competition in networks
- The Price of Anarchy in Auctions
- The price of anarchy in large games
- Weighted congestion games: price of anarchy, universal worst-case examples, and tightness
- Welfare guarantees for combinatorial auctions with item bidding
- Worst-case equilibria
Cited in
(2)
This page was built for publication: Game efficiency through linear programming duality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5090446)
