{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T14:09:53Z","timestamp":1743084593962,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662489949"},{"type":"electronic","value":"9783662489956"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc\/2.5"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-48995-6_3","type":"book-chapter","created":{"date-parts":[[2015,12,8]],"date-time":"2015-12-08T18:37:29Z","timestamp":1449599849000},"page":"31-45","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Computing Stable Coalitions: Approximation Algorithms for Reward Sharing"],"prefix":"10.1007","author":[{"given":"Elliot","family":"Anshelevich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shreyas","family":"Sekar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,12,30]]},"reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/978-3-642-04645-2_12","volume-title":"Algorithmic Game Theory","author":"Y Bachrach","year":"2009","unstructured":"Bachrach, Y., Elkind, E., Meir, R., Pasechnik, D., Zuckerman, M., Rothe, J., Rosenschein, J.S.: The cost of stability in coalitional games. In: Mavronicolas, M., Papadopoulou, V.G. (eds.) SAGT 2009. LNCS, vol. 5814, pp. 122\u2013134. Springer, Heidelberg (2009)"},{"key":"3_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.artint.2013.07.005","volume":"204","author":"Y Bachrach","year":"2013","unstructured":"Bachrach, Y., Parkes, D.C., Rosenschein, J.S.: Computing cooperative solution concepts in coalitional skill games. Artif. Intell. 204, 1\u201321 (2013)","journal-title":"Artif. Intell."},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/978-3-662-44803-8_19","volume-title":"Algorithmic Game Theory","author":"Y Bachrach","year":"2014","unstructured":"Bachrach, Y., Syrgkanis, V., Tardos, \u00c9., Vojnovi\u0107, M.: Strong price of anarchy, utility games and coalitional dynamics. In: Lavi, R. (ed.) SAGT 2014. LNCS, vol. 8768, pp. 218\u2013230. Springer, Heidelberg (2014)"},{"issue":"1","key":"3_CR4","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s00182-008-0135-4","volume":"38","author":"C Bejan","year":"2009","unstructured":"Bejan, C., G\u00f3mez, J.C.: Theory Core extensions for non-balanced TU-games. Int. J. Game 38(1), 3\u201316 (2009)","journal-title":"Int. J. Game"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Bhawalkar, K., Roughgarden, T.: Welfare guarantees for combinatorial auctions with item bidding. In: Proceedings of SODA (2011)","DOI":"10.1137\/1.9781611973082.55"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Bousquet, N., Li, Z., Vetta, A.: Coalition games on interaction graphs: a horticultural perspective. In: Proceedings of EC (2015)","DOI":"10.1145\/2764468.2764477"},{"key":"3_CR7","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1613\/jair.3075","volume":"39","author":"G Chalkiadakis","year":"2010","unstructured":"Chalkiadakis, G., Elkind, E., Markakis, E., Polukarov, M., Jennings, N.R.: Cooperative games with overlapping coalitions. J. Artif. Intell. Res. (JAIR) 39, 179\u2013216 (2010)","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"issue":"3","key":"3_CR8","doi-asserted-by":"publisher","first-page":"751","DOI":"10.1287\/moor.24.3.751","volume":"24","author":"X Deng","year":"1999","unstructured":"Deng, X., Ibaraki, T., Nagamochi, H.: Algorithmic aspects of the core of combinatorial optimization games. Math. Oper. Res. 24(3), 751\u2013766 (1999)","journal-title":"Math. Oper. Res."},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Dobzinski, S., Fu, H., Kleinberg, R.D.: On the complexity of computing an equilibrium in combinatorial auctions. In: Proceedings of SODA (2015)","DOI":"10.1137\/1.9781611973730.9"},{"issue":"1","key":"3_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/moor.1090.0436","volume":"35","author":"S Dobzinski","year":"2010","unstructured":"Dobzinski, S., Nisan, N., Schapira, M.: Approximation algorithms for combinatorial auctions with complement-free bidders. Math. Oper. Res. 35(1), 1\u201313 (2010)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"3_CR11","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1137\/070680977","volume":"39","author":"U Feige","year":"2009","unstructured":"Feige, U.: On maximizing welfare when utility functions are subadditive. SIAM J. Comput. 39(1), 122\u2013142 (2009)","journal-title":"SIAM J. Comput."},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1007\/978-3-662-47666-6_48","volume-title":"Automata, Languages, and Programming","author":"M Feldman","year":"2015","unstructured":"Feldman, M., Friedler, O.: A unified framework for strong price of anarchy in clustering games. In: Halld\u00f3rsson, M.M., Iwama, K., Kobayashi, N., Speckmann, B. (eds.) ICALP 2015. LNCS, vol. 9135, pp. 601\u2013613. Springer, Heidelberg (2015)"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Feldman, M., Fu, H., Gravin, N., Lucier, B.: Simultaneous auctions are (almost) efficient. In: Proceedings of STOC (2013)","DOI":"10.1145\/2488608.2488634"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Feldman, M., Lewin-Eytan, L., Naor, J.: Hedonic clustering games. In: Proceedings of SPAA (2012)","DOI":"10.1145\/2312005.2312053"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Georgiou, K., Swamy, C.: Black-box reductions for cost-sharing mechanism design. Games and Economic Behavior (2013)","DOI":"10.1137\/1.9781611973099.72"},{"issue":"1","key":"3_CR16","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s00182-011-0312-8","volume":"42","author":"M Hoefer","year":"2013","unstructured":"Hoefer, M.: Strategic cooperation in cost sharing games. Int. J. Game Theory 42(1), 29\u201353 (2013)","journal-title":"Int. J. Game Theory"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Kleinberg, J.M., Oren, S.: Mechanisms for (mis)allocating scientific credit. In: Proceedings of STOC (2011)","DOI":"10.1145\/1993636.1993707"},{"issue":"2","key":"3_CR18","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/j.geb.2005.02.006","volume":"55","author":"B Lehmann","year":"2006","unstructured":"Lehmann, B., Lehmann, D., Nisan, N.: Combinatorial auctions with decreasing marginal utilities. Games Econ. Behav. 55(2), 270\u2013296 (2006)","journal-title":"Games Econ. Behav."},{"key":"3_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/978-3-642-16170-4_30","volume-title":"Algorithmic Game Theory","author":"R Meir","year":"2010","unstructured":"Meir, R., Bachrach, Y., Rosenschein, J.S.: Minimal subsidies in expense sharing games. In: Kontogiannis, S., Koutsoupias, E., Spirakis, P.G. (eds.) SAGT 2010. LNCS, vol. 6386, pp. 347\u2013358. Springer, Heidelberg (2010)"},{"issue":"3","key":"3_CR20","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1287\/moor.2.3.225","volume":"2","author":"RB Myerson","year":"1977","unstructured":"Myerson, R.B.: Graphs and cooperation in games. Math. Oper. Res. 2(3), 225\u2013229 (1977)","journal-title":"Math. Oper. Res."},{"issue":"4","key":"3_CR21","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1145\/1538902.1538907","volume":"56","author":"T Roughgarden","year":"2009","unstructured":"Roughgarden, T., Sundararajan, M.: Quantifying inefficiency in cost-sharing mechanisms. J. ACM 56(4), 23 (2009)","journal-title":"J. ACM"},{"key":"3_CR22","doi-asserted-by":"crossref","unstructured":"Vondr\u00e1k, J.: Optimal approximation for the submodular welfare problem in the value oracle model. In: Proceedings of STOC (2008)","DOI":"10.1145\/1374376.1374389"}],"container-title":["Lecture Notes in Computer Science","Web and Internet Economics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48995-6_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,28]],"date-time":"2023-12-28T09:11:51Z","timestamp":1703754711000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-48995-6_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662489949","9783662489956"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48995-6_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"30 December 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}