{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:12:05Z","timestamp":1760202725271},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662533536"},{"type":"electronic","value":"9783662533543"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-662-53354-3_13","type":"book-chapter","created":{"date-parts":[[2016,9,3]],"date-time":"2016-09-03T18:43:34Z","timestamp":1472928214000},"page":"153-166","source":"Crossref","is-referenced-by-count":5,"title":["Dynamic Resource Allocation Games"],"prefix":"10.1007","author":[{"given":"Guy","family":"Avni","sequence":"first","affiliation":[]},{"given":"Thomas A.","family":"Henzinger","sequence":"additional","affiliation":[]},{"given":"Orna","family":"Kupferman","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,9,1]]},"reference":[{"issue":"5","key":"13_CR1","doi-asserted-by":"crossref","first-page":"672","DOI":"10.1145\/585265.585270","volume":"49","author":"R Alur","year":"2002","unstructured":"Alur, R., Henzinger, T.A., Kupferman, O.: Alternating-time temporal logic. J. ACM 49(5), 672\u2013713 (2002)","journal-title":"J. ACM"},{"issue":"4","key":"13_CR2","doi-asserted-by":"crossref","first-page":"1602","DOI":"10.1137\/070680096","volume":"38","author":"E Anshelevich","year":"2008","unstructured":"Anshelevich, E., Dasgupta, A., Kleinberg, J., Tardos, E., Wexler, T., Roughgarden, T.: The price of stability for network design with fair cost allocation. SIAM J. Comput. 38(4), 1602\u20131623 (2008)","journal-title":"SIAM J. Comput."},{"key":"13_CR3","first-page":"287","volume":"4","author":"R Aumann","year":"1959","unstructured":"Aumann, R.: Acceptable points in games of perfect information. Contrib. Theory Games 4, 287\u2013324 (1959)","journal-title":"Contrib. Theory Games"},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1007\/978-3-662-44584-6_12","volume-title":"CONCUR 2014 \u2013 Concurrency Theory","author":"G Avni","year":"2014","unstructured":"Avni, G., Kupferman, O.: Synthesis from component libraries with costs. In: Baldan, P., Gorla, D. (eds.) CONCUR 2014. LNCS, vol. 8704, pp. 156\u2013172. Springer, Heidelberg (2014)"},{"key":"13_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/978-3-642-54830-7_8","volume-title":"Foundations of Software Science and Computation Structures","author":"G Avni","year":"2014","unstructured":"Avni, G., Kupferman, O., Tamir, T.: Network-formation games with regular objectives. In: Muscholl, A. (ed.) FOSSACS 2014 (ETAPS). LNCS, vol. 8412, pp. 119\u2013133. Springer, Heidelberg (2014)"},{"key":"13_CR6","unstructured":"Avni, G., Kupferman, O., Tamir, T.: Congestion games with multisets of resources and applications in synthesis. In: Proceeding of 35th FSTTCS, pp. 365\u2013379 (2015)"},{"key":"13_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1007\/978-3-642-45046-4_6","volume-title":"Web and Internet Economics","author":"V Bil\u00f2","year":"2013","unstructured":"Bil\u00f2, V., Fanelli, A., Moscardelli, L.: On lookahead equilibria in congestion games. In: Chen, Y., Immorlica, N. (eds.) WINE 2013. LNCS, vol. 8289, pp. 54\u201367. Springer, Heidelberg (2013)"},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/978-3-662-48995-6_19","volume-title":"Web and Internet Economics","author":"J Correa","year":"2015","unstructured":"Correa, J., de Jong, J., de Keijzer, B., Uetz, M.: The curse of sequentiality in routing games. In: Markakis, E., Sch\u00e4fer, G. (eds.) WINE 2015. LNCS, vol. 9470, pp. 258\u2013271. Springer, Heidelberg (2015). doi: 10.1007\/978-3-662-48995-6_19"},{"issue":"2","key":"13_CR9","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1007\/s00224-008-9128-8","volume":"45","author":"H Chen","year":"2009","unstructured":"Chen, H., Roughgarden, T.: Network design with weighted players. Theory Comput. Syst. 45(2), 302\u2013324 (2009)","journal-title":"Theory Comput. Syst."},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1007\/978-3-319-13129-0_35","volume-title":"Web and Internet Economics","author":"J Jong de","year":"2014","unstructured":"de Jong, J., Uetz, M.: The sequential price of anarchy for atomic congestion games. In: Liu, T.-Y., Qi, Q., Ye, Y. (eds.) WINE 2014. LNCS, vol. 8877, pp. 429\u2013434. Springer, Heidelberg (2014)"},{"key":"13_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/978-3-540-75520-3_28","volume-title":"Algorithms \u2013 ESA 2007","author":"DA Fotakis","year":"2007","unstructured":"Fotakis, D.A.: Stackelberg strategies for atomic congestion games. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol. 4698, pp. 299\u2013310. Springer, Heidelberg (2007)"},{"issue":"3","key":"13_CR12","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1287\/moor.1120.0543","volume":"37","author":"T Harks","year":"2012","unstructured":"Harks, T., Klimm, M.: On the existence of pure Nash equilibria in weighted congestion games. Math. Oper. Res. 37(3), 419\u2013436 (2012)","journal-title":"Math. Oper. Res."},{"issue":"1\u20132","key":"13_CR13","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1006\/game.1997.0592","volume":"21","author":"R Holzman","year":"1997","unstructured":"Holzman, R., Law-Yone, N.: Strong equilibrium in congestion games. Games Econ. Behav. 21(1\u20132), 85\u2013101 (1997)","journal-title":"Games Econ. Behav."},{"issue":"2","key":"13_CR14","first-page":"65","volume":"3","author":"E Koutsoupias","year":"2009","unstructured":"Koutsoupias, E., Papadimitriou, C.: Worst-case equilibria. CS Rev. 3(2), 65\u201369 (2009)","journal-title":"CS Rev."},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"Leme, R.P., Syrgkanis, V., Tardos, E.: The curse of simultaneity. In: Proceedings of 3rd ITCS (2012)","DOI":"10.1145\/2090236.2090242"},{"key":"13_CR16","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1007\/s10009-012-0236-z","volume":"15","author":"Y Lustig","year":"2013","unstructured":"Lustig, Y., Vardi, M.Y.: Synthesis from component libraries. STTT 15, 603\u2013618 (2013)","journal-title":"STTT"},{"key":"13_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/978-3-642-33996-7_22","volume-title":"Algorithmic Game Theory","author":"V Mirrokni","year":"2012","unstructured":"Mirrokni, V., Thain, N., Vetta, A.: A theoretical examination of practical game playing: lookahead search. In: Serna, M. (ed.) SAGT 2012. LNCS, vol. 7615, pp. 251\u2013262. Springer, Heidelberg (2012)"},{"issue":"1","key":"13_CR18","first-page":"295","volume":"100","author":"J Neumann","year":"1928","unstructured":"Neumann, J.: Mathematische Annalen. Zur Theorie der Gesellschaftsspiele 100(1), 295\u2013320 (1928)","journal-title":"Zur Theorie der Gesellschaftsspiele"},{"key":"13_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/3-540-48224-5_1","volume-title":"Automata, Languages and Programming","author":"C Papadimitriou","year":"2001","unstructured":"Papadimitriou, C.: Algorithms, games, and the internet (extended abstract). In: Orejas, F., Spirakis, P.G., Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, p. 1. Springer, Heidelberg (2001)"},{"key":"13_CR20","doi-asserted-by":"crossref","unstructured":"Pnueli, A., Rosner, R.: On the synthesis of a reactive module. In: Proceedings of 16th POPL, pp. 179\u2013190 (1989)","DOI":"10.1145\/75277.75293"},{"key":"13_CR21","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/BF01737559","volume":"2","author":"RW Rosenthal","year":"1973","unstructured":"Rosenthal, R.W.: A class of games possessing pure-strategy Nash equilibria. Int. J. Game Theory 2, 65\u201367 (1973)","journal-title":"Int. J. Game Theory"},{"issue":"2","key":"13_CR22","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1145\/506147.506153","volume":"49","author":"T Roughgarden","year":"2002","unstructured":"Roughgarden, T., Tardos, E.: How bad is selfish routing? JACM 49(2), 236\u2013259 (2002)","journal-title":"JACM"},{"key":"13_CR23","unstructured":"Schulz, A.S., Stier Moses, N.E.: On the performance of user equilibria in traffic networks. In: Proceedings of 14th SODA, pp. 86\u201387 (2003)"},{"key":"13_CR24","unstructured":"Selten, R.: Spieltheoretische Behandlung eines Oligopolmodells mit Nachfragetr\u00e4gheit. Zeitschrift f\u00fcr die gesamte Staatswissenschaft 121 (1965)"},{"key":"13_CR25","doi-asserted-by":"crossref","unstructured":"Skopalik, A., V\u00f6cking, B.: Inapproximability of pure Nash equilibria. In: Proceedings of 40th STOC, pp. 355\u2013364 (2008)","DOI":"10.1145\/1374376.1374428"},{"key":"13_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1007\/978-3-642-17572-5_30","volume-title":"Internet and Network Economics","author":"V Syrgkanis","year":"2010","unstructured":"Syrgkanis, V.: The complexity of equilibria in cost sharing games. In: Saberi, A. (ed.) WINE 2010. LNCS, vol. 6484, pp. 366\u2013377. Springer, Heidelberg (2010)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-53354-3_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T17:59:48Z","timestamp":1498327188000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53354-3_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662533536","9783662533543"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53354-3_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}