The worst absolute surplus loss in the problem of commons: Random priority versus average cost

Economic Theory

Volumn 34, Issue 1, 2008, Pages 69-84

  Juarez, Ruben ^a  

^a RICE UNIVERSITY   (United States)

Author keywords

Cost sharing; Increasing marginal cost; Price of anarchy; Surplus loss

Indexed keywords

EID: 35248851975     PISSN: 09382259     EISSN: 14320479     Source Type: Journal    
DOI: 10.1007/s00199-006-0165-8     Document Type: Article

References (15)

1. Cres H., Moulin H. (2001) Scheduling with opting out: improving upon random priority. Oper Res 49, 565-577
2. Cres H., Moulin H. (2003) Commons with increasing marginal cost: random priority versus average cost. Int Econ Rev 44, 1097-1115
3. Immorlica, N., Mahdian, M., Mirrokni, V.: Limitations of cross-monotonic cost sharing schemes. In: Proceedings of the sixteenth annual ACM-SIAM symposium on discrete algorithms, 602-611 (2005)
4. Johari R., Tsilikis J. (2004) Efficiency loss in a network resource allocation game. Math Oper Res 29, 407-435
5. Johari R., Mannor S., Tsilikis J. (2005) Efficiency loss in a network resource allocation game: the case of elastic supply. IEEE Trans Automat Contr 50, 1712-1724
6. Juarez, R.: The worst absolute surplus loss in he problem of commons: random priority vs. average cost (extended version). http://www.ruf.rice.edu/ ~ruben/walext.pdf (2006)
7. Koutsoupias, E., Papadimitriou, C.: Worst case equilibria. In: Proceedings of the 16th Symposium on theoretical aspect of computer science, pp. 404-413 (1999)
8. Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B.: sequencing and scheduling: algorithms and complexity. graves, S.C., Rinnooy Kan, A.H.G., Zipkin, P.H. (eds). Logistics of Production and Inventory. Amsterdam: North Holland Press (1993)
9. Moulin H. (1999) Incremental cost sharing: characterization by coalitional strategy-proofness. Social Choice Welfare 16, 279-320
10. Moulin, H.: Minimizing the worst slowdown: off-line and on-line. Oper Res (2005) Forthcoming
11. Moulin, H.: The price of anarchy of serial cost sharing and other methods. Mimeo. Rice University (2006)
12. Moulin H., Shenker S. (2001) Strategyproof sharing of submodular costs: budget balance versus efficiency. Econ Theor 18, 511-533
13. Roughgarden T., Tardos E. (2002) How bad is self-fish routing?. J ACM 49, 236-259
14. Roughgarden T. (2003) The price of anarchy is independent of the network topology. J Comput Syst Sci 67, 341-364
15. Shenker S. (1995) Making greed work in networks: a game theoretic analysis of switching service discipline. IEEE/ACM Trans Netw 3, 819-831