Round robin is a procedure for fair item allocation. It can be used to allocate several indivisible items among several people, such that the allocation...
13 KB (1,846 words) - 15:37, 7 August 2024
then do another round in which each agent picks a single object, until all objects are taken; this leads to the round-robin item allocation procedure. This...
7 KB (952 words) - 11:50, 26 March 2023
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
in the league may sign the player. The process is similar to round-robin item allocation. The best-known type of draft is the entry draft, which is used...
95 KB (12,108 words) - 21:00, 26 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
processes on a computer Round-robin item allocation, an algorithm for fairly allocating indivisible objects among people Round-robin (document), a document...
2 KB (259 words) - 07:15, 10 May 2023
the fair item allocation problem, the Nash-optimal rule is no longer PM. In contrast, round-robin item allocation is PM. Moreover, round-robin can be adapted...
6 KB (647 words) - 20:09, 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
ranking of the items. An approximate variant of SD-EF, called SD-EF1 (SD-EF up to one item), can be attained by the round-robin item allocation procedure....
11 KB (1,686 words) - 03:27, 27 May 2025
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 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
approximately fair allocation that satisfies a weak form of efficiency, but not PE. The round-robin procedure returns a complete EF1 allocation with additive...
38 KB (5,471 words) - 23:29, 28 July 2024
Online fair division (redirect from Repeated fair allocation)
setting, it is easy to attain an allocation in which the max-envy is at most 1, for example, by the round-robin item allocation (this condition is called EF1)...
34 KB (4,657 words) - 18:53, 18 May 2025
-democratic 1-out-of-c MMS-fair allocation. These allocations can be found efficiently using a variant of round-robin item allocation, with weighted approval...
22 KB (3,170 words) - 03:51, 10 March 2025
RM in cake-cutting, is not RM in item allocation. In contrast, round-robin item allocation is RM. Moreover, round-robin can be adapted to yield picking...
15 KB (2,198 words) - 13:31, 21 September 2023
List of unsolved problems in fair division (section Open problems in fair allocation of indivisible items)
O(n)} - by either Round-robin or maximum Nash welfare. The lower bound is O ( n ) {\displaystyle O({\sqrt {n}})} .: sec.1.1 An allocation is called EFx ("envy-free...
25 KB (3,593 words) - 14:40, 21 February 2025
Round robin share (RRS): each voter receives at least as much utility as he could attain if the rounds were divided by round-robin item allocation and he...
46 KB (6,376 words) - 23:02, 22 May 2025
and efficiency condition called competitive equilibrium. The round-robin item allocation protocol is a special case of a picking sequence in which the...
8 KB (1,262 words) - 05:39, 27 December 2023
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
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
many institutions use more sophisticated allocation mechanisms. In a draft mechanism (also called round-robin), students take turns in picking courses...
23 KB (2,935 words) - 21:58, 28 July 2024
fair-sharing schemes. Round-robin scheduling Weighted fair queueing Max-min fairness "Dominant Resource Fairness: Fair Allocation of Multiple Resource...
7 KB (1,068 words) - 12:15, 28 May 2025
Fair random assignment (category Fair item allocation)
payments, instead of randomization. Fair item allocation is a setting in which agents may get more than one item. Sortition - random selection of political...
16 KB (2,211 words) - 20:45, 21 February 2024
Hash table (section Robin Hood hashing)
(PSL)—from its "home location" i.e. the bucket to which the item was hashed into.: 12 Although Robin Hood hashing does not change the theoretical search cost...
53 KB (5,966 words) - 16:19, 24 May 2025
Real-time operating system (section Memory allocation)
switches tasks on a regular clocked interrupt, and on events; called round-robin. Time sharing designs switch tasks more often than strictly needed, but...
17 KB (2,344 words) - 07:18, 18 March 2025
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
that most American elections behave effectively like two-round systems, in which the first round chooses two main contenders (of which one of them goes...
75 KB (7,713 words) - 23:22, 25 May 2025
000 immigrants from the United Kingdom. However, the system of land allocations led to the concentration of land in the hands of a small number of affluent...
336 KB (40,311 words) - 12:23, 30 May 2025
number of items to allocate. It is also called the house size. A positive integer n {\displaystyle n} representing the number of agents to which items should...
7 KB (967 words) - 19:01, 26 May 2025
exact number of items that should be given to i {\displaystyle i} . In general, a "fair" apportionment is one in which each allocation a i {\displaystyle...
35 KB (5,366 words) - 18:40, 22 May 2025