Many procedures have been suggested for the venerable problem of dividing a set of indivisible items between two players. We propose a new algorithm (AL), related to one proposed by Brams and Taylor (BT), which requires only that the players strictly rank items from best to worst. Unlike BT, in...

Suppose it is possible to make approximate interpersonal comparisons of welfare gains and losses. Thus, if w, x, y, and z are personal psychophysical states (each encoding all ethically relevant information about the physical and mental state of a person), then it sometimes possible to say,...

A cake is a metaphor for a heterogeneous, divisible good, such as land. A perfect division of cake is efficient (also called Pareto-optimal), envy-free, and equitable. We give an example of a cake in which it is impossible to divide it among three players such that these three properties are...

`Relative Utilitarianism' (RU) is a version of classical utilitarianism, where each person's utility function is rescaled to range from zero to one. As a voting system, RU is vulnerable to preference exaggeration by strategic voters. The Groves-Clarke Pivotal Mechanism elicits truthful...

The Clarke Pivotal Voting Mechanism (CPVM) elicits truthful revelation of utility functions by requiring any `pivotal' voter to pay a monetary `Clarke tax'. This neglects wealth effects and gives disproportionate power to rich voters. We propose to replace the `Clarke tax' with a lottery,...

We analyze a class of proportional cake-cutting algorithms that use a minimal number of cuts (n-1 if there are n players) to divide a cake that the players value along one dimension. While these algorithms may not produce an envy-free or efficient allocation--as these terms are used in the...

Some social choice models assume that precise interpersonal comparisons of utility (either ordinal or cardinal) are possible, allowing a rich theory of distributive justice. Other models assume that absolutely no interpersonal comparisons are possible, or even meaningful; hence all...

We propose a procedure for dividing indivisible items between two players in which each player ranks the items from best to worst and has no information about the other player’s ranking. It ensures that each player receives a subset of items that it values more than the other player’s...