A collective decision problem is described by a set of agents, a profile of single-peaked preferences over the real line and a number k of public facilities to be located. We consider public facilities that do not su¤er from congestion and are non-excludable. We provide a characterization of...

We consider a probabilistic approach to the problem of assigning K indivisible identical objects to a set of agents with single-peaked preferences. Using the ordinal extension of preferences, we characterize the class of uniform probabilistic rules by Pareto efficiency, strategy-proofness, and...

The notion of diversity is an issue that is of relevance in several contexts. This paper provides an axiomatic approach to the measurement of diversity. We characterize two nested classes of ordinal measures of diversity and an important member of these classes.

In this paper, we present graphical and quantitative evidence on the important role played by changes in labor market institutions on the rise in wage inequality in the United States during the 1980s. We show that the decline in the real value of the minimium wage and in the rate of unionization...

We study the problem of locating two public goods for a group of agents with single-peaked preferences over an interval. An alternative specifies a location for each public good. In Miyagawa (1998), each agent consumes only his most preferred public good without rivalry. We extend preferences...

This paper examines several families of population principles in the light of a set of axioms. In addition to the critical level utilitarian, number-sensitive critical-level utilitarian and number-dampened families and their generalized counterparts, we consider the restricted number-dampened...

We consider a probabilistic approach to the problem of assigning k indivisible identical objects to a set of agents with single-peaked preferences. Using the ordinal extension of preferences, we characterize the class of uniform probabilistic rules by Pareto efficiency, strategy-proofness, and...

Moulin (1999) characterizes the fixed-path rationing methods by efficiency, strategy-proofness, consistency, and resource-monotonicity. In this note, we give a straightforward proof of his result.

We study the problem of locating two public Godds for a group of agents with single-peaked preferences over an interval.

Moulin (1999) characterizes the fixed-path rationing methods by efficiency, strategy-proofness, consistency, and resource-monotonicity. In this note, we give a straightforward proof of his result.