We propose two new axioms of demand responsiveness for additive cost sharing with variable demands. Group Monotonicity requires that if a group of agents increase their demands, not all of them pay less. Solidarity says that if agent i demands more, j should not pay more if k pays less. Both...

We propose two axiomatic theories of cost sharing with the common premise that individual demands are comparable, though perhaps different, commodities, and that agents are responsible for their own demand. Under partial responsibility the agents are not responsible for the asymmetries of the...

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

We introduce a model of bargaining among groups, and characterize a family of solutions using a Consistency axiom and a few other invariance and monotonicity properties. For each solution in the family, there exists some constant alpha = 0 such that the "bargaining power" of a group is...

In a scheduling problem where agents can opt out, we show that the familiar Random Priority (RP) a rule can be improved upon by another mechanism dubbed Probabilistic Serial (PS). Both mechanisms are nonmanipulable in a strong sense, but the latter is Pareto superior to the former and serves a...

Agents partition deterministic outcomes into good or bad. A direct revelation mechanism selects a lottery over outcomes - also interpreted as time-shares. Under such dichotomous preferences, the probability that the lottery outcome be a good one is a canonical utility representation. The...

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

If shortest jobs are served first, splitting a long job into smaller jobs reported under different aliases can reduce the actual wait until completion. If longest jobs are served first, the dual maneuver of merging several jobs under a single reported identity is profitable. Both manipulations...

We consider bilateral matching problems where each person views those on the other side of the market as either acceptable or unacceptable: an acceptable mate is preferred to remaining single, and the latter to an unacceptable mate; all acceptable mates are welfare-wise identical. Using...