# Equilibrium Inefficiency and Computation in Cost-Sharing Games in Real-Time Scheduling Systems +
## 4 Coordination Mechanism
### Monomial Server Costs with \(d<1\)
_Oper. Res._**2013**, _61_, 155-168. [CrossRef]
* [PERSON] and [PERSON] (2016) [PERSON]; [PERSON] [PERSON] Network Cost-Sharing without Anonymity. _ACM Trans. Econ. Comput._**2016**, \(4\), 8:1-8:24. [CrossRef]
* [PERSON] et al. (2010) [PERSON]; [PERSON]; [PERSON] Designing Network Protocols for Good Equilibria. _SIAM J. Comput._**2010**, _39_, 1799-1832. [CrossRef]
* [PERSON] (2013) [PERSON]; [PERSON] [PERSON] Optimal Cost Sharing for Resource Selection Games. _Math. Oper. Res._**2013**, _38_, 184-208. [CrossRef]
* [PERSON] et al. (2015) [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON] Optimal Coordination Mechanisms for Unrelated Machine Scheduling. _Oper. Res._**2015**, _63_, 489-500. [CrossRef]
* [PERSON] (2013) [PERSON] Efficient Coordination Mechanisms for Unrelated Machine Scheduling. _Algorithmica_**2013**, _66_, 512-540. [CrossRef]
* [PERSON] et al. (2015) [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON] [PERSON] Decentralized utilitarian mechanisms for scheduling games. _Games Econ. Behav._**2015**, _92_, 306-326. [CrossRef]
* [PERSON] et al. (2009) [PERSON]; [PERSON]; [PERSON]; [PERSON] Coordination mechanisms for selfish scheduling. _Theor. Comput. Sci._**2009**, _410_, 1589-1598. [CrossRef]
* [PERSON] et al. (2008) [PERSON]; [PERSON]; [PERSON] [PERSON]; [PERSON] Near-Optimal Network Design with Selfish Agents. _Theory Comput._**2008**, \(4\), 77-109. [CrossRef]
* [PERSON] et al. (2009) [PERSON]; [PERSON]; [PERSON] Strong equilibrium in cost sharing connection games. _Games Econ. Behav._**2009**, _67_, 51-68. [CrossRef]
* [PERSON] and [PERSON] (2011) [PERSON]; [PERSON] Exact and approximate equilibria for optimal group network formation. _Theor. Comput. Sci._**2011**, _412_, 5298-5314. [CrossRef]
* [PERSON] and [PERSON] (2011) [PERSON]; [PERSON] Price of Stability in Survivable Network Design. _Theory Comput. Syst._**2011**, _49_, 98-138. [CrossRef]
* [PERSON] and [PERSON] (2011) [PERSON]; [PERSON] Terminal Backup, 3D Matching, and Covering Cubic Graphs. _SIAM J. Comput._**2011**, _40_, 678-708. [CrossRef]
* [PERSON] and [PERSON] (2010) [PERSON]; [PERSON] Non-cooperative facility location and covering games. _Theor. Comput. Sci._**2010**, _411_, 1855-1876. [CrossRef]
* [PERSON] (2009) [PERSON] Non-Cooperative Tree Creation. _Algorithmica_**2009**, _53_, 104-131. [CrossRef]
* [PERSON] (2013) [PERSON] Strategic cooperation in cost sharing games. _Int. J. Game Theory_**2013**, _42_, 29-53. [CrossRef]
* [PERSON] et al. (2020) [PERSON]; [PERSON]; [PERSON] Equilibrium Inefficiency in Resource Buying Games with Load-Dependent Costs. In Proceedings of the Algorithmic Game Theory--13 th International Symposium, SAGT 2020, Augsburg, Germany, 16-18 September 2020; pp. 83-98. * [PERSON] (1959) [PERSON] Acceptable Points in General Cooperative n-Person Games. In _Contributions to the Theory of Games_; Princeton University Press: Princeton, NJ, USA, 1959; Volume 4. * [PERSON] et al. (2009) [PERSON]; [PERSON]; [PERSON] Strong price of anarchy. _Games Econ. Behav._**2009**, _65_, 289-317. [CrossRef]
* [PERSON] et al. (2011) [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON] [PERSON] Tight Bounds for Selfish and Greedy Load Balancing. _Algorithmica_**2011**, _61_, 606-637. [CrossRef]
* [PERSON] et al. (2004) [PERSON]; [PERSON]; [PERSON] Selfish Load Balancing and Atomic Congestion Games. In Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'04, Barcelona, Spain, 27-30 June 2004; pp. 188-195.