{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T19:49:54Z","timestamp":1742932194316,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642450457"},{"type":"electronic","value":"9783642450464"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-45046-4_21","type":"book-chapter","created":{"date-parts":[[2013,12,9]],"date-time":"2013-12-09T12:53:01Z","timestamp":1386593581000},"page":"249-262","source":"Crossref","is-referenced-by-count":4,"title":["Designing Profit Shares in Matching and Coalition Formation Games"],"prefix":"10.1007","author":[{"given":"Martin","family":"Hoefer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lisa","family":"Wagner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"21_CR1","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1137\/090753498","volume":"40","author":"H. Ackermann","year":"2011","unstructured":"Ackermann, H., Goldberg, P., Mirrokni, V., R\u00f6glin, H., V\u00f6cking, B.: Uncoordinated two-sided matching markets. SIAM J. Comput.\u00a040(1), 92\u2013106 (2011)","journal-title":"SIAM J. Comput."},{"issue":"6","key":"21_CR2","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1080\/17445760903548283","volume":"25","author":"K. Akkaya","year":"2010","unstructured":"Akkaya, K., Guneydas, I., Bicak, A.: Autonomous actor positioning in wireless sensor and actor networks using stable matching. Intl. J. Parallel, Emergent and Distrib. Syst.\u00a025(6), 439\u2013464 (2010)","journal-title":"Intl. J. Parallel, Emergent and Distrib. Syst."},{"key":"21_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-642-40450-4_5","volume-title":"Algorithms \u2013 ESA 2013","author":"E. Anshelevich","year":"2013","unstructured":"Anshelevich, E., Bhardwaj, O., Hoefer, M.: Friendship and stable matching. In: Bodlaender, H.L., Italiano, G.F. (eds.) ESA 2013. LNCS, vol.\u00a08125, pp. 49\u201360. Springer, Heidelberg (2013)"},{"issue":"1","key":"21_CR4","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/s10458-011-9184-3","volume":"26","author":"E. Anshelevich","year":"2013","unstructured":"Anshelevich, E., Das, S., Naamad, Y.: Anarchy, stability, and utopia: Creating better matchings. Auton. Agents Multi-Agent Syst.\u00a026(1), 120\u2013140 (2013)","journal-title":"Auton. Agents Multi-Agent Syst."},{"issue":"1-2","key":"21_CR5","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/s00453-011-9520-7","volume":"63","author":"E. Anshelevich","year":"2012","unstructured":"Anshelevich, E., Hoefer, M.: Contribution games in networks. Algorithmica\u00a063(1-2), 51\u201390 (2012)","journal-title":"Algorithmica"},{"unstructured":"Augustine, J., Chen, N., Elkind, E., Fanelli, A., Gravin, N., Shiryaev, D.: Dynamics of profit-sharing games. In: Proc. 22nd Intl. Joint Conf. Artif. Intell. (IJCAI), pp. 37\u201342 (2011)","key":"21_CR6"},{"issue":"1","key":"21_CR7","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/s00182-011-0273-y","volume":"41","author":"P. Bir\u00f3","year":"2011","unstructured":"Bir\u00f3, P., Kern, W., Paulusma, D.: Computing solutions for matching games. Int. J. Game Theory\u00a041(1), 75\u201390 (2011)","journal-title":"Int. J. Game Theory"},{"key":"21_CR8","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1006\/jeth.1997.2307","volume":"76","author":"Y. Blum","year":"1997","unstructured":"Blum, Y., Roth, A., Rothblum, U.: Vacancy chains and equilibration in senior-level labor markets. J. Econom. Theory\u00a076, 362\u2013411 (1997)","journal-title":"J. Econom. Theory"},{"unstructured":"Branzei, S., Larson, K.: Coalitional affinity games and the stability gap. In: Proc. 21st Intl. Joint Conf. Artif. Intell. (IJCAI), pp. 79\u201384 (2009)","key":"21_CR9"},{"doi-asserted-by":"crossref","unstructured":"Cechl\u00e1rova, K.: Stable partition problem. In: Encyclopedia of Algorithms (2008)","key":"21_CR10","DOI":"10.1007\/978-0-387-30162-4_397"},{"issue":"5","key":"21_CR11","doi-asserted-by":"publisher","first-page":"1799","DOI":"10.1137\/08072721X","volume":"39","author":"H.-L. Chen","year":"2010","unstructured":"Chen, H.-L., Roughgarden, T., Valiant, G.: Designing network protocols for good equilibria. SIAM J. Comput.\u00a039(5), 1799\u20131832 (2010)","journal-title":"SIAM J. Comput."},{"doi-asserted-by":"crossref","unstructured":"Chen, N., Lu, P., Zhang, H.: Computing the nucleolus of matching, cover and clique games. In: Proc. 26th Conf. Artificial Intelligence, AAAI (2012)","key":"21_CR12","DOI":"10.1609\/aaai.v26i1.8242"},{"issue":"3","key":"21_CR13","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.\u00a024(3), 751\u2013766 (1999)","journal-title":"Math. Oper. Res."},{"key":"21_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/978-3-642-16170-4_16","volume-title":"Algorithmic Game Theory","author":"M. Gairing","year":"2010","unstructured":"Gairing, M., Savani, R.: Computing stable outcomes in hedonic games. In: Kontogiannis, S., Koutsoupias, E., Spirakis, P.G. (eds.) SAGT 2010. LNCS, vol.\u00a06386, pp. 174\u2013185. Springer, Heidelberg (2010)"},{"unstructured":"Gusfield, D., Irving, R.: The Stable Marriage Problem: Structure and Algorithms. MIT Press (1989)","key":"21_CR15"},{"issue":"4","key":"21_CR16","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1142\/S0219198906001144","volume":"8","author":"J. Hajdukov\u00e1","year":"2006","unstructured":"Hajdukov\u00e1, J.: Coalition formation games: A survey. Intl. Game Theory Rev.\u00a08(4), 613\u2013641 (2006)","journal-title":"Intl. Game Theory Rev."},{"key":"21_CR17","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.ic.2012.10.005","volume":"222","author":"M. Hoefer","year":"2013","unstructured":"Hoefer, M.: Local matching dynamics in social networks. Inf. Comput.\u00a0222, 20\u201335 (2013)","journal-title":"Inf. Comput."},{"key":"21_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1007\/978-3-642-39212-2_54","volume-title":"Automata, Languages, and Programming","author":"M. Hoefer","year":"2013","unstructured":"Hoefer, M., Wagner, L.: Locally stable marriage with strict preferences. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013, Part II. LNCS, vol.\u00a07966, pp. 620\u2013631. Springer, Heidelberg (2013)"},{"issue":"2","key":"21_CR19","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1287\/moor.28.2.294.14477","volume":"28","author":"W. Kern","year":"2003","unstructured":"Kern, W., Paulusma, D.: Matching games: The least core and the nucleolus. Math. Oper. Res.\u00a028(2), 294\u2013308 (2003)","journal-title":"Math. Oper. Res."},{"doi-asserted-by":"crossref","unstructured":"Kleinberg, J., Oren, S.: Mechanisms for (mis)allocating scientific credit. In: Proc. 43rd Symp. Theory of Computing (STOC), pp. 529\u2013538 (2011)","key":"21_CR20","DOI":"10.1145\/1993636.1993707"},{"doi-asserted-by":"crossref","unstructured":"Kleinberg, J., Tardos, \u00c9.: Balanced outcomes in social exchange networks. In: Proc. 40th Symp. Theory of Computing (STOC), pp. 295\u2013304 (2008)","key":"21_CR21","DOI":"10.1145\/1374376.1376994"},{"doi-asserted-by":"crossref","unstructured":"Manlove, D.: Algorithmics of Matching Under Preferences. World Scientific (2013)","key":"21_CR22","DOI":"10.1142\/8591"},{"issue":"3","key":"21_CR23","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1016\/j.ejor.2009.09.004","volume":"203","author":"S.-C. Sung","year":"2010","unstructured":"Sung, S.-C., Dimitrov, D.: Computational complexity in additive hedonic games. Europ. J. Oper. Res.\u00a0203(3), 635\u2013639 (2010)","journal-title":"Europ. J. Oper. Res."},{"issue":"1","key":"21_CR24","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1287\/moor.1120.0567","volume":"38","author":"P. von Falkenhausen","year":"2013","unstructured":"von Falkenhausen, P., Harks, T.: Optimal cost sharing for resource selection games. Math. Oper. Res.\u00a038(1), 184\u2013208 (2013)","journal-title":"Math. Oper. Res."}],"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-642-45046-4_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,19]],"date-time":"2023-02-19T21:52:50Z","timestamp":1676843570000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-45046-4_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642450457","9783642450464"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-45046-4_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}