When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Moving-knife procedure - Wikipedia

    en.wikipedia.org/wiki/Moving-knife_procedure

    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. [1]

  3. Fair division experiments - Wikipedia

    en.wikipedia.org/wiki/Fair_division_experiments

    Allocating indivisible heirlooms. 1. Flood [1] : case 4 describes a division of a gift containing 5 parcels: whiskey, prunes, eggs, suitcase, etc. The division was done using the Knaster auction. The resulting division was fair, but in retrospect it was found that coalitions could gain from manipulation. 2.

  4. Fair division - Wikipedia

    en.wikipedia.org/wiki/Fair_division

    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 ...

  5. Fair item allocation - Wikipedia

    en.wikipedia.org/wiki/Fair_item_allocation

    Fair item allocation. Fair item allocation is a kind of the fair division problem in which the items to divide are discrete rather than continuous. The items have to be divided among several partners who potentially value them differently, and each item has to be given as a whole to a single person. [1]

  6. Divide and choose - Wikipedia

    en.wikipedia.org/wiki/Divide_and_choose

    Divide and choose (also Cut and choose or I cut, you choose) is a procedure for fair division of a continuous resource, such as a cake, between two parties. It involves a heterogeneous good or resource ("the cake") and two partners who have different preferences over parts of the cake. The protocol proceeds as follows: one person ("the cutter ...

  7. Fair cake-cutting - Wikipedia

    en.wikipedia.org/wiki/Fair_cake-cutting

    Fair cake-cutting. If a cake with a selection of toppings is simply cut into equal slices, different people will receive different amounts of its toppings, and some may not regard this as a fair division of the cake. Fair cake-cutting is a kind of fair division problem. The problem involves a heterogeneous resource, such as a cake with ...

  8. Envy-freeness - Wikipedia

    en.wikipedia.org/wiki/Envy-freeness

    Envy-freeness. Envy-freeness, also known as no-envy, is a criterion for fair division. It says that, when resources are allocated among people with equal rights, each person should receive a share that is, in their eyes, at least as good as the share received by any other agent. In other words, no person should feel envy.

  9. Last diminisher - Wikipedia

    en.wikipedia.org/wiki/Last_diminisher

    The last diminisher procedure is a procedure for fair cake-cutting. It involves a certain heterogenous and divisible resource, such as a birthday cake, and n partners with different preferences over different parts of the cake. It allows the n people to achieve a proportional division, i.e., divide the cake among them such that each person ...