{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T11:11:56Z","timestamp":1764587516863},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,3,27]],"date-time":"2011-03-27T00:00:00Z","timestamp":1301184000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int J Game Theory"],"published-print":{"date-parts":[[2012,2]]},"DOI":"10.1007\/s00182-011-0273-y","type":"journal-article","created":{"date-parts":[[2011,3,26]],"date-time":"2011-03-26T19:28:45Z","timestamp":1301167725000},"page":"75-90","source":"Crossref","is-referenced-by-count":36,"title":["Computing solutions for matching games"],"prefix":"10.1007","volume":"41","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":[]}],"member":"297","published-online":{"date-parts":[[2011,3,27]]},"reference":[{"key":"273_CR1","doi-asserted-by":"crossref","unstructured":"Abraham DJ, Bir\u00f3 P, Manlove DF (2006) \u201cAlmost stable\u201d matchings in the roommates problem. In: Proceedings of WAOA 2005: the 3rd workshop on approximation and online algorithms. Lecture Notes in Computer Science, vol 3879. pp 1\u201314","DOI":"10.1007\/11671411_1"},{"key":"273_CR2","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1287\/mnsc.12.3.253","volume":"12","author":"ML Balinski","year":"1965","unstructured":"Balinski ML (1965) Integer programming: methods, uses, computation. Manag Sci 12: 253\u2013313","journal-title":"Manag Sci"},{"key":"273_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-4393-0","volume-title":"Cooperative games on combinatorial structures","author":"JM Bilbao","year":"2000","unstructured":"Bilbao JM (2000) Cooperative games on combinatorial structures. Kluwer Academic, Norwell"},{"key":"273_CR4","unstructured":"Bir\u00f3 P (2007) The stable matching problem and its generalizations: an algorithmic and game theoretical approach. PhD Thesis, Budapest University of Technology and Economics, Budapest"},{"key":"273_CR5","doi-asserted-by":"crossref","first-page":"751","DOI":"10.1287\/moor.24.3.751","volume":"24","author":"X Deng","year":"1999","unstructured":"Deng X, Ibaraki T, Nagamochi H (1999) Algorithmic aspects of the core of combinatorial optimization games. Math Oper Res 24: 751\u2013766","journal-title":"Math Oper Res"},{"key":"273_CR6","first-page":"16","volume":"38","author":"J Egerv\u00e1ry","year":"1931","unstructured":"Egerv\u00e1ry J (1931) Matrixok kombinatorius tulajdons\u00e1gair\u00f3l. Matematikai \u00e9s Fizikai Lapok 38: 16\u201328","journal-title":"Matematikai \u00e9s Fizikai Lapok"},{"key":"273_CR7","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1007\/s001820000058","volume":"29","author":"K Eriksson","year":"2001","unstructured":"Eriksson K, Karlander J (2001) Stable outcomes of the roommate game with transferable utility. Int J Game Theory 29: 555\u2013569","journal-title":"Int J Game Theory"},{"key":"273_CR8","first-page":"195","volume":"83","author":"U Faigle","year":"1998","unstructured":"Faigle U, Kern W, Fekete S, Hochst\u00e4ttler W (1998) The nucleon of cooperative games and an algorithm for matching games. Math Program 83: 195\u2013211","journal-title":"Math Program"},{"key":"273_CR9","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/s001820100065","volume":"30","author":"U Faigle","year":"2001","unstructured":"Faigle U, Kern W, Kuipers J (2001) On the computation of the nucleolus of a cooperative game. Int J Game Theory 30: 79\u201398","journal-title":"Int J Game Theory"},{"key":"273_CR10","unstructured":"Gabow HN (1990) Data structures for weighted matching and nearest common ancestors with linking. In: Proceedings of SODA 1990: the 1st annual ACM-SIAM symposium on discrete algorithms, pp 434\u2013443"},{"key":"273_CR11","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"MR Garey","year":"1976","unstructured":"Garey MR, Johnson DS, Stockmeyer L (1976) Some simplified NP-complete graph problems. Theor Comput Sci 1: 237\u2013267","journal-title":"Theor Comput Sci"},{"key":"273_CR12","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1287\/moor.28.2.294.14477","volume":"28","author":"W Kern","year":"2003","unstructured":"Kern W, Paulusma D (2003) Matching games: the least core and the nucleolus. Math Oper Res 28: 294\u2013308","journal-title":"Math Oper Res"},{"key":"273_CR13","first-page":"191","volume":"20","author":"LG Khachiyan","year":"1979","unstructured":"Khachiyan LG (1979) A polynomial algorithm in linear programming. Sov Math Dokl 20: 191\u2013194","journal-title":"Sov Math Dokl"},{"key":"273_CR14","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1007\/s00355-010-0447-8","volume":"35","author":"B Klaus","year":"2010","unstructured":"Klaus B, Nichifor A (2010) Consistency for one-sided assignment problems. Soc Choice Welf 35: 415\u2013433","journal-title":"Soc Choice Welf"},{"key":"273_CR15","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1287\/moor.4.4.303","volume":"4","author":"M Maschler","year":"1979","unstructured":"Maschler M, Peleg B, Shapley LS (1979) Geometric properties of the kernel, nucleolus, nd related solution concepts. Math Oper Res 4: 303\u2013338","journal-title":"Math Oper Res"},{"key":"273_CR16","unstructured":"Matsui T (1998) A note on the nucleolus of assignment games, In: 5th International conference on nonlinear analysis and convex analysis. World Scientific, Singapore, pp 253\u2013260"},{"key":"273_CR17","unstructured":"Micali S, Vazirani VV (1980) An $${O(\\sqrt{|V|}\\,\\cdot\\,|E|)}$$ algorithm for finding maximum matching in general graphs. In: Proceedings of FOCS 1980: the 21st annual symposium on foundations of computer science, pp 17\u201327"},{"key":"273_CR18","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1007\/BF01580444","volume":"8","author":"GL Nemhauser","year":"1975","unstructured":"Nemhauser GL, Trotter LE (1975) Vertex packings: structural properties and algorithms. Math Program 8: 232\u2013248","journal-title":"Math Program"},{"key":"273_CR19","volume-title":"Game theory","author":"G Owen","year":"1995","unstructured":"Owen G (1995) Game theory. Academic Press, San Diego"},{"key":"273_CR20","unstructured":"Paulusma D (2001) Complexity aspects of cooperative games. PhD Thesis, University of Twente, Enschede"},{"key":"273_CR21","doi-asserted-by":"crossref","first-page":"1163","DOI":"10.1137\/0117107","volume":"17","author":"D Schmeidler","year":"1969","unstructured":"Schmeidler D (1969) The nucleolus of a characteristic function game. SIAM J Appl Math 17: 1163\u20131170","journal-title":"SIAM J Appl Math"},{"key":"273_CR22","unstructured":"Schrijver A (2003) Combinatorial optimization. Polyhedra and efficiency, vol A, algorithms and combinatorics, vol 24. Springer-Verlag, Berlin"},{"key":"273_CR23","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF01753437","volume":"1","author":"LS Shapley","year":"1971","unstructured":"Shapley LS, Shubik M (1971) The assignment game I: the core. Int J Game Theory 1: 111\u2013130","journal-title":"Int J Game Theory"},{"key":"273_CR24","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/BF01240179","volume":"23","author":"T Solymosi","year":"1994","unstructured":"Solymosi T, Raghavan TES (1994) An algorithm for finding the nucleolus of assignment games. Int J Game Theory 23: 119\u2013143","journal-title":"Int J Game Theory"}],"container-title":["International Journal of Game Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00182-011-0273-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00182-011-0273-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00182-011-0273-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,9]],"date-time":"2019-06-09T13:11:41Z","timestamp":1560085901000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00182-011-0273-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3,27]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,2]]}},"alternative-id":["273"],"URL":"https:\/\/doi.org\/10.1007\/s00182-011-0273-y","relation":{},"ISSN":["0020-7276","1432-1270"],"issn-type":[{"value":"0020-7276","type":"print"},{"value":"1432-1270","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,3,27]]}}}