Maximal Domain for Strategy-Proof Rules in Allotment Economies

We consider the problem of allocating an amount of a perfectly divisible good among a group of n agents. We study how large a preference domain can be to allow for the existence of strategy-proof, symmetric, and efficient allocation rules when the amount of the good is a variable. This question is qualified by an additional requirement that a domain should include a minimally rich domain. We first characterize the uniform rule (Bennasy, 1982) as the unique strategy-proof, symmetric, and efficient rule on a minimally rich domain when the amount of the good is fixed. Then, exploiting this characterization, we establish the following: There is a unique maximal domain that includes a minimally rich domain and allows for the existence of strategy-proof, symmetric, and efficient rules when the amount of good is a variable. It is the single-plateaued domain.

A Maximal Domain of Preferences for Tops-only Rules in the Division Problem

The division problem consists of allocating an amount M of a perfectly divisible good among a group of n agents. Sprumont (1991) showed that if agents have single-peaked preferences over their shares, the uniform rule is the unique strategy-proof, efficient, and anonymous rule. Ching and Serizawa (1998) extended this result by showing that the set of single-plateaued preferences is the largest domain, for all possible values of M, admitting a rule (the extended uniform rule) satisfying strategy-proofness, efficiency and symmetry. We identify, for each M and n, a maximal domain of preferences under which the extended uniform rule also satisfies the properties of strategy-proofness, efficiency, continuity, and "tops-onlyness". These domains (called weakly single-plateaued) are strictly larger than the set of single-plateaued preferences. However, their intersection, when M varies from zero to infinity, coincides with the set of single-plateaued preferences.Strategy-proofness, single-plateaued preferences

The Strategy-Proof Provision of Public Goods under Congestion and Crowding Preferences

We examine the strategy-proof provision of excludable public goods when agents care not only about the level of provision of a public good, but also the number of consumers. We show that on such domains strategy- proof and efficient social choice functions satisfying an outsider independence condition must be rigid in that they must always assign a fixed number of consumers, regardless of individual desires to participate. The fixed number depends on the attitudes of agents regarding group size - being small when congestion effects dominate (individuals prefer to have fewer other consumers) and large when cost sharing effects dominate (agents prefer to have more consumers). A hierarchical rule selects which consumers participate and a variation of a generalized median rule to selects the level of the public good. Under heterogeneity in agents' views on the optimal number of consumers, strategy-proof, efficient, and outsider independent social choice functions are much more limited and in an important case must be dictatorial.Public Goods, Congestion, Club Goods, Strategy-Proof

Strategy-Proofness and Single-Crossing

This paper analyzes strategy-proof collective choice rules when individuals have single-crossing preferences on a finite and ordered set of social alternatives. It shows that a social choice rule is anonymous, unanimous and strategy-proof on a maximal single-crossing domain if and only if it is an extended median rule with n - 1 fixed ballots located at the end points of the set of alternatives. As a by-product, the paper also proves that strategy-proofness implies the tops-only property. And it offers a strategic foundation for the so called "single-crossing version" of the Median Voter Theorem, by showing that the median ideal point can be implemented in dominant strategies by a direct mechanism in which every individual reveals his true preferences.Strategy-proofness; single-crossing; median voter; positional dictators

Maximal Domains for Strategy-Proof or Maskin Monotonic Choice Rules

Domains of individual preferences for which the well-known impossibility theorems of Gibbard-Satterthwaite and Muller-Satterthwaite do not hold are studied. To comprehend the limitations these results imply for social choice rules, we search for the largest domains that are possible. Here, we restrict the domain of individual prefer ences of precisely one individual. It turns out that, for such domains, the conditions of inseparable pair and of inseparable set yield the only maximal domains on which there exist non-dictatorial, Pareto-efficient and strategy-proof social choice rules. Next, we characterize the maximal domains which allow for Maskin monotone, non-dictatorial and Pareto-efficient social choice rules.mathematical economics;

Single-Crossing, Strategic Voting and the Median Choice Rule

This paper studies the strategic foundations of the Representative Voter Theorem (Rothstein, 1991), also called the "second version" of the Median Voter Theorem. As a by-product, it also considers the existence of non-trivial strategy-proof social choice functions over the domain of single-crossing preference profiles. The main result presented here is that single-crossing preferences constitute a domain restriction on the real line that allows not only majority voting equilibria, but also non-manipulable choice rules. In particular, this is true for the median choice rule, which is found to be strategy-proof and group-strategic-proof not only over the full set of alternatives, but also over every possible policy agenda. The paper also shows the close relation between single-crossing and order-restriction. And it uses this relation together with the strategy-proofness of the median choice rule to prove that the collective outcome predicted by the Representative Voter Theorem can be implemented in dominant strategies through a simple mechanism in which, first, individuals select a representative among themselves, and then the representative voter chooses a policy to be implemented by the planner.Single-crossing; order-restriction; median voter; strategyproofness.

Optimal Voting Rules

We study dominant strategy incentive compatible (DIC) and deterministic mechanisms in a social choice setting with several alternatives. The agents are privately informed about their preferences, and have single-crossing utility functions. Monetary transfers are not feasible. We use an equivalence between deterministic, DIC mechanisms and generalized median voter schemes to construct the constrained-efficient, optimal mechanism for an utilitarian planner. Optimal schemes for other welfare criteria such as, say, a Rawlsian maximin can be analogously obtained

Characterizing Welfare-egalitarian Mechanisms with Solidarity When Valuations are Private Information

In the problem of assigning indivisible goods and monetary transfers, we characterize welfare-egalitarian mechanisms (that are decision-efficient and incentive compatible) with an axiom of solidarity under preference changes and a fair ranking axiom of order preservation. This result is in line with characterizations of egalitarian rules with solidarity in other economic models. We also show that we can replace order-preservation with egalitarian-equivalence or no-envy (on the subadditive domain) and still characterize the welfare-egalitarian class. We show that, in the model we consider, the welfare-egalitarian mechanisms appear to be the best candidates to satisfy several different fairness and solidarity requirements as well as generating bounded deficits.egalitarianism, solidarity, order preservation, egalitarian-equivalence, no-envy, distributive justice, NIMBY problems, imposition of tasks, allocation of indivisible (public) goods and money, the Groves mechanisms, strategy-proofness