{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T09:34:11Z","timestamp":1725701651940},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642330896"},{"type":"electronic","value":"9783642330902"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33090-2_49","type":"book-chapter","created":{"date-parts":[[2012,8,28]],"date-time":"2012-08-28T11:29:11Z","timestamp":1346153351000},"page":"563-574","source":"Crossref","is-referenced-by-count":3,"title":["Resource Buying Games"],"prefix":"10.1007","author":[{"given":"Tobias","family":"Harks","sequence":"first","affiliation":[]},{"given":"Britta","family":"Peis","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"49_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1455248.1455249","volume":"55","author":"H. Ackermann","year":"2008","unstructured":"Ackermann, H., R\u00f6glin, H., V\u00f6cking, B.: On the impact of combinatorial structure on congestion games. J. ACM\u00a055, 1\u201325 (2008)","journal-title":"J. ACM"},{"issue":"17","key":"49_CR2","doi-asserted-by":"publisher","first-page":"1552","DOI":"10.1016\/j.tcs.2008.12.035","volume":"410","author":"H. Ackermann","year":"2009","unstructured":"Ackermann, H., R\u00f6glin, H., V\u00f6cking, B.: Pure Nash equilibria in player-specific and weighted congestion games. Theor. Comput. Sci.\u00a0410(17), 1552\u20131563 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"49_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-642-04128-0_21","volume-title":"Algorithms - ESA 2009","author":"E. Anshelevich","year":"2009","unstructured":"Anshelevich, E., Caskurlu, B.: Exact and Approximate Equilibria for Optimal Group Network Formation. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol.\u00a05757, pp. 239\u2013250. Springer, Heidelberg (2009)"},{"key":"49_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/978-3-642-04645-2_19","volume-title":"Algorithmic Game Theory","author":"E. Anshelevich","year":"2009","unstructured":"Anshelevich, E., Caskurlu, B.: Price of Stability in Survivable Network Design. In: Mavronicolas, M., Papadopoulou, V.G. (eds.) SAGT 2009. LNCS, vol.\u00a05814, pp. 208\u2013219. Springer, Heidelberg (2009)"},{"issue":"1","key":"49_CR5","doi-asserted-by":"publisher","first-page":"77","DOI":"10.4086\/toc.2008.v004a004","volume":"4","author":"E. Anshelevich","year":"2008","unstructured":"Anshelevich, E., Dasgupta, A., Tardos, \u00c9., Wexler, T.: Near-optimal network design with selfish agents. Theory of Computing\u00a04(1), 77\u2013109 (2008)","journal-title":"Theory of Computing"},{"issue":"3","key":"49_CR6","doi-asserted-by":"publisher","first-page":"678","DOI":"10.1137\/090752699","volume":"40","author":"E. Anshelevich","year":"2011","unstructured":"Anshelevich, E., Karagiozova, A.: Terminal backup, 3d matching, and covering cubic graphs. SIAM J. Comput.\u00a040(3), 678\u2013708 (2011)","journal-title":"SIAM J. Comput."},{"key":"49_CR7","doi-asserted-by":"publisher","first-page":"1855","DOI":"10.1016\/j.tcs.2010.02.005","volume":"411","author":"J. Cardinal","year":"2010","unstructured":"Cardinal, J., Hoefer, M.: Non-cooperative facility location and covering games. Theor. Comput. Sci.\u00a0411, 1855\u20131876 (2010)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"49_CR8","doi-asserted-by":"publisher","first-page":"851","DOI":"10.1287\/moor.1080.0322","volume":"33","author":"J. Dunkel","year":"2008","unstructured":"Dunkel, J., Schulz, A.: On the complexity of pure-strategy Nash equilibria in congestion and local-effect games. Math. Oper. Res.\u00a033(4), 851\u2013868 (2008)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"49_CR9","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.geb.2008.07.002","volume":"67","author":"A. Epstein","year":"2009","unstructured":"Epstein, A., Feldman, M., Mansour, Y.: Strong equilibrium in cost sharing connection games. Games Econom. Behav.\u00a067(1), 51\u201368 (2009)","journal-title":"Games Econom. Behav."},{"key":"49_CR10","doi-asserted-by":"crossref","unstructured":"Fabrikant, A., Papadimitriou, C., Talwar, K.: The complexity of pure Nash equilibria. In: Proc. of the 36th STOC, pp. 604\u2013612 (2004)","DOI":"10.1145\/1007352.1007445"},{"key":"49_CR11","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/s00453-007-9014-9","volume":"53","author":"M. Hoefer","year":"2009","unstructured":"Hoefer, M.: Non-cooperative tree creation. Algorithmica\u00a053, 104\u2013131 (2009)","journal-title":"Algorithmica"},{"key":"49_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/978-3-642-17572-5_21","volume-title":"Internet and Network Economics","author":"M. Hoefer","year":"2010","unstructured":"Hoefer, M.: Strategic Cooperation in Cost Sharing Games. In: Saberi, A. (ed.) WINE 2010. LNCS, vol.\u00a06484, pp. 258\u2013269. Springer, Heidelberg (2010)"},{"key":"49_CR13","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1007\/s00453-009-9367-3","volume":"60","author":"M. Hoefer","year":"2011","unstructured":"Hoefer, M.: Competitive cost sharing with economies of scale. Algorithmica\u00a060, 743\u2013765 (2011)","journal-title":"Algorithmica"},{"issue":"1","key":"49_CR14","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF01737559","volume":"2","author":"R. Rosenthal","year":"1973","unstructured":"Rosenthal, R.: A class of games possessing pure-strategy Nash equilibria. Internat. J. Game Theory\u00a02(1), 65\u201367 (1973)","journal-title":"Internat. J. Game Theory"},{"key":"49_CR15","unstructured":"Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Springer (2003)"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33090-2_49.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T07:55:00Z","timestamp":1620114900000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33090-2_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642330896","9783642330902"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33090-2_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}