{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T10:10:19Z","timestamp":1725617419757},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642248283"},{"type":"electronic","value":"9783642248290"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-24829-0_9","type":"book-chapter","created":{"date-parts":[[2011,10,3]],"date-time":"2011-10-03T09:11:38Z","timestamp":1317633098000},"page":"81-92","source":"Crossref","is-referenced-by-count":0,"title":["The Price of Optimum in a Matching Game"],"prefix":"10.1007","author":[{"given":"Bruno","family":"Escoffier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laurent","family":"Gourv\u00e8s","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00e9r\u00f4me","family":"Monnot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"9_CR1","doi-asserted-by":"publisher","first-page":"9","DOI":"10.2307\/2312726","volume":"69","author":"D. Gale","year":"1962","unstructured":"Gale, D., Shapley, L.S.: College admissions and the stability of marriage. The American Mathematical Monthly\u00a069(1), 9\u201315 (1962)","journal-title":"The American Mathematical Monthly"},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF01753437","volume":"1","author":"L.S. Shapley","year":"1972","unstructured":"Shapley, L.S., Shubik, M.: The assignment game i: The core. International Journal of Game Theory\u00a01, 111\u2013130 (1972)","journal-title":"International Journal of Game Theory"},{"key":"9_CR3","volume-title":"Encyclopedia of Algorithms","author":"A.C. Kaporis","year":"2008","unstructured":"Kaporis, A.C., Spirakis, P.G.: Stackelberg games: The price of optimum. In: Kao, M.Y. (ed.) Encyclopedia of Algorithms. Springer, Heidelberg (2008)"},{"issue":"1","key":"9_CR4","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1109\/90.554730","volume":"5","author":"Y.A. Korilis","year":"1997","unstructured":"Korilis, Y.A., Lazar, A.A., Orda, A.: Achieving network optima using stackelberg routing strategies. IEEE\/ACM Trans. Netw.\u00a05(1), 161\u2013173 (1997)","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"2","key":"9_CR5","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1145\/506147.506153","volume":"49","author":"T. Roughgarden","year":"2002","unstructured":"Roughgarden, T., Tardos, \u00c9.: How bad is selfish routing? J. ACM\u00a049(2), 236\u2013259 (2002)","journal-title":"J. ACM"},{"issue":"2","key":"9_CR6","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.cosrev.2009.04.003","volume":"3","author":"E. Koutsoupias","year":"2009","unstructured":"Koutsoupias, E., Papadimitriou, C.H.: Worst-case equilibria. Computer Science Review\u00a03(2), 65\u201369 (2009)","journal-title":"Computer Science Review"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H.: Algorithms, games, and the internet. In: STOC, pp. 749\u2013753 (2001)","DOI":"10.1145\/380752.380883"},{"key":"9_CR8","doi-asserted-by":"publisher","first-page":"3327","DOI":"10.1016\/j.tcs.2009.01.005","volume":"410","author":"G. Christodoulou","year":"2009","unstructured":"Christodoulou, G., Koutsoupias, E., Nanavati, A.: Coordination mechanisms. Theor. Comput. Sci.\u00a0410, 3327\u20133336 (2009)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"9_CR9","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1137\/S0097539701397059","volume":"33","author":"T. Roughgarden","year":"2004","unstructured":"Roughgarden, T.: Stackelberg scheduling strategies. SIAM J. Comput.\u00a033(2), 332\u2013350 (2004)","journal-title":"SIAM J. Comput."},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"776","DOI":"10.1007\/3-540-45465-9_66","volume-title":"Automata, Languages and Programming","author":"V.S.A. Kumar","year":"2002","unstructured":"Kumar, V.S.A., Marathe, M.V.: Improved results for stackelberg scheduling strategies. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol.\u00a02380, pp. 776\u2013787. Springer, Heidelberg (2002)"},{"key":"9_CR11","first-page":"1133","volume-title":"SODA","author":"C. Swamy","year":"2007","unstructured":"Swamy, C.: The effectiveness of stackelberg strategies and tolls for network congestion games. In: SODA, pp. 1133\u20131142. SIAM, Philadelphia (2007)"},{"issue":"1","key":"9_CR12","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/s00224-008-9152-8","volume":"47","author":"D. Fotakis","year":"2010","unstructured":"Fotakis, D.: Stackelberg strategies for atomic congestion games. Theory Comput. Syst.\u00a047(1), 218\u2013249 (2010)","journal-title":"Theory Comput. Syst."},{"key":"9_CR13","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1016\/j.geb.2009.06.006","volume":"67","author":"Y. Sharma","year":"2009","unstructured":"Sharma, Y., Williamson, D.P.: Stackelberg thresholds in network routing games or the value of altruism. Games and Economic Behavior\u00a067, 174\u2013190 (2009)","journal-title":"Games and Economic Behavior"},{"issue":"2","key":"9_CR14","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1287\/moor.1100.0442","volume":"35","author":"V. Bonifaci","year":"2010","unstructured":"Bonifaci, V., Harks, T., Sch\u00e4fer, G.: Stackelberg routing in arbitrary networks. Math. Oper. Res.\u00a035(2), 330\u2013346 (2010)","journal-title":"Math. Oper. Res."},{"issue":"2-3","key":"9_CR15","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/0166-218X(94)00091-Q","volume":"56","author":"Y. Manoussakis","year":"1995","unstructured":"Manoussakis, Y.: Alternating paths in edge-colored complete graphs. Discrete Applied Mathematics\u00a056(2-3), 297\u2013309 (1995)","journal-title":"Discrete Applied Mathematics"},{"key":"9_CR16","volume-title":"Approximation Algorithms for NP-Hard Problems","author":"D.S. Hochbaum","year":"1996","unstructured":"Hochbaum, D.S.: Approximation Algorithms for NP-Hard Problems. PWS Publishing Company, Boston (1996)"},{"issue":"1","key":"9_CR17","doi-asserted-by":"publisher","first-page":"439","DOI":"10.4007\/annals.2005.162.439","volume":"162","author":"I. Dinur","year":"2005","unstructured":"Dinur, I., Safra, S.: On the hardness of approximating minimum vertex cover. Annals of Mathematics\u00a0162(1), 439\u2013485 (2005)","journal-title":"Annals of Mathematics"},{"key":"9_CR18","unstructured":"Escoffier, B., Gourv\u00e8s, L., Monnot, J.: Minimum regulation of uncoordinated matchings. CoRR abs\/1012.3889 (2010)"},{"key":"9_CR19","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/j.geb.2008.03.005","volume":"65","author":"N. Andelman","year":"2009","unstructured":"Andelman, N., Feldman, M., Mansour, Y.: Strong price of anarchy. Games and Economic Behavior\u00a065, 289\u2013317 (2009)","journal-title":"Games and Economic Behavior"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24829-0_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T05:52:50Z","timestamp":1554789170000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24829-0_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642248283","9783642248290"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24829-0_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}