{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T02:28:57Z","timestamp":1648866537627},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2011,12,21]],"date-time":"2011-12-21T00:00:00Z","timestamp":1324425600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2013,2]]},"DOI":"10.1007\/s00224-011-9380-1","type":"journal-article","created":{"date-parts":[[2011,12,20]],"date-time":"2011-12-20T09:02:21Z","timestamp":1324371741000},"page":"200-220","source":"Crossref","is-referenced-by-count":2,"title":["Strategic Multiway Cut and Multicut Games"],"prefix":"10.1007","volume":"52","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","published-online":{"date-parts":[[2011,12,21]]},"reference":[{"key":"9380_CR1","volume-title":"SODA","author":"S. Albers","year":"2006","unstructured":"Albers, S., Eilts, S., Even-Dar, E., Mansour, Y., Roditty, L.: On Nash equilibria for a network creation game. In: SODA (2006)"},{"issue":"39","key":"9380_CR2","doi-asserted-by":"crossref","first-page":"5298","DOI":"10.1016\/j.tcs.2011.05.049","volume":"412","author":"E. Anshelevich","year":"2011","unstructured":"Anshelevich, E., Caskurlu, B.: Exact and approximate equilibria for optimal group network formation. Theor. Comp. Sci. 412(39), 5298\u20135314 (2011)","journal-title":"Theor. Comp. Sci."},{"issue":"1","key":"9380_CR3","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1007\/s00224-011-9317-8","volume":"49","author":"E. Anshelevich","year":"2011","unstructured":"Anshelevich, E., Caskurlu, B.: Price of stability in survivable network design. Theory Comput. Syst. 49(1), 98\u2013138 (2011)","journal-title":"Theory Comput. Syst."},{"issue":"4","key":"9380_CR4","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, \u00c9., 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":"9380_CR5","doi-asserted-by":"crossref","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 Comput. 4, 77\u2013109 (2008)","journal-title":"Theory Comput."},{"issue":"6","key":"9380_CR6","doi-asserted-by":"crossref","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. J. Comput. Syst. Sci. 72(6), 1077\u20131093 (2006)","journal-title":"J. Comput. Syst. Sci."},{"key":"9380_CR7","volume-title":"ACM Conference on Electronic Commerce","author":"A. Bhalgat","year":"2010","unstructured":"Bhalgat, A., Chakraborty, T., Khanna, S.: Approximating pure Nash equilibrium in cut, party affiliation and satisfiability games. In: ACM Conference on Electronic Commerce (EC 2010)"},{"issue":"3","key":"9380_CR8","doi-asserted-by":"crossref","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. J.\u00a0Comput. Syst. Sci. 60(3), 564\u2013574 (2000)","journal-title":"J.\u00a0Comput. Syst. Sci."},{"issue":"16\u201318","key":"9380_CR9","doi-asserted-by":"crossref","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. Comp. Sci. 411(16\u201318), 1855\u20131876 (2010)","journal-title":"Theor. Comp. Sci."},{"issue":"2","key":"9380_CR10","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":"9380_CR11","volume-title":"SODA","author":"H. Chen","year":"2008","unstructured":"Chen, H., Roughgarden, T., Valiant, G.: Designing networks with good equilibria. In: SODA (2008)"},{"key":"9380_CR12","volume-title":"STACS","author":"G. Christodoulou","year":"2006","unstructured":"Christodoulou, G., Mirrokni, V.S., Sidiropoulos, A.: Convergence and approximation in potential games. In: STACS (2006)"},{"key":"9380_CR13","doi-asserted-by":"crossref","unstructured":"Engelberg, R., K\u00f6nemann, J., Leonardi, S., Naor, J.: Cut problems in graphs with a budget constraint. J. Discrete Algorithms 5(2) (2007)","DOI":"10.1016\/j.jda.2006.05.002"},{"issue":"1","key":"9380_CR14","doi-asserted-by":"crossref","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 Econ. Behav. 67(1), 51\u201368 (2009)","journal-title":"Games Econ. Behav."},{"key":"9380_CR15","volume-title":"PODC","author":"A. Fabrikant","year":"2003","unstructured":"Fabrikant, A., Luthra, A., Maneva, E., Papadimitriou, S., Shenker, S.: On a network creation game. In: PODC (2003)"},{"key":"9380_CR16","volume-title":"STOC","author":"A. Fabrikant","year":"2004","unstructured":"Fabrikant, A., Papadimitriou, C.H., Talwar, K.: The complexity of pure Nash equilibria. In: STOC (2004)"},{"key":"9380_CR17","first-page":"608","volume-title":"Proceedings of ICALP 2006","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: Proceedings of ICALP 2006, pp. 608\u2013618 (2006)"},{"key":"9380_CR18","volume-title":"WINE","author":"L. Gourves","year":"2009","unstructured":"Gourves, L., Monnot, J.: On strong equilibria in the max cut game. In: WINE (2009)"},{"key":"9380_CR19","volume-title":"4th Information Survivability Workshop (ISW-2001\/2002)","author":"S.N. Hamilton","year":"2002","unstructured":"Hamilton, S.N., Miller, W.L., Ott, A., Saydjari, O.S.: Challenges in applying game theory to the domain of information warfare. In: 4th Information Survivability Workshop (ISW-2001\/2002). Vancouver, Canada (2002)"},{"key":"9380_CR20","unstructured":"Hoefer, M.: Cost sharing and clustering under distributed competition. Ph.D. Thesis, Universitat Konstanz (2007)"},{"issue":"1","key":"9380_CR21","doi-asserted-by":"crossref","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 53(1), 104\u2013131 (2009)","journal-title":"Algorithmica"},{"key":"9380_CR22","series-title":"LNCS","volume-title":"Proc. 6th Intl. Workshop on Internet & Network Economics (WINE 2010)","author":"M. Hoefer","year":"2010","unstructured":"Hoefer, M.: Strategic cooperation in cost sharing games. In: Proc. 6th Intl. Workshop on Internet & Network Economics (WINE 2010). LNCS, vol.\u00a06484 (2010)"},{"key":"9380_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/11533719_19","volume-title":"COCOON 2005. Combinatorics Conference (COCOON 2005)","author":"M. Hoefer","year":"2005","unstructured":"Hoefer, M., Krysta, P.: Geometric network design with selfish agents. In: COCOON 2005. Combinatorics Conference (COCOON 2005). Lecture Notes in Computer Science, vol.\u00a03595, pp. 167\u2013178 (2005)"},{"key":"9380_CR24","volume-title":"Group Formation in Economics: Networks, Clubs and Coalitions","author":"M. Jackson","year":"2005","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 (2005)"},{"issue":"3","key":"9380_CR25","doi-asserted-by":"crossref","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 of minimum multiway cut. Math. Oper. Res. 29(3), 436\u2013461 (2004)","journal-title":"Math. Oper. Res."},{"key":"9380_CR26","volume-title":"Advances in Neural Information Processing Systems","author":"M. Kearns","year":"2004","unstructured":"Kearns, M., Ortiz, L.: Algorithms for interdependent security games. In: Advances in Neural Information Processing Systems, vol.\u00a016. MIT Press, Cambridge (2004)"},{"key":"9380_CR27","doi-asserted-by":"crossref","unstructured":"Kunreuther, H., Heal, G.: Interdependent security. J. Risk Uncertain. (Special Issue on Terrorist Risks) (2003)","DOI":"10.1023\/A:1024119208153"},{"key":"9380_CR28","volume-title":"ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD)","author":"J. Leskovec","year":"2007","unstructured":"Leskovec, J., Krause, A., Guestrin, C., Faloutsos, C., VanBriesen, J., Glance, N.: Cost-effective outbreak detection in networks. In: ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD) (2007)"},{"key":"9380_CR29","volume-title":"31st International Symposium on Mathematical Foundations of Computer Science","author":"M. Mavronicolas","year":"2006","unstructured":"Mavronicolas, M., Michael, L., Papadopoulou, V.G., Philippou, A., Spirakis, P.G.: The price of defense. In: 31st International Symposium on Mathematical Foundations of Computer Science (2006)"},{"key":"9380_CR30","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1006\/game.1996.0044","volume":"14","author":"D. Monderer","year":"1996","unstructured":"Monderer, D., Shapley, L.: Potential games. Games Econ. Behav. 14, 124\u2013143 (1996)","journal-title":"Games Econ. Behav."},{"key":"9380_CR31","volume-title":"IEEE Computer Security Foundations Workshop (CSFW 10)","author":"P.F. Syverson","year":"1997","unstructured":"Syverson, P.F.: A different look at secure distributed computation. In: IEEE Computer Security Foundations Workshop (CSFW 10), June 1997"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-011-9380-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-011-9380-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-011-9380-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T11:54:23Z","timestamp":1558698863000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-011-9380-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,12,21]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,2]]}},"alternative-id":["9380"],"URL":"https:\/\/doi.org\/10.1007\/s00224-011-9380-1","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,12,21]]}}}