View source for Fair division

{{short description|Problem of sharing resources}}
'''Fair division''' is the problem in [[game theory]] of dividing a set of [[resources]] among several people who have an [[Entitlement (fair division)|entitlement]] to them so that each person receives their due share. That problem arises in various real-world settings such as division of [[inheritance]], partnership [[Dissolution (law)|dissolutions]], [[divorce settlement]]s, electronic [[frequency allocation]], [[air traffic management|airport traffic management]], and exploitation of [[Earth Observation Satellite|Earth observation satellites]]. It is an active research area in [[mathematics]], [[economics]] (especially [[social choice theory]]), and [[dispute resolution]]. The central tenet of fair division is that such a division should be performed by the players themselves, without the need for external [[arbitration]], as only the players themselves really know how they value the goods.

The archetypal fair division [[algorithm]] is [[divide and choose]]. It demonstrates that two agents with different tastes can divide a cake such that each of them believes that he got the best piece. The research in fair division can be seen as an extension of this procedure to various more complex settings.

There are many different kinds of fair division problems, depending on the nature of goods to divide, the criteria for fairness, the nature of the players and their preferences, and other criteria for evaluating the quality of the division.

== Things that can be divided ==

Formally, a fair division problem is defined by a set <math>C</math> (often called "the cake") and a group of <math>n</math> players. A division is a partition of <math>C</math> into <math>n</math> disjoint subsets: <math>C = X_1 \sqcup X_2 \sqcup\cdots \sqcup X_n</math>, one subset per player.

The set <math>C</math> can be of various types:
* <math>C</math> may be a finite set of indivisible items, for example: <math>C = \{\text{piano}, \text{car}, \text{apartment}\}</math>, such that each item should be given entirely to a single person.
* <math>C</math> may be an infinite set representing a divisible resource, for example: money, or a cake. Mathematically, a divisible resource is often modeled as a subset of a real space, for example, the section [0,1] may represent a long narrow cake, that has to be cut into parallel pieces. The [[unit disk]] may represent an apple pie.

Additionally, the set to be divided may be:
* homogeneous – such as money, where only the amount matters, or
* heterogeneous – such as a cake that may have different ingredients, different icings, etc.

Finally, it is common to make some assumptions about whether the items to be divided are:
* goods – such as a car or a cake, or
* bads – such as house chores.

Based on these distinctions, several general types of fair division problems have been studied:
* [[Fair item assignment]] – dividing a set of ''indivisible and heterogeneous'' goods.
* Fair resource allocation – dividing a set of ''divisible and homogeneous'' goods. A special case is [[fair division of a single homogeneous resource]].
* [[Fair cake-cutting]] – dividing a ''divisible, heterogeneous good''. A special case is when the cake is a circle; then the problem is called [[fair pie-cutting]].
* Fair [[chore division]] – dividing a ''divisible, heterogeneous bad.''

Combinations and special cases are also common:
* [[housemates problem|Rental harmony]] (aka the housemates problem) – dividing a set of ''indivisible heterogeneous goods'' (e.g., rooms in an apartment), and simultaneously a ''homogeneous divisible bad'' (the rent on the apartment).
* [[Fair river sharing]] – dividing waters flowing in an international river among the countries along its stream.
* [[Fair random assignment]] – dividing lotteries over divisions – is especially common when allocating indivisible goods.

== Definitions of fairness ==

Most of what is normally called a fair division is not considered so by the theory because of the use of [[arbitration]]. This kind of situation happens quite often with mathematical theories named after real life problems. The decisions in the [[Talmud]] on [[entitlement (fair division)|entitlement]] when an estate is [[bankrupt]] reflect the development of complex ideas regarding fairness.<ref>{{cite journal | last1 = Aumann | first1 = Robert J. | last2 = Maschler | first2 = Michael | year = 1985 | title = Game Theoretic Analysis of a bankruptcy Problem from the Talmud | url = http://www.elsevier.com/framework_aboutus/Nobel/Nobel2005/nobel2005pdfs/aum16.pdf | journal = Journal of Economic Theory | volume = 36 | issue = 2 | pages = 195–213 | doi = 10.1016/0022-0531(85)90102-4 | url-status = dead | archive-url = https://web.archive.org/web/20060220022042/http://www.elsevier.com/framework_aboutus/Nobel/Nobel2005/nobel2005pdfs/aum16.pdf | archive-date = 2006-02-20 }}</ref> However, they are the result of legal debates by rabbis rather than divisions according to the valuations of the claimants.

According to the [[subjective theory of value]], there cannot be an objective measure of the value of each item. Therefore, ''objective fairness'' is not possible, as different people may assign different values to each item. Empirical experiments on how people define the concept of fairness have given inconclusive results.<ref>{{Cite journal | last1 = Yaari | first1 = M. E. | last2 = Bar-Hillel | first2 = M. | doi = 10.1007/BF00297056 | title = On dividing justly | journal = Social Choice and Welfare | volume = 1 |page=1 | year = 1984 | s2cid = 153443060 }}</ref>

Therefore, most current research on fairness focuses on concepts of ''subjective fairness''. Each of the <math>n</math> people is assumed to have a personal, subjective ''utility function'' or ''value function'', <math>V_i</math>, which assigns a numerical value to each subset of <math>C</math>. Often the functions are assumed to be normalized, so that every person values the empty set as 0 (<math>V_i (\empty) = 0</math> for all i), and the entire set of items as 1 (<math>V_i (C) = 1</math> for all i) if the items are desirable, and -1 if the items are undesirable. Examples are:
* If <math>C</math> is the set of indivisible items {piano, car, apartment}, then [[Alice and Bob|Alice]] may assign a value of 1/3 to each item, which means that each item is important to her just the same as any other item. [[Alice and Bob|Bob]] may assign the value of 1 to the set {car, apartment}, and the value 0 to all other sets except X; this means that he wants to get only the car and the apartment together; the car alone or the apartment alone, or each of them together with the piano, is worthless to him.
* If <math>C</math> is a long narrow cake (modeled as the interval [0,1]), then, Alice may assign each subset a value proportional to its length, which means that she wants as much cake as possible, regardless of the icings. Bob may assign value only to subsets of [0.4, 0.6], for example, because this part of the cake contains cherries and Bob only cares about cherries.

Based on these subjective value functions, there are a number of widely used criteria for a fair division. Some of these conflict with each other but often they can be combined. The criteria described here are only for when each player is entitled to the same amount:
* A [[proportional division]] means that every player gets at least their due share ''according to their own value function''. For instance if three people divide up a cake, each gets at least a third by their own valuation, i.e. each of the ''n'' people gets a subset of  ''<math>C</math>'' which he values as at least 1/''n'' of the total value:
** <math>V_i(X_i) \ge V_i(C)/n</math> for all i.
* A [[super-proportional division]] is one where each player receives strictly more than 1/''n.'' (Such a division exists only if the players have different valuations.):
** <math>V_i(X_i) > V_i(C)/n</math> for all ''i''.
* An [[envy-free]] division guarantees that no-one will want somebody else's share more than their own, i.e. every person values their own share at least as much as all other shares:
** <math>V_i(X_i) \ge V_i(X_j)</math> for all i and j.
* A [[group-envy-free]] division guarantees that no subset of agents envies another subset of the same size; this is a stronger condition than envy-freeness.
* An [[Equity (economics)|equitable]] division means every player’s valuation of their own slice is equal, i.e. each  receives equal value, or “experiences equal happiness”. This is a difficult aim as players need not be truthful if asked their valuation.
** <math>V_i(X_i) = V_j(X_j)</math> for all i and j.
* An [[exact division]] (aka consensus division) is one where all players agree on the value of each share:
** <math>V_i(X_i) = V_j(X_i)</math> for all i and j.

All the above criteria assume that the participants have equal [[Entitlement (fair division)|entitlements]]. If different participants have different entitlements (e.g., in a partnership where each partner invested a different amount), then the fairness criteria should be adapted accordingly. See [[proportional cake-cutting with different entitlements]].

== Additional requirements ==
In addition to fairness, it is sometimes desired that the division be [[Pareto optimal]], i.e., no other allocation would make someone better off without making someone else worse off. The term efficiency comes from the [[economics]] idea of the [[efficient market]]. A division where one player gets everything is optimal by this definition so on its own this does not guarantee even a fair share. See also [[efficient cake-cutting]] and the [[price of fairness]].

[[File:Berlin Blockade-map.svg|thumb|200px|right|Berlin divided by the [[Potsdam Conference]] ]]

In the real world people sometimes have a very accurate idea of how the other players value the goods and they may care very much about it. The case where they have complete knowledge of each other's valuations can be modeled by [[game theory]]. Partial knowledge is very hard to model. A major part of the practical side of fair division is the devising and study of procedures that work well despite such partial knowledge or small mistakes.

An additional requirement is that the fair division procedure be [[Strategyproofness|strategyproof]], i.e. it should be a dominant strategy for the participants to report their true valuations. This requirement is usually very hard to satisfy, especially in combination with fairness and Pareto-efficiency. As a result, it is often weakened to [[incentive compatibility]], which only requires players to report their true valuations if they behave according to a specified [[solution concept]].

== Procedures ==

A fair division [[Algorithm|procedure]] lists actions to be performed by the players in terms of the visible data and their valuations. A valid procedure is one that guarantees a fair division for every player who acts rationally according to their valuation. Where an action depends on a player's valuation the procedure is describing the [[strategy]] a rational player will follow. A player may act as if a piece had a different value but must be consistent. For instance if a procedure says the first player cuts the cake in two equal parts then the second player chooses a piece, then the first player cannot claim that the second player got more.

What the players do is:
* Agree on their criteria for a fair division
* Select a valid procedure and follow its rules

It is assumed the aim of each player is to maximize the minimum amount they might get, or in other words, to achieve the [[minimax|maximin]].

Procedures can be divided into ''discrete'' vs. ''continuous'' procedures. A discrete procedure would for instance only involve one person at a time cutting or marking a cake. Continuous procedures involve things like one player [[moving-knife procedure|moving a knife]] and the other saying "stop". Another type of continuous procedure involves a person assigning a value to every part of the cake.

For a list of fair division procedures, see [[:Category:Fair division protocols]].

No finite protocol (even if unbounded) can guarantee an envy-free division of a cake among three or more players, if each player is to receive a single connected piece.<ref>{{cite journal |last=Stromquist |first=Walter |date=2008 |title=Envy-free cake divisions cannot be found by finite protocols |url=https://eudml.org/doc/129749 |journal=The Electronic Journal of Combinatorics |volume=15 |access-date=October 26, 2022 |doi=10.37236/735|doi-access=free }}</ref> However, this result applies only to the model presented in that work and not for cases where, for example, a mediator has full information of the players' valuation functions and proposes a division based on this information.<ref>{{cite conference |url=https://link.springer.com/chapter/10.1007/978-3-642-17572-5_3 |title=The Efficiency of Fair Division with Connected Pieces |last1=Aumann |first1=Yonatan |last2=Dombb |first2=Yair |date=2010 |publisher=Springer |book-title=Internet and Network Economics |pages=26–37 |doi=10.1007/978-3-642-17572-5_3 |conference=International Workshop on Internet and Network Economics}}</ref>

== Extensions ==
Recently, the model of fair division has been extended from individual agents to ''families'' (pre-determined groups) of agents. See [[fair division among groups]].

== History ==

According to [[Sol Garfunkel]], the cake-cutting problem had been one of the most important open problems in 20th century mathematics,<ref>Sol Garfunkel. More Equal than Others: Weighted Voting. For All Practical Purposes. COMAP. 1988</ref> when the most important variant of the problem was finally solved with the [[Brams-Taylor procedure]] by [[Steven Brams]] and [[Alan D. Taylor|Alan Taylor]] in 1995.

[[Divide and choose]]'s origins are undocumented. The related activities of [[bargaining]] and [[barter]] are also ancient. [[Negotiation]]s involving more than two people are also quite common, the [[Potsdam Conference]] is a notable recent example.

The theory of fair division dates back only to the end of the second world war. It was devised by a group of [[Poland|Polish]] mathematicians, [[Hugo Steinhaus]], [[Bronisław Knaster]] and [[Stefan Banach]], who used to meet in the [[Scottish Café]] in Lvov (then in Poland). A [[proportional (fair division)]] division for any number of players called 'last-diminisher' was devised in 1944. This was attributed to Banach and Knaster by Steinhaus when he made the problem public for the first time at a meeting of the [[Econometric Society]] in Washington, D.C., on 17 September 1947. At that meeting he also proposed the problem of finding the smallest number of cuts necessary for such divisions.

For the history of envy-free cake-cutting, see
[[Envy-free cake-cutting#Short history|envy-free cake-cutting]].

== In popular culture ==
* The [[17-animal inheritance puzzle]] involves the fair division of 17 camels (or elephants, or horses) into the proportions 1/2, 1/3, and 1/9. It is a popular [[mathematical puzzle]], often claimed to have an ancient origin, but its first documented publication was in 18th-century Iran.<ref>{{cite journal
 | last = Ageron | first = Pierre
 | issue = 1
 | journal = Revue d'histoire des mathématiques
 | language = fr
 | pages = 1–41
 | title = Le partage des dix-sept chameaux et autres arithmétiques attributes à l'immam 'Alî: Mouvance et circulation de récits de la tradition musulmane chiite
 | url = https://ageron.users.lmno.cnrs.fr/17chameaux.pdf
 | volume = 19
 | year = 2013}}; see in particular pp. 13–14.</ref>
* In ''[[Numb3rs]]'' season 3 episode "One Hour", Charlie talks about the cake-cutting problem as applied to the amount of money a kidnapper was demanding.
* [[Hugo Steinhaus]] wrote about a number of variants of fair division in his book ''Mathematical Snapshots''. In his book he says a special three-person version of fair division was devised by G. Krochmainy in Berdechów in 1944 and another by Mrs L Kott.<ref>Mathematical Snapshots. H.Steinhaus. 1950, 1969 {{ISBN|0-19-503267-5}}</ref>
* [[Martin Gardner]] and [[Ian Stewart (mathematician)|Ian Stewart]] have both published books with sections about the problem.<ref>aha! Insight. Martin. Gardner, 1978. {{ISBN|978-0-7167-1017-2}}</ref><ref>How to cut a cake and other mathematical conundrums. Ian Stewart. 2006. {{ISBN|978-0-19-920590-5}}</ref> Martin Gardner introduced the chore division form of the problem. Ian Stewart has popularized the fair division problem with his articles in ''[[Scientific American]]'' and ''[[New Scientist]]''.
* A ''[[Dinosaur Comics]]'' strip is based on the cake-cutting problem.<ref>{{Cite web|url=http://www.qwantz.com/index.php?comic=1345|title=Dinosaur Comics!}}</ref>
* In the Israeli movie [[Saint Clara (film)|Saint Clara]], a Russian immigrant asks an Israeli math teacher, how a circular cake can be divided fairly among 7 people? His answer is to make 3 straight cuts through its middle, making 8 equal pieces. Since there are only 7 people, one piece should be discarded, in the spirit of communism.

== See also ==
* [[Fair division experiments]]
* [[List of unsolved problems in fair division]]
* [[Online fair division]]
* [[Strategic fair division]]
* [[Apportionment (politics)|Apportionment]] and [[mathematics of apportionment]]
*[[Equity (economics)]]
* [[International trade]]
* [[Justice (economics)]]
* [[Knapsack problem]]
* [[Nash bargaining game]]
* [[Pizza theorem]]
* [[Price of fairness]]

== References ==

{{Reflist|2}}

== Text books ==
*{{Cite Young 1995}}
*{{Cite Brams Taylor 1996}}
*{{Cite Robertson Webb 1998}}
* {{Cite Moulin 2004}}
* {{Cite Geometry of Efficient Fair Division}}
* {{Cite Mathematics and Democracy 2008}}

== Survey articles ==

* Vincent P. Crawford (1987). "fair division," ''The [[New Palgrave: A Dictionary of Economics]]'', v. 2, pp.&nbsp;274–75.
* [[Hal R. Varian|Hal Varian]] (1987). "fairness," ''The New Palgrave: A Dictionary of Economics'', v. 2, pp.&nbsp;275–76.
* Bryan Skyrms (1996). ''The Evolution of the Social Contract'' Cambridge University Press. {{ISBN|978-0-521-55583-8}}
* {{cite journal | last1 = Hill | first1 = T.P. | year = 2000 | title = Mathematical devices for getting a fair share | journal = American Scientist | volume = 88 | issue = 4 | pages = 325–331 | doi=10.1511/2000.4.325| bibcode = 2000AmSci..88..325H | s2cid = 221539202 }}
* {{Cite ComSoc Handbook 2016}}, chapters 11–13.
* [https://link.springer.com/chapter/10.1007/978-90-481-9097-3_12 Fair Division] by Christian Klamler – in Handbook of Group Decision and Negotiation pp 183–202.
* [https://link.springer.com/chapter/10.1007/978-3-662-47904-9_7 Cake-Cutting: Fair Division of Divisible Goods] by Claudia Lindner and Jörg Rothe – in Economics and Computation pp 395–491.
* [https://link.springer.com/chapter/10.1007/978-3-662-47904-9_8 Fair division of indivisible goods] by Jérôme Lang and Jörg Rothe – in Economics and Computation pp 493–550.

== External links ==
* [https://web.archive.org/web/20091022113055/http://www.colorado.edu/education/DMP/fair_division.html Fair Division] from the Discrete Mathematics Project at the University of Colorado at Boulder.
* [http://www.cut-the-knot.org/Curriculum/SocialScience/Markers.shtml Fair Division: Method of Markers]
* [http://www.cut-the-knot.org/Curriculum/SocialScience/SealedBids.shtml Fair Division: Method of Sealed Bids]

{{game theory}}

{{DEFAULTSORT:Fair Division}}
[[Category:Fair division| ]]
[[Category:Game theory]]
[[Category:Welfare economics]]