Search results
Results from the WOW.Com Content Network
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 ...
The research in strategic fair division has two main branches. One branch is related to game theory and studies the equilibria in games created by fair division algorithms: The Nash equilibrium of the Dubins-Spanier moving-knife protocol; [2] The Nash equilibrium and subgame-perfect equilibrium of generalized-cut-and-choose protocols; [3]
Steven J. Brams (born November 28, 1940, in Concord, New Hampshire) is an American game theorist and political scientist at the New York University Department of Politics. Brams is best known for using the techniques of game theory, public choice theory, and social choice theory to analyze voting systems and fair division.
In mathematics and especially game theory, the airport problem is a type of fair division problem in which it is decided how to distribute the cost of an airport runway among different players who need runways of different lengths.
In the mathematics of social science, and especially game theory, a moving-knife procedure is a type of solution to the fair division problem. The canonical example is the division of a cake using a knife.
The application of game theory to political science is focused in the overlapping areas of fair division, political economy, public choice, war bargaining, positive political theory, and social choice theory. In each of these areas, researchers have developed game-theoretic models in which the players are often voters, states, special interest ...
Get AOL Mail for FREE! Manage your email like never before with travel, photo & document views. Personalize your inbox with themes & tabs. You've Got Mail!
Fair cake-cutting is a kind of fair division problem. The problem involves a heterogeneous resource, such as a cake with different toppings, that is assumed to be divisible – it is possible to cut arbitrarily small pieces of it without destroying their value.