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,587 words) - 07:13, 12 May 2025
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
Egalitarian item allocation, also called max-min item allocation is a fair item allocation problem, in which the fairness criterion follows the egalitarian...
22 KB (2,969 words) - 13:37, 23 May 2025
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,976 words) - 19:40, 25 September 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) - 13:54, 23 May 2025
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,729 words) - 07:39, 16 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,058 words) - 06:50, 25 May 2025
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
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
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...
6 KB (647 words) - 20:09, 23 May 2025
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
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
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
Maximin share (redirect from Maximin-share item allocation)
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) - 22:01, 23 May 2025
Fair item allocation – a similar problem in which the items to divide are indivisible Growing the pie Steinhaus, Hugo (1949). "The problem of fair division"...
28 KB (4,016 words) - 15:42, 25 May 2025
Envy-graph procedure (category Fair division protocols)
procedure) is a procedure for fair item allocation. It can be used by several people who want to divide among them several discrete items, such as heirlooms, sweets...
17 KB (3,310 words) - 09:55, 27 May 2025
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,105 words) - 06:34, 2 June 2025
Multiple subset sum (redirect from Fair subset sum problem)
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,613 words) - 22:09, 23 May 2025
Envy-free matching (category Fair item allocation)
the efficiency of envy-free cake-cutting. Envy-free item allocation Rental harmony House allocation problem Segal-Halevi, Erel; Aigner-Horev, Elad (2022)...
4 KB (596 words) - 18:34, 12 March 2025
Envy-free pricing (category Fair division)
is a kind of fair item allocation. There is a single seller that owns some items, and a set of buyers who are interested in these items. The buyers have...
21 KB (2,559 words) - 14:47, 17 March 2025
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
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
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...
14 KB (1,738 words) - 16:29, 23 May 2025
Pareto efficiency (redirect from Efficiency (fair division))
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 (4,982 words) - 04:28, 6 May 2025
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) - 22:45, 23 May 2025
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,024 words) - 18:07, 24 September 2024
Agreeable subset (category Fair item allocation)
Envy-free item allocation Participatory budgeting algorithm Multiwinner elections Consensus halving Fair division among groups - a variant of fair division...
11 KB (1,620 words) - 09:29, 22 July 2024
Equitability (category Fairness criteria)
has also been studied in the context of fair item allocation. With indivisible items, an equitable allocation might not exist, but it can be approximated...
4 KB (403 words) - 21:19, 29 January 2022
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
Decreasing Demand procedure (category Fair division protocols)
The Decreasing Demand procedure is a procedure for fair item allocation. It yields a Pareto-efficient division that maximizes the rank of the agent with...
3 KB (390 words) - 12:01, 28 May 2025