{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:53:43Z","timestamp":1742914423079,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642029295"},{"type":"electronic","value":"9783642029301"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02930-1_45","type":"book-chapter","created":{"date-parts":[[2009,7,2]],"date-time":"2009-07-02T11:05:04Z","timestamp":1246532704000},"page":"546-557","source":"Crossref","is-referenced-by-count":7,"title":["Worst-Case Efficiency Analysis of Queueing Disciplines"],"prefix":"10.1007","author":[{"given":"Damon","family":"Mosk-Aoyama","sequence":"first","affiliation":[]},{"given":"Tim","family":"Roughgarden","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"45_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/978-3-540-27836-8_31","volume-title":"Automata, Languages and Programming","author":"G. Christodoulou","year":"2004","unstructured":"Christodoulou, G., Koutsoupias, E., Nanavati, A.: Coordination mechanisms. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 345\u2013357. Springer, Heidelberg (2004)"},{"issue":"3","key":"45_CR2","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1287\/moor.1040.0091","volume":"29","author":"R. Johari","year":"2004","unstructured":"Johari, R., Tsitsiklis, J.N.: Efficiency loss in a network resource allocation game. Mathematics of Operation Research\u00a029(3), 407\u2013435 (2004)","journal-title":"Mathematics of Operation Research"},{"key":"45_CR3","doi-asserted-by":"crossref","unstructured":"Johari, R., Tsitsiklis, J.N.: Efficiency of scalar-parameterized mechanisms. Operations Research (to appear, 2009)","DOI":"10.1287\/opre.1080.0638"},{"key":"45_CR4","unstructured":"Mosk-Aoyama, D.: Convergence to and Quality of Equilibria in Distributed Systems. PhD thesis, Stanford University (2008)"},{"issue":"3","key":"45_CR5","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/s00199-007-0275-y","volume":"36","author":"H. Moulin","year":"2008","unstructured":"Moulin, H.: The price of anarchy of serial, average and incremental cost sharing. Economic Theory\u00a036(3), 379\u2013405 (2008)","journal-title":"Economic Theory"},{"key":"45_CR6","doi-asserted-by":"crossref","unstructured":"Moulin, H.: An efficient and almost budget balanced cost sharing method. Games and Economic Behavior (in press, 2009)","DOI":"10.1016\/j.geb.2008.09.028"},{"issue":"5","key":"45_CR7","doi-asserted-by":"publisher","first-page":"1009","DOI":"10.2307\/2951537","volume":"60","author":"H. Moulin","year":"1992","unstructured":"Moulin, H., Shenker, S.J.: Serial cost sharing. Econometrica\u00a060(5), 1009\u20131037 (1992)","journal-title":"Econometrica"},{"issue":"3","key":"45_CR8","doi-asserted-by":"publisher","first-page":"520","DOI":"10.2307\/1911749","volume":"33","author":"J.B. Rosen","year":"1965","unstructured":"Rosen, J.B.: Existence and uniqueness of equilibrium points for concave n-person games. Econometrica\u00a033(3), 520\u2013534 (1965)","journal-title":"Econometrica"},{"issue":"2","key":"45_CR9","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1016\/S0022-0000(03)00044-8","volume":"67","author":"T. Roughgarden","year":"2003","unstructured":"Roughgarden, T.: The price of anarchy is independent of the network topology. Journal of Computer and System Sciences\u00a067(2), 341\u2013364 (2003)","journal-title":"Journal of Computer and System Sciences"},{"key":"45_CR10","volume-title":"Selfish Routing and the Price of Anarchy","author":"T. Roughgarden","year":"2005","unstructured":"Roughgarden, T.: Selfish Routing and the Price of Anarchy. MIT Press, Cambridge (2005)"},{"issue":"6","key":"45_CR11","doi-asserted-by":"publisher","first-page":"819","DOI":"10.1109\/90.477727","volume":"3","author":"S.J. Shenker","year":"1995","unstructured":"Shenker, S.J.: Making greed work in networks: A game-theoretic analysis of switch service disciplines. IEEE\/ACM Transactions on Networking\u00a03(6), 819\u2013831 (1995)","journal-title":"IEEE\/ACM Transactions on Networking"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02930-1_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T01:49:18Z","timestamp":1558403358000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02930-1_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642029295","9783642029301"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02930-1_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}