{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:53:42Z","timestamp":1725576822678},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642183171"},{"type":"electronic","value":"9783642183188"}],"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-18318-8_1","type":"book-chapter","created":{"date-parts":[[2011,1,24]],"date-time":"2011-01-24T08:58:06Z","timestamp":1295859486000},"page":"1-12","source":"Crossref","is-referenced-by-count":0,"title":["Strategic Multiway Cut and Multicut Games"],"prefix":"10.1007","author":[{"given":"Elliot","family":"Anshelevich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bugra","family":"Caskurlu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ameya","family":"Hate","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Albers, S., Eilts, S., Even-Dar, E., Mansour, Y., Roditty, L.: On Nash Equilibria for a Network Creation Game. In: SODA (2006)","DOI":"10.1145\/1109557.1109568"},{"issue":"6","key":"1_CR2","doi-asserted-by":"publisher","first-page":"1077","DOI":"10.1016\/j.jcss.2006.02.003","volume":"72","author":"J. Aspnes","year":"2006","unstructured":"Aspnes, J., Chang, K., Yampolskiy, A.: Innoculation Strategies for Victims of Viruses and the Sum-of-Squares Problem. Journal of Computer and System Sciences\u00a072(6), 1077\u20131093 (2006)","journal-title":"Journal of Computer and System Sciences"},{"key":"1_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":"1_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":"4","key":"1_CR5","doi-asserted-by":"publisher","first-page":"1602","DOI":"10.1137\/070680096","volume":"38","author":"E. Anshelevich","year":"2008","unstructured":"Anshelevich, E., Dasgupta, A., Kleinberg, J., Tardos, \u00c9., Wexler, T., Roughgarden, T.: The Price of Stability for Network Design with Fair Cost Allocation. SIAM Journal on Computing\u00a038(4), 1602\u20131623 (2008)","journal-title":"SIAM Journal on Computing"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Anshelevich, E., Dasgupta, A., Tardos, \u00c9., Wexler, T.: Near-Optimal Network Design with Selfish Agents. In: Theory of Computing, vol.\u00a04, pp. 77\u2013109 (2008)","DOI":"10.4086\/toc.2008.v004a004"},{"issue":"3","key":"1_CR7","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1006\/jcss.1999.1687","volume":"60","author":"G. Calinescu","year":"2000","unstructured":"Calinescu, G., Karloff, H., Rabani, Y.: An improved approximation algorithm for multiway cut. Journal of Computer and System Sciences\u00a060(3), 564\u2013574 (2000)","journal-title":"Journal of Computer and System Sciences"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Chen, H., Roughgarden, T.: Network Design with Weighted Players. In: SPAA 2006 (2006)","DOI":"10.1145\/1148109.1148114"},{"key":"1_CR9","unstructured":"Chen, H., Roughgarden, T., Valiant, G.: Designing Networks with Good Equilibria. In: SODA 2008 (2008)"},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/11672142_28","volume-title":"STACS 2006","author":"G. Christodoulou","year":"2006","unstructured":"Christodoulou, G., Mirrokni, V.S., Sidiropoulos, A.: Convergence and Approximation in Potential Games. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol.\u00a03884, pp. 349\u2013360. Springer, Heidelberg (2006)"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Engelberg, R., K\u00f6nemann, J., Leonardi, S., Naor, J.: Cut Problems in Graphs with a Budget Constraint. Journal of Discrete Algorithms\u00a05(2) (June 2007)","DOI":"10.1016\/j.jda.2006.05.002"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Epstein, A., Feldman, M., Mansour, Y.: Strong Equilibrium in Cost Sharing Connection Games. In: EC 2007 (2007)","DOI":"10.1145\/1250910.1250924"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Fabrikant, A., Luthra, A., Maneva, E., Papadimitriou, S., Shenker, S.: On a Network Creation Game. In: PODC (2003)","DOI":"10.1145\/872035.872088"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Fabrikant, A., Papadimitriou, C.H., Talwar, K.: The complexity of pure Nash equilibria. In: STOC 2004 (2004)","DOI":"10.1145\/1007352.1007445"},{"key":"1_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1007\/11786986_53","volume-title":"Automata, Languages and Programming","author":"A. Fiat","year":"2006","unstructured":"Fiat, A., Kaplan, H., Levy, M., Olonetsky, S., Shabo, R.: On the Price of Stability for Designing Undirected Networks with Fair Cost Allocations. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04051, pp. 608\u2013618. Springer, Heidelberg (2006)"},{"key":"1_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1007\/978-3-642-10841-9_62","volume-title":"Internet and Network Economics","author":"L. Gourves","year":"2009","unstructured":"Gourves, L., Monnot, J.: On Strong Equilibria in the Max Cut Game. In: Leonardi, S. (ed.) WINE 2009. LNCS, vol.\u00a05929, pp. 608\u2013615. Springer, Heidelberg (2009)"},{"key":"1_CR17","unstructured":"Hamilton, S.N., Miller, W.L., Ott, A., Saydjari, O.S.: Challenges to applying game theory to the domain of information warfare. In: 4th Information Survivability Workshop (ISW-2001\/2002), Vancouver, Canada (2002)"},{"key":"1_CR18","unstructured":"Hoefer, M.: Cost Sharing and Clustering under Distributed Competition, Ph.D Thesis, Universitat Konstanz (2007)"},{"key":"1_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/11940128_38","volume-title":"Algorithms and Computation","author":"M. Hoefer","year":"2006","unstructured":"Hoefer, M.: Non-cooperative Facility Location and Covering Games. In: Asano, T. (ed.) ISAAC 2006. LNCS, vol.\u00a04288, pp. 369\u2013378. Springer, Heidelberg (2006)"},{"issue":"1","key":"1_CR20","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(1), 104\u2013131 (2009)","journal-title":"Algorithmica"},{"key":"1_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/11533719_19","volume-title":"Computing and Combinatorics","author":"M. Hoefer","year":"2005","unstructured":"Hoefer, M., Krysta, P.: Geometric Network Design with Selfish Agents. In: Wang, L. (ed.) COCOON 2005. LNCS, vol.\u00a03595, pp. 167\u2013178. Springer, Heidelberg (2005)"},{"key":"1_CR22","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)"},{"issue":"3","key":"1_CR23","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1287\/moor.1030.0086","volume":"29","author":"D.R. Karger","year":"2004","unstructured":"Karger, D.R., Klein, P., Stein, C., Thorup, M., Young, N.E.: Rounding algorithms for a geometric embedding for minimum multiway cut. Mathematics of Operations Research\u00a029(3), 436\u2013461 (2004)","journal-title":"Mathematics of Operations Research"},{"key":"1_CR24","volume-title":"Advances in Neural Information Processing Systems","author":"M. Kearns","year":"2004","unstructured":"Kearns, M., Oritz, L.: Algorithms for Interdependent Security Games. In: Advances in Neural Information Processing Systems, vol.\u00a016. MIT Press, Cambridge (2004)"},{"key":"1_CR25","doi-asserted-by":"crossref","unstructured":"Kunreuther, H., Heal, G.: Interdependent Security. Journal of Risk and Uncertainity (Special Issue on Terrorist Risks) (2003)","DOI":"10.1007\/978-1-4757-6787-2_7"},{"key":"1_CR26","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Krause, A., Guestrin, C., Faloutsos, C., Van Briesen, J., Glance, N.: Cost-effective Outbreak Detection in Networks. In: ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD (2007)","DOI":"10.1145\/1281192.1281239"},{"key":"1_CR27","doi-asserted-by":"crossref","unstructured":"Jackson, M.: A survey of models of network formation: stability and efficiency. In: Demange, G., Wooders, M. (eds.) Group Formation in Economics: Networks, Clubs and Coalitions. Cambridge Univ. Press, Cambridge","DOI":"10.1017\/CBO9780511614385.002"},{"key":"1_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/11821069_62","volume-title":"Mathematical Foundations of Computer Science 2006","author":"M. Mavronicolas","year":"2006","unstructured":"Mavronicolas, M., Michael, L., Papadopoulou, V.G., Philippou, A., Spirakis, P.G.: The Price of Defense. In: Kr\u00e1lovi\u010d, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol.\u00a04162, pp. 717\u2013728. Springer, Heidelberg (2006)"},{"key":"1_CR29","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1006\/game.1996.0044","volume":"14","author":"D. Monderer","year":"1996","unstructured":"Monderer, D., Shapley, L.: Potential Games. Games and Economic Behavior\u00a014, 124\u2013143 (1996)","journal-title":"Games and Economic Behavior"},{"key":"1_CR30","doi-asserted-by":"crossref","unstructured":"Syverson, P.F.: A different look at secure distributed computation. In: IEEE Computer Security Foundations Workshop (CSFW 10) (June 1997)","DOI":"10.1109\/CSFW.1997.596797"}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-18318-8_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,8]],"date-time":"2019-06-08T02:56:29Z","timestamp":1559962589000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18318-8_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642183171","9783642183188"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18318-8_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}