No article text was recorded for this version.
linear programming for efficiency bounds
Version 1 of 111 papers16 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Utility Design for Distributed Resource Allocation - Part I: Characterizing and Optimizing the Exact Price of Anarchy
- Blog: Distributed control and game design: From strategic agents to programmable machines
- Blog: Optimal Price of Anarchy in Cost-Sharing Games
- Blog: Bounding the Inefficiency of Compromise
- Blog: Utility Design for Distributed Resource Allocation—Part II: Applications to Submodular, Covering, and Supermodular Problems
- Blog: When Smoothness is Not Enough: Toward Exact Quantification and Optimization of the Price of Anarchy
- Blog: On the Value of Correlation
- Blog: Bounding the Inefficiency of Compromise in Opinion Formation
- Blog: Price of Competition and Dueling Games
- Blog: Bridging the Gap Between Central and Local Decision-Making: The Efficacy of Collaborative Equilibria in Altruistic Congestion Games
- Blog: LP-Based Covering Games with Low Price of Anarchy
History & citation
Current · Permanent link
- This direction split from Tight Efficiency Bounds via Linear Programming (64% overlap)
- This direction split from Quantifying Efficiency Loss in Decentralized Strategic Systems (73% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_linear_programming_for_efficiency_bounds_52a6e2a3,
title = {linear programming for efficiency bounds},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/linear-programming-for-efficiency-bounds/rdr_52a6e2a39ebb4fb7882921341f17c003},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 1, frozen text):
@misc{lacuna_linear_programming_for_efficiency_bounds_52a6e2a3_v1,
title = {linear programming for efficiency bounds},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/linear-programming-for-efficiency-bounds/rdr_52a6e2a39ebb4fb7882921341f17c003/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}