Fractional solutions for capacitated NTU-games, with applications to stable matchings

In this paper we investigate some new applications of Scarfs Lemma. First, we introduce the notion of fractional core for NTU-games, which is always nonempty by the Lemma. Stable allocation is a general solution concept for games where both the players and their possible cooperations can have capacities. We show that the problem of finding a stable allocation, given a finitely generated NTU-game with capacities, is always solvable by Scarfs Lemma. Then we consider an even more general setting where players contributions in a joint activity may be different. We show that a stable allocation can be found by the Scarf algorithm in this case as well. Finally we describe the interpretation of these results for stable matching problems, and in particular, for the hospitals/residents problem with couples.

[1]  Thanh Nguyen,et al.  Near Feasible Stable Matchings with Complementarities , 2014 .

[2]  Brian C. Dean,et al.  Faster Algorithms for Stable Allocation Problems , 2010, Algorithmica.

[3]  Tamás Fleiner,et al.  Matching couples with Scarf’s algorithm , 2015, Annals of Mathematics and Artificial Intelligence.

[4]  Michel Balinski,et al.  Integer Programming: Methods, Uses, Computations , 1965 .

[5]  Tamás Fleiner,et al.  The integral stable allocation problem on graphs , 2010, Discret. Optim..

[6]  L. Shapley,et al.  The assignment game I: The core , 1971 .

[7]  Matthew O. Jackson,et al.  The Stability of Hedonic Coalition Structures , 2002, Games Econ. Behav..

[8]  Parag A. Pathak,et al.  Matching with Couples: Stability and Incentives in Large Markets , 2010 .

[9]  Shlomo Weber,et al.  Strongly balanced cooperative games , 1992 .

[10]  D. Manlove,et al.  Keeping partners together: algorithmic results for the hospitals/residents problem with couples , 2010, J. Comb. Optim..

[11]  Tamás Fleiner,et al.  On a lemma of Scarf , 2002, J. Comb. Theory, Ser. B.

[12]  David Gale,et al.  Stable schedule matching under revealed preference , 2003, J. Econ. Theory.

[13]  Eric McDermid,et al.  Three-Sided Stable Matchings with Cyclic Preferences , 2010, Algorithmica.

[14]  Michel Balinski,et al.  The Stable Allocation (or Ordinal Transportation) Problem , 2002, Math. Oper. Res..

[15]  A. Roth,et al.  The Redesign of the Matching Market for American Physicians: Some Engineering Aspects of Economic Design , 1999, The American economic review.

[16]  Tayfun Sönmez,et al.  Core in a simple coalition formation game , 2001, Soc. Choice Welf..

[17]  V. Crawford,et al.  Job Matching with Heterogeneous Firms and Workers , 1981 .

[18]  L. S. Shapley,et al.  College Admissions and the Stability of Marriage , 2013, Am. Math. Mon..

[19]  M. Kaneko.  The central assignment game and the assignment markets , 1982 .

[20]  László Lovász,et al.  Normal hypergraphs and the perfect graph conjecture , 1972, Discret. Math..

[21]  Jimmy J. M. Tan.  A Necessary and Sufficient Condition for the Existence of a Complete Stable Matching , 1991, J. Algorithms.

[22]  Herbert E. Scarf,et al.  The Computation of Economic Equilibria , 1974 .

[23]  Brian C. Dean,et al.  The Generalized Stable Allocation Problem , 2009, WALCOM.

[24]  Tamás Király,et al.  Kernels, Stable Matchings, and Scarf's Lemma , 2010 .

[25]  Nicole Immorlica,et al.  The Unsplittable Stable Marriage Problem , 2006, IFIP TCS.

[26]  Alvin E. Roth,et al.  Two-Sided Matching: A Study in Game-Theoretic Modeling and Analysis , 1990 .

[27]  A. Roth.  The Evolution of the Labor Market for Medical Interns and Residents: A Case Study in Game Theory , 1984, Journal of Political Economy.

[28]  Flip Klijn,et al.  Matching with couples: a Multidisciplinary Survey , 2013, IGTR.

[29]  Ahmet Alkan,et al.  Pairing Games and Markets , 2014 .

[30]  Myrna Holtz Wooders,et al.  The epsilon core of a large replica game , 1983 .

[31]  Robert W. Irving,et al.  The Stable marriage problem - structure and algorithms , 1989, Foundations of computing series.

[32]  Jean-Pierre Aubin,et al.  Cooperative Fuzzy Games , 1981, Math. Oper. Res..

[33]  Eytan Ronn,et al.  NP-Complete Stable Matching Problems , 1990, J. Algorithms.

[34]  Nicholas R. Jennings,et al.  Cooperative Games with Overlapping Coalitions , 2010, J. Artif. Intell. Res..

[35]  Robert W. Irving,et al.  The stable fixtures problem - A many-to-many extension of stable roommates , 2007, Discret. Appl. Math..

[36]  Michel Balinski,et al.  Integer Programming: Methods, Uses, Computation , 2010, 50 Years of Integer Programming.

[37]  Mamoru Kaneko,et al.  Cores of partitioning games , 1982, Math. Soc. Sci..

[38]  Robert W. Irving,et al.  Stable matching with couples: An empirical study , 2011, JEAL.

[39]  Tamás Fleiner,et al.  Fractional Solutions for NTU-Games , 2010 .

[40]  Francesco Mallegni,et al.  The Computation of Economic Equilibria , 1973 .

[41]  Jeroen Kuipers.  Combinatorial methods in cooperative game theory , 1994 .

[42]  Vladimir Gurvich,et al.  Perfect graphs are kernel solvable , 1996, Discret. Math..

[43]  H. Scarf.  The Core of an N Person Game , 1967 .