• 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...
    47 KB (6,590 words) - 00:16, 29 July 2024
  • procedure for fair item allocation. It can be used to allocate several indivisible items among several people, such that the allocation is "almost" envy-free:...
    13 KB (1,846 words) - 15:37, 7 August 2024
  • Fair allocation of items and money is a class of fair item allocation problems in which, during the allocation process, it is possible to give or take...
    28 KB (3,957 words) - 12:12, 12 April 2024
  • goals are Pareto efficiency and fairness. Since the objects are indivisible, there may not exist any fair allocation. For example, when there is a single...
    38 KB (5,471 words) - 23:29, 28 July 2024
  • treated by them. In the more complex setting of fair item allocation, there are multiple different items with possibly different values to different people...
    16 KB (2,059 words) - 04:24, 7 August 2024
  • Egalitarian item allocation, also called max-min item allocation is a fair item allocation problem, in which the fairness criterion follows the egalitarian...
    21 KB (2,870 words) - 11:23, 5 June 2024
  • Envy-free (EF) item allocation is a fair item allocation problem, in which the fairness criterion is envy-freeness - each agent should receive a bundle...
    28 KB (3,732 words) - 07:39, 16 July 2024
  • Proportional item allocation is a fair item allocation problem, in which the fairness criterion is proportionality - each agent should receive a bundle...
    13 KB (1,965 words) - 12:13, 12 August 2024
  • fairness is attained using monetary payments, instead of randomization. Fair item allocation is a setting in which agents may get more than one item....
    16 KB (2,211 words) - 20:45, 21 February 2024
  • Population monotonicity (category Fairness criteria)
    endowments. In the fair item allocation problem, the Nash-optimal rule is no longer PM. In contrast, round-robin item allocation is PM. Moreover, round-robin...
    5 KB (647 words) - 05:25, 16 August 2024
  • Thumbnail for Fair cake-cutting
    representation). Fair item allocation – a similar problem in which the items to divide are indivisible Steinhaus, Hugo (1949). "The problem of fair division"...
    28 KB (4,016 words) - 07:46, 30 March 2024
  • houses. Fair item allocation - each agent may get any number of objects. Abdulkadiroğlu, Atila; Sönmez, Tayfun (1999-10-01). "House Allocation with Existing...
    13 KB (1,778 words) - 03:10, 6 July 2024
  • Thumbnail for 17-animal inheritance puzzle
    17-animal inheritance puzzle (category Fair item allocation)
    inheritance puzzle is a mathematical puzzle involving unequal but fair allocation of indivisible goods, usually stated in terms of inheritance of a number...
    19 KB (2,038 words) - 20:22, 16 August 2024
  • to the setting in which the users' demands are indivisible (as in fair item allocation). For the indivisible setting, they relax envy-freeness to EF1. They...
    7 KB (1,068 words) - 21:30, 14 March 2024
  • strengthening of Pareto efficiency in the context of fair item allocation. An allocation of indivisible items is fractionally Pareto-efficient (fPE or fPO) if...
    37 KB (5,035 words) - 06:47, 22 August 2024
  • Course allocation is the problem of allocating seats in university courses among students. Many universities impose an upper bound on the number of students...
    23 KB (2,935 words) - 21:58, 28 July 2024
  • objects are taken; this leads to the round-robin item allocation procedure. This procedure is fairer, but it is not strategyproof. Both procedures are...
    7 KB (952 words) - 11:50, 26 March 2023
  • Rental harmony (category Fair item allocation)
    Rental harmony is a kind of a fair division problem in which indivisible items and a fixed monetary cost have to be divided simultaneously. The housemates...
    40 KB (6,082 words) - 02:45, 17 August 2024
  • Maximin share (MMS) is a criterion of fair item allocation. Given a set of items with different values, the 1-out-of-n maximin-share is the maximum value...
    70 KB (11,200 words) - 11:45, 28 August 2024
  • Top trading cycle (category Fair item allocation)
    : 30–31  The basic TTC algorithm is illustrated by the following house allocation problem. There are n {\displaystyle n} students living in the student...
    13 KB (1,741 words) - 17:40, 3 August 2024
  • to construct subsets that satisfy a given criterion of fairness, such as max-min item allocation. When m is variable (a part of the input), both problems...
    10 KB (1,610 words) - 03:24, 12 June 2023
  • least a given threshold. In the fair indivisible chore allocation problem (a variant of fair item allocation), the items represent chores, and there are...
    52 KB (6,986 words) - 20:25, 28 July 2024
  • problems have been studied: Fair item assignment – dividing a set of indivisible and heterogeneous goods. Fair resource allocation – dividing a set of divisible...
    19 KB (2,976 words) - 01:57, 8 August 2024
  • included in the plan, showing which items should be sacrificed if total funding must be reduced. Resource allocation may be decided by using computer programs...
    4 KB (523 words) - 12:33, 22 March 2024
  • Thumbnail for White elephant gift exchange
    someone else's gift, even a gift that is out of play.[citation needed] Fair item allocation Secret Santa White elephant sale Other names include Shifty Santa...
    5 KB (600 words) - 09:00, 23 July 2024
  • Group envy-freeness (category Fairness criteria)
    problems such as fair resource allocation, fair cake-cutting and fair item allocation. Group-envy-freeness is a very strong fairness requirement: a group-envy-free...
    7 KB (1,133 words) - 11:56, 24 September 2023
  • the term OXS valuation (not to be confused with XOS valuation). Fair item allocation in this setting was studied by Benabbou, Chakraborty, Elkind, Zick...
    3 KB (439 words) - 02:47, 29 May 2024
  • For example: Revenue-maximizing auctions. Multi-item exchange. Fair cake-cutting and fair item allocation. Combinatorial auctions. Envy-free pricing. As...
    5 KB (551 words) - 17:13, 29 July 2024
  • seats. But the classic fair division problem assumes that items may not be added. An allocation is called EF1 (envy-free up to one item) if, for any two agents...
    25 KB (3,593 words) - 18:10, 23 August 2024
  • partners trying to divide a single valuable item). See also fair item allocation. Consequently, in the price of fairness calculations, the instances in which...
    13 KB (1,805 words) - 18:11, 23 August 2024