We study the probabilistic distribution of identical successive units. We represent the allocation process as the filling of an urn with balls of different colors (one color per agent). Applications include the scheduling of homogeneous tasks among workers and allocating new workers between...

Indivisible units are produced with increasing marginal costs. Under average cost, each user pays average cost. Under random priority, users are randomly ordered (without bias) and successively offered to buy at the true marginal cost. Both average cost (AC) and random priority (RP)...

A server processes one job per unit of time and randomly schedules the jobs requested by a given set of users; each user may request a different number of jobs. Fair queuing (Shenker 1989) schedules jobs in successive round-robin fashion, where each agent receives one unit in each round until...

We compare the equity and incentive properties of three efficient solutions to a simple problem of cooperative production with binary demands for a homogeneous service, when marginal cost is either monotonically increasing or monotonically decreasing. The solutions are the familiar competitive...

Indivisible units are randomly allocated among agents with a claim/demand on the resources. The available resources fall short of the sum of individual claims. The proportional method distributes units sequentially, and the probability of receiving a unit at any step is proportional to the...