{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T15:13:02Z","timestamp":1750173182533},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642135613"},{"type":"electronic","value":"9783642135620"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13562-0_12","type":"book-chapter","created":{"date-parts":[[2010,5,31]],"date-time":"2010-05-31T09:08:30Z","timestamp":1275296910000},"page":"117-127","source":"Crossref","is-referenced-by-count":4,"title":["On Solution Concepts for Matching Games"],"prefix":"10.1007","author":[{"given":"P\u00e9ter","family":"Bir\u00f3","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Walter","family":"Kern","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dani\u00ebl","family":"Paulusma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11671411_1","volume-title":"Approximation and Online Algorithms","author":"D.J. Abraham","year":"2006","unstructured":"Abraham, D.J., Bir\u00f3, P., Manlove, D.F.: \u201cAlmost stable\u201d matchings in the Roommates problem. In: Erlebach, T., Persinao, G. (eds.) WAOA 2005. LNCS, vol.\u00a03879, pp. 1\u201314. Springer, Heidelberg (2006)"},{"key":"12_CR2","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1287\/mnsc.12.3.253","volume":"12","author":"M.L. Balinski","year":"1965","unstructured":"Balinski, M.L.: Integer programming: Methods, uses, computation. Management Science\u00a012, 253\u2013313 (1965)","journal-title":"Management Science"},{"key":"12_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-4393-0","volume-title":"Cooperative games on combinatorial structures","author":"J.M. Bilbao","year":"2000","unstructured":"Bilbao, J.M.: Cooperative games on combinatorial structures. Kluwer Academic, Norwell (2000)"},{"key":"12_CR4","unstructured":"Bir\u00f3, P.: The stable matching problem and its generalizations: an algorithmic and game theoretical approach, PhD Thesis, Budapest University of Technology and Economics, Budapest, Hungary (2007)"},{"key":"12_CR5","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, 751\u2013766 (1999)","journal-title":"Math. Oper. Res."},{"key":"12_CR6","first-page":"16","volume":"38","author":"J. Egerv\u00e1ry","year":"1931","unstructured":"Egerv\u00e1ry, J.: Matrixok kombinatorius tulajdons\u00e1gair\u00f3l. Matematikai \u00e9s Fizikai Lapok\u00a038, 16\u201328 (1931)","journal-title":"Matematikai \u00e9s Fizikai Lapok"},{"key":"12_CR7","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. Internat. J. Game Theory\u00a029, 555\u2013569 (2001)","journal-title":"Internat. J. Game Theory"},{"key":"12_CR8","first-page":"195","volume":"83","author":"U. Faigle","year":"1998","unstructured":"Faigle, U., Kern, W., Fekete, S., Hochst\u00e4ttler, W.: The nucleon of cooperative games and an algorithm for matching games. Math. Program.\u00a083, 195\u2013211 (1998)","journal-title":"Math. Program."},{"key":"12_CR9","unstructured":"Gabow, H.N.: Data structures for weighted matching and nearest common ancestors with linking. In: Proceedings of SODA 1990, pp. 434\u2013443 (1990)"},{"key":"12_CR10","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"M.R. Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Stockmeyer, L.: Some simplified NP-complete graph problems. Theoret. Comput. Sci.\u00a01, 237\u2013267 (1976)","journal-title":"Theoret. Comput. Sci."},{"key":"12_CR11","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, 294\u2013308 (2003)","journal-title":"Math. Oper. Res."},{"key":"12_CR12","first-page":"191","volume":"20","author":"L.G. Khachiyan","year":"1979","unstructured":"Khachiyan, L.G.: A polynomial algorithm in linear programming. Soviet Mathematics Doklady\u00a020, 191\u2013194 (1979)","journal-title":"Soviet Mathematics Doklady"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Klaus, B., Nichifor, A.: Consistency and monotonicity in one-sided assignment problems (2009) (preprint)","DOI":"10.2139\/ssrn.1422662"},{"key":"12_CR14","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1287\/moor.4.4.303","volume":"4","author":"M. Maschler","year":"1979","unstructured":"Maschler, M., Peleg, B., Shapley, L.S.: Geometric properties of the kernel, nucleolus, and related solution concepts. Math. Oper. Res.\u00a04, 303\u2013338 (1979)","journal-title":"Math. Oper. Res."},{"key":"12_CR15","first-page":"253","volume-title":"5th International Conference on Nonlinear Analysis and Convex Analysis","author":"T. Matsui","year":"1998","unstructured":"Matsui, T.: A note on the nucleolus of assignment games. In: 5th International Conference on Nonlinear Analysis and Convex Analysis, pp. 253\u2013260. World Scientific, Singapore (1998)"},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"Micali, S., Vazirani, V.V.: An $O(\\sqrt{|V|} \\cdot |E|)$ algorithm for finding maximum matching in general graphs. In: Proceedings of FOCS 1980, pp. 17\u201327 (1980)","DOI":"10.1109\/SFCS.1980.12"},{"key":"12_CR17","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/BF01580444","volume":"8","author":"G.L. Nemhauser","year":"1975","unstructured":"Nemhauser, G.L., Trotter, L.E.: Vertex packings: structural properties and algorithms. Math. Program.\u00a08, 232\u2013248 (1975)","journal-title":"Math. Program."},{"key":"12_CR18","volume-title":"Game theory","author":"G. Owen","year":"1995","unstructured":"Owen, G.: Game theory. Academic Press, San Diego (1995)"},{"key":"12_CR19","unstructured":"Paulusma, D.: Complexity aspects of cooperative games, PhD Thesis, University of Twente, Enschede, the Netherlands (2001)"},{"key":"12_CR20","doi-asserted-by":"publisher","first-page":"1163","DOI":"10.1137\/0117107","volume":"17","author":"D. Schmeidler","year":"1969","unstructured":"Schmeidler, D.: The nucleolus of a characteristic function game. SIAM J. Appl. Math.\u00a017, 1163\u20131170 (1969)","journal-title":"SIAM J. Appl. Math."},{"key":"12_CR21","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF01753437","volume":"1","author":"L.S. Shapley","year":"1972","unstructured":"Shapley, L.S., Shubik, M.: The assignment game I: the core. Internat. J. Game Theory\u00a01, 111\u2013130 (1972)","journal-title":"Internat. J. Game Theory"},{"key":"12_CR22","series-title":"Algorithms and Combinatorics 24","volume-title":"Polyhedra and efficiency","author":"A. Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial optimization. In: Polyhedra and efficiency. Algorithms and Combinatorics 24, vol.\u00a0A. Springer, Berlin (2003)"},{"key":"12_CR23","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/BF01240179","volume":"23","author":"T. Solymosi","year":"1994","unstructured":"Solymosi, T., Raghavan, T.E.S.: An algorithm for finding the nucleolus of assignment games. Internat. J. Game Theory\u00a023, 119\u2013143 (1994)","journal-title":"Internat. J. Game Theory"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13562-0_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:40:01Z","timestamp":1606185601000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13562-0_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642135613","9783642135620"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13562-0_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}