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

processes on a computer Round-robin item allocation, an algorithm for fairly allocating indivisible objects among people Round-robin (document), a document...

Proportional item allocation is a fair item allocation problem, in which the fairness criterion is proportionality - each agent should receive a bundle...

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

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

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

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

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

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

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

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

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

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

and efficiency condition called competitive equilibrium. The round-robin item allocation protocol is a special case of a picking sequence in which the...

approximately fair allocation that satisfies a weak form of efficiency, but not PE. The round-robin procedure returns a complete EF1 allocation with additive...

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

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

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

treated by them. In the more complex setting of fair item allocation, there are multiple different items with possibly different values to different people...

fair-sharing schemes. Round-robin scheduling Weighted fair queueing Max-min fairness "Dominant Resource Fairness: Fair Allocation of Multiple Resource...

switches tasks on a regular clocked interrupt, and on events; called round-robin. Time sharing designs switch tasks more often than strictly needed, but...

many institutions use more sophisticated allocation mechanisms. In a draft mechanism (also called round-robin), students take turns in picking courses...

payments, instead of randomization. Fair item allocation is a setting in which agents may get more than one item. Sortition - random selection of political...

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

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

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

1998 event. The tournament was contested with eight round-robin groups followed by a knockout round for 16 teams. The defending champions were France,...

14 line items; Fires: 18 line items; Ground Maneuver: 24 line items; Aircraft and UASs: 16 line items; AntiArmor and Small Arms: 8 line items; Maritime:...

List scheduling Multi level feedback queue Rate-monotonic scheduling Round-robin scheduling Shortest job next Shortest remaining time Top-nodes algorithm:...

socialists wish to retain the use of supply and demand signals to guide the allocation of capital goods and the means of production. Under such a system, depending...