The Bipartite Rationing Problem

In the bipartite rationing problem, a set of agents share a single resource available in different “types,” each agent has a claim over only a subset of the resource types, and these claims overlap in arbitrary fashion. The goal is to divide fairly the various types of resources between the claimants when resources are in short supply. With a single type of resource, this is the standard rationing problem [O'Neill B (1982) A problem of rights arbitration from the Talmud. Math. Soc. Sci. 2(4):345–371], of which the three benchmark solutions are the proportional, uniform gains, and uniform losses methods. We extend these methods to the bipartite context, imposing the familiar consistency requirement: the division is unchanged if we remove an agent (respectively, a resource), and take away at the same time his share of the various resources (respectively, reduce the claims of the relevant agents). The uniform gains and uniform losses methods have infinitely many consistent extensions, but the proportional me...

[1]  J. Randall Brown,et al.  The Sharing Problem , 1979, Oper. Res..

[2]  Rakesh V. Vohra,et al.  Towards equitable distribution via proportional equity constraints , 1993, Math. Program..

[3]  J. Randall Brown,et al.  Proportional Equity Flow Problem for Terminal Arcs , 1997, Oper. Res..

[4]  Debraj Ray,et al.  A CONCEPT OF EGALITARIANISM UNDER PARTICIPATION , 1989 .

[5]  Alvin E. Roth,et al.  Pairwise Kidney Exchange , 2004, J. Econ. Theory.

[6]  H. Peyton Young,et al.  Fair Representation: Meeting the Ideal of One Man, One Vote , 1982 .

[7]  Marek Mikolaj Kaminski,et al.  'Hydraulic' rationing , 2000, Math. Soc. Sci..

[8]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[9]  Karen S. Cook,et al.  Distributive Justice, Equity, and Equality , 1983 .

[10]  T. Beauchamp.  Distributive justice. , 2019, Bioethics digest.

[11]  Debraj Ray,et al.  A Concept of Egalitarianism under Participation Constraints , 1989 .

[12]  Hanan Luss,et al.  On Equitable Resource Allocation Problems: A Lexicographic Minimax Approach , 1999, Oper. Res..

[13]  J. Sethuraman,et al.  Loss calibrated methods for bipartite rationing: bipartite rationing , 2013, EC '13.

[14]  W. Thomson.  Consistent Allocation Rules , 1996 .

[15]  Christopher P. Chambers.  Consistency in the probabilistic assignment model , 2004 .

[16]  H. Moulin,et al.  Random Matching under Dichotomous Preferences , 2004 .

[17]  Nimrod Megiddo,et al.  Optimal flows in networks with multiple sources and sinks , 1974, Math. Program..

[18]  Sanjeev Khanna,et al.  Network bargaining: algorithms and structural results , 2009, EC '09.

[19]  Hervé Moulin,et al.  Axiomatic cost and surplus sharing , 2002 .

[20]  R. Rajendiran,et al.  Topological Spaces , 2019, A Physicist's Introduction to Algebraic Structures.

[21]  Yves Sprumont.  The Division Problem with Single-Peaked Preferences: A Characterization of the Uniform Allocation Rule , 1991 .

[22]  J. Randall Brown,et al.  The flow circulation sharing problem , 1983, Math. Program..

[23]  H. Moulin.  Equal or proportional division of a surplus, and other methods , 1987 .

[24]  M. Deutsch.  Equity, Equality, and Need: What Determines Which Value Will Be Used as the Basis of Distributive Justice? , 1975 .

[25]  H. Young,et al.  Distributive justice in taxation , 1988 .

[26]  M. Fleurbaey.  Fairness, responsibility, and welfare , 2008 .

[27]  Çagatay Kayi,et al.  Allocation rules on networks , 2012, Soc. Choice Welf..

[28]  Or Chronicle.  ON EQUITABLE RESOURCE ALLOCATION PROBLEMS: A LEXICOGRAPHIC MINIMAX APPROACH , 1999 .

[29]  David K. Smith.  Network Flows: Theory, Algorithms, and Applications , 1994 .

[30]  N. Megiddo.  A GOOD ALGORITHM FOR LEXICOGRAPHICALLY OPTIMAL FLOWS IN MULTI-TERMINAL NETWORKS , 1977 .

[31]  Uwe Zimmermann.  Linear and combinatorial sharing problems , 1986, Discret. Appl. Math..

[32]  Barry O'Neill,et al.  A problem of rights arbitration from the Talmud , 1982, Math. Soc. Sci..

[33]  Uwe T. Zimmermann.  On the complexity of the dual method for maximum balanced flows , 1994, Discret. Appl. Math..

[34]  Tanmoy Chakraborty,et al.  Bargaining Solutions in a Social Network , 2008, WINE.

[35]  H. Peyton Young,et al.  On Dividing an Amount According to Individual Claims or Liabilities , 1987, Math. Oper. Res..

[36]  Éva Tardos,et al.  Balanced outcomes in social exchange networks , 2008, STOC.

[37]  Hervé Moulin,et al.  Clearing supply and demand under bilateral constraints , 2010, BQGT.

[38]  Hervé Moulin,et al.  Egalitarianism under earmark constraints , 2013, J. Econ. Theory.

[39]  William Thomson,et al.  Axiomatic and game-theoretic analysis of bankruptcy and taxation problems: a survey , 2003, Math. Soc. Sci..

[40]  K. Arrow,et al.  Handbook of Social Choice and Welfare , 2011 .

[41]  W. Lucas.  Fair Representation: Meeting the Ideal of One Man, One Vote. By Michel L. Balinski and H. Peyton Young , 1985 .

[42]  H. Moulin.  Priority Rules and Other Asymmetric Rationing Methods , 2000 .

[43]  R. Aumann,et al.  Game theoretic analysis of a bankruptcy problem from the Talmud , 1985 .

[44]  Robert E. Tarjan,et al.  A Fast Parametric Maximum Flow Algorithm and Applications , 1989, SIAM J. Comput..

[45]  J. Randall Brown,et al.  The Knapsack Sharing Problem , 1979, Oper. Res..

[46]  J. Sethuraman,et al.  Balancing supply and demand under bilateral constraints , 2012 .

[47]  J. Roemer.  Theories of Distributive Justice , 1997 .