divorce settlements no relation game theory
Fair division is the problem in game theory of dividing a set of resources among several people who have an 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 dissolutions, divorce settlements, electronic frequency allocation, airport traffic management, and exploitation of Earth observation satellites. It is an active research area in mathematics, economics (especially social choice theory), dispute resolution, etc. The central tenet of fair division is that such a division should be performed by the players themselves, maybe using a mediator but certainly not an arbiter as only the players 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.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.
no relation