{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,30]],"date-time":"2025-05-30T14:47:50Z","timestamp":1748616470860,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662531730"},{"type":"electronic","value":"9783662531747"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-53174-7_4","type":"book-chapter","created":{"date-parts":[[2016,8,4]],"date-time":"2016-08-04T10:50:06Z","timestamp":1470307806000},"page":"49-63","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Stable Fixtures Problem with Payments"],"prefix":"10.1007","author":[{"given":"P\u00e9ter","family":"Bir\u00f3","sequence":"first","affiliation":[]},{"given":"Walter","family":"Kern","sequence":"additional","affiliation":[]},{"given":"Dani\u00ebl","family":"Paulusma","sequence":"additional","affiliation":[]},{"given":"P\u00e9ter","family":"Wojuteczky","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,8,5]]},"reference":[{"key":"4_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0166-218X(99)00203-6","volume":"101","author":"M Ba\u00efou","year":"2000","unstructured":"Ba\u00efou, M., Balinski, M.: Many-to-many matching: stable polyandrous polygamy (or polygamous polyandry). Discrete Appl. Math. 101, 1\u201312 (2000)","journal-title":"Discrete Appl. Math."},{"key":"4_CR2","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1090\/qam\/102435","volume":"16","author":"R Bellman","year":"1958","unstructured":"Bellman, R.: On a routing problem. Q. Appl. Math. 16, 87\u201390 (1958)","journal-title":"Q. Appl. Math."},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.tcs.2013.03.027","volume":"540\u2013541","author":"P Bir\u00f3","year":"2014","unstructured":"Bir\u00f3, P., Bomhoff, M., Golovach, P.A., Kern, W., Paulusma, D.: Solutions for the stable roommates problem with payments. Theoret. Comput. Sci. 540\u2013541, 53\u201361 (2014)","journal-title":"Theoret. Comput. Sci."},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/s00182-011-0273-y","volume":"41","author":"P Bir\u00f3","year":"2012","unstructured":"Bir\u00f3, P., Kern, W., Paulusma, D.: Computing solutions for matching games. Int. J. Game Theory 41, 75\u201390 (2012)","journal-title":"Int. J. Game Theory"},{"key":"4_CR5","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1145\/1077464.1077474","volume":"1","author":"K Cechl\u00e1rov\u00e1","year":"2005","unstructured":"Cechl\u00e1rov\u00e1, K., Fleiner, T.: On a generalization of the stable roommates problem. ACM Trans. Algorithms 1, 143\u2013156 (2005)","journal-title":"ACM Trans. Algorithms"},{"key":"4_CR6","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1613\/jair.3075","volume":"39","author":"G Chalkiadakis","year":"2010","unstructured":"Chalkiadakis, G., Elkind, E., Markakis, E., Polurkov, M., Jennings, N.R.: Cooperative games with overlapping coalitions. J. Artif. Intell. Res. 39, 179\u2013216 (2010)","journal-title":"J. Artif. Intell. Res."},{"key":"4_CR7","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, 751\u2013766 (1999)","journal-title":"Math. Oper. Res."},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/s001820000058","volume":"29","author":"K Eriksson","year":"2001","unstructured":"Eriksson, K., Karlander, J.: Stable outcomes of the roommate game with transferable utility. Int. J. Game Theory 29, 555\u2013569 (2001)","journal-title":"Int. J. Game Theory"},{"key":"4_CR9","doi-asserted-by":"publisher","first-page":"9","DOI":"10.2307\/2312726","volume":"69","author":"D Gale","year":"1962","unstructured":"Gale, D., Shapley, L.S.: College admissions and the stability of marriage. Am. Math. Mon. 69, 9\u201315 (1962)","journal-title":"Am. Math. Mon."},{"key":"4_CR10","series-title":"A Guide to the Theory of NP-Completeness","volume-title":"Computers and Intractability","author":"M Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability. A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)"},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/BF02579273","volume":"1","author":"M Gr\u00f6tschel","year":"1981","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: The ellipsoid method, its consequences in combinatorial optimization. Combinatorica 1, 169\u2013197 (1981). [corrigendum: Combinatorica 4, 291\u2013295 (1984)]","journal-title":"Combinatorica"},{"key":"4_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-78240-4","volume-title":"Geometric Algorithms and Combinatorial Optimization","author":"M Gr\u00f6tschel","year":"1993","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization, 2nd edn. Springer, Berlin (1993)","edition":"2"},{"key":"4_CR13","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1016\/0196-6774(85)90033-1","volume":"6","author":"RW Irving","year":"1985","unstructured":"Irving, R.W.: An efficient algorithm for the stable roommates problem. J. Algorithms 6, 577\u2013595 (1985)","journal-title":"J. Algorithms"},{"key":"4_CR14","doi-asserted-by":"publisher","first-page":"2118","DOI":"10.1016\/j.dam.2007.05.015","volume":"155","author":"RW Irving","year":"2007","unstructured":"Irving, R.W., Scott, S.: The stable fixtures problem - a many-to-many extension of stable roommates. Discrete Appl. Math. 155, 2118\u20132129 (2007)","journal-title":"Discrete Appl. Math."},{"key":"4_CR15","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/S0166-218X(00)00241-9","volume":"108","author":"W Kern","year":"2001","unstructured":"Kern, W., Paulusma, D.: The new FIFA rules are hard: complexity aspects of sport competitions. Discrete Appl. Math. 108, 317\u2013323 (2001)","journal-title":"Discrete Appl. Math."},{"key":"4_CR16","first-page":"191","volume":"20","author":"LG Khachiyan","year":"1979","unstructured":"Khachiyan, L.G.: A polynomial algorithm in linear programming. Soviet Math. Dokl. 20, 191\u2013194 (1979)","journal-title":"Soviet Math. Dokl."},{"key":"4_CR17","volume-title":"Combinatorial Optimization","author":"E Lawler","year":"1976","unstructured":"Lawler, E.: Combinatorial Optimization. Courier Dover Publ., New York (1976)"},{"key":"4_CR18","doi-asserted-by":"publisher","first-page":"53","DOI":"10.2307\/1907742","volume":"25","author":"TC Koopmans","year":"1957","unstructured":"Koopmans, T.C., Beckmann, M.: Assignment problems and the location of economic activities. Econometrica 25, 53\u201376 (1957)","journal-title":"Econometrica"},{"key":"4_CR19","doi-asserted-by":"publisher","first-page":"1480","DOI":"10.1137\/060664793","volume":"22","author":"AN Letchford","year":"2008","unstructured":"Letchford, A.N., Reinelt, G., Theis, D.O.: Odd minimum cut sets and \n                      \n                        \n                      \n                      $$b$$\n                    -matchings revisited. SIAM J. Discrete Math. 22, 1480\u20131487 (2008)","journal-title":"SIAM J. Discrete Math."},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Manlove, D.: Algorithmics of Matching Under Preferences, Series on Theoretical Computer Science, vol. 2. World Scientific (2013)","DOI":"10.1142\/8591"},{"key":"4_CR21","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1287\/moor.4.4.414","volume":"4","author":"N Megiddo","year":"1979","unstructured":"Megiddo, N.: Combinatorial optimization with rational objective functions. Math. OR 4, 414\u2013424 (1979)","journal-title":"Math. OR"},{"key":"4_CR22","doi-asserted-by":"publisher","DOI":"10.1017\/CCOL052139015X","volume-title":"Two-Sided Matching: A Study in Game-Theoretic Modeling and Analysis","author":"AE Roth","year":"1990","unstructured":"Roth, A.E., Sotomayor, M.: Two-Sided Matching: A Study in Game-Theoretic Modeling and Analysis. Cambridge University Press, Cambridge (1990)"},{"key":"4_CR23","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF01753437","volume":"1","author":"LS Shapley","year":"1972","unstructured":"Shapley, L.S., Shubik, M.: The assignment game I: the core. Int. J. Game Theory 1, 111\u2013130 (1972)","journal-title":"Int. J. Game Theory"},{"key":"4_CR24","doi-asserted-by":"crossref","unstructured":"Sotomayor, M.: The multiple partners game. In: Equilibrium and Dynamics: Essays in Honor of David Gale. Macmillan Press Ltd, New York (1992)","DOI":"10.1007\/978-1-349-11696-6_17"},{"key":"4_CR25","doi-asserted-by":"publisher","first-page":"347","DOI":"10.4153\/CJM-1954-033-3","volume":"6","author":"WT Tutte","year":"1954","unstructured":"Tutte, W.T.: A short proof of the factor factor theorem for finite graphs. Can. J. Math. 6, 347\u2013352 (1954)","journal-title":"Can. J. Math."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-53174-7_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T01:11:11Z","timestamp":1558314671000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53174-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662531730","9783662531747"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53174-7_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"5 August 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Graph-Theoretic Concepts in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Garching","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2015","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 June 2015","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 June 2015","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"41","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2015","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}