Strategy-proof choice of acts : a preliminary study

We model social choices as acts mapping states of the world to (social) outcomes. A (social choice) rule assigns an act to every profile of subjective expected utility preferences over acts. A rule is strategy-proof if no agent ever has an incentive to misrepresent her beliefs about the world or her valuation of the outcomes; it is ex-post efficient if the act selected at any given preference profile picks a Pareto-efficient outcome in every state of the world. We show that every two-agent ex-post efficient and strategy-proof rule is a top selection: the chosen act picks the most preferred outcome of some (possibly different) agent in every state of the world. The states in which an agent’s top outcome is selected cannot vary with the reported valuations of the outcomes but may change with the reported beliefs. We give a complete characterization of the ex-post efficient and strategy-proof rules in the two-agent, two-state case, and we identify a rich class of such rules in the two-agent case.

Approval voting ion dichotomous preferences

The aim of this paper is to find normative foundations of Approval Voting. In order to show that Approval Voting is the only social choice function that satisfies anonymity, neutrality, strategy-proofness and strict monotonicity we rely on an intermediate result which relates strategy-proofness of a social choice function to the properties of Independence of Irrelevant Alternatives and monotonicity of the corresponding social welfare function. Afterwards we characterize Approval Voting by means of strict symmetry, neutrality and strict monotonicity and relate this result to May's Theorem. Finally, we show that it is possible to substitute the property of strict monotonicity by the one efficiency of in the second characterization.

Efficient priority rules

We study the assignment of indivisible objects with quotas (houses, jobs, or offices) to a set of agents (students, job applicants, or professors). Each agent receives at most one object and monetary compensations are not possible. We characterize efficient priority rules by efficiency, strategy-proofness, and renegotiation-proofness. Such a rule respects an acyclical priority structure and the allocations can be determined using the deferred acceptance algorithm.

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.

On Fixed-Path Rationing Methods.

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.

Probabilistic Assignments of Identical Indivisible Objects and Uniform Probabilistic Rules.

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 no-envy. We also show that in this characterization no-envy cannot be replaced by anonymity. When agents are strictly risk averse von-Neumann-Morgenstern utility maximizers, then we reduce the problem of assigning k identical objects to a problem of allocating the amount k of an infinitely divisible commodity.

Efficient Priority Rules

We study the assignment of indivisible objects with quotas (houses, jobs, or offices) to a set of agents (students, job applicants, or professors). Each agent receives at most one object and monetary compensations are not possible. We characterize efficient priority rules by efficiency, strategy-proofness, and reallocation-consistency. Such a rule respects an acyclical priority structure and the allocations can be determined using the deferred acceptance algorithm.

Consistent House Allocation

In practice we often face the problem of assigning indivisible objects (e.g., schools, housing, jobs, offices) to agents (e.g., students, homeless, workers, professors) when monetary compensations are not possible. We show that a rule that satisfies consistency, strategy-proofness, and efficiency must be an efficient generalized priority rule; i.e. it must adapt to an acyclic priority structure, except -maybe- for up to three agents in each object's priority ordering.

Social Choice: Recent Developments

In the past quarter century, there has been a dramatic shift of focus in social choice theory, with structured sets of alternatives and restricted domains of the sort encountered in economic problems coming to the fore. This article provides an overview of some of the recent contributions to four topics in normative social choice theory in which economic modelling has played a prominent role: Arrovian social choice theory on economic domains, variable-population social choice, strategy-proof social choice, and axiomatic models of resource allocation.

Priorities in the Location of Multiple Public Facilities

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 the class of rules satisfying Pareto-efficiency, object-population monotonicity and sovereignty. Each rule in the class is a priority rule that selects locations according to a predetermined priority ordering among interest groups. We characterize each of the subclasses of priority rules that respectively satisfy anonymity, hiding-proofness and strategy-proofness. In particular, we prove that a priority rule is strategy-proof if and only if it partitions the set of agents into a fixed hierarchy. Alternatively, any such rule can be viewed as a collection of fixed-populations generalized peak-selection median rules (Moulin, 1980), that are linked across populations, in a way that we describe.

Allocation via Deferred-Acceptance under Responsive Priorities

In many economic environments - such as college admissions, student placements at public schools, and university housing allocation - indivisible objects with capacity constraints are assigned to a set of agents when each agent receives at most one object and monetary compensations are not allowed. In these important applications the agent-proposing deferred-acceptance algorithm with responsive priorities (called responsive DA-rule) performs well and economists have successfully implemented responsive DA-rules or slight variants thereof. First, for house allocation problems we characterize the class of responsive DA-rules by a set of basic and intuitive properties, namely, unavailable type invariance, individual rationality, weak non-wastefulness, resource-monotonicity, truncation invariance, and strategy-proofness. We extend this characterization to the full class of allocation problems with capacity constraints by replacing resource- monotonicity with two-agent consistent con ict resolution. An alternative characterization of responsive DA-rules is obtained using unassigned objects invariance, individual rationality, weak non-wastefulness, weak consistency, and strategy-proofness. Various characterizations of the class of "acyclic" responsive DA-rules are obtained by using the properties efficiency, group strategy-proofness, and consistency.

Top trading with fixed tie-breaking in markets with indivisible goods

We study markets with indivisible goods where monetary compensations are not possible. Each individual is endowed with an object and a preference relation over all objects. When preferences are strict, Gale's top trading cycle algorithm finds the unique core allocation. When preferences are not necessarily strict, we use an exogenous profile of tie-breakers to resolve any ties in individuals' preferences and apply Gale's top trading cycle algorithm for the resulting profile of strict preferences. We provide a foundation of these simple extensions of Gale's top trading cycle algorithm from strict preferences to weak preferences. We show that Gale's top trading cycle algorithm with fixed tie-breaking is characterized by individual rationality, strategy-proofness, weak efficiency, non-bossiness, and consistency. Our result supports the common practice in applications to break ties in weak preferences using some fixed exogenous criteria and then to use a 'good and simple' rule for the resulting strict preferences. This reinforces the market-based approach even in the presence of indifferences because always competitive allocations are chosen.

Single-Plateaued Choice

Single-plateaued preferences generalize single-peaked preferences by allowing for multiple best elements. These preferences have played an important role in areas such as voting, strategy-proofness and matching problems. We examine the notion of singleplateauedness in a choice-theoretic setting. Single-plateaued choice is characterized by means of a collinear interval continuity property in the presence of independence of irrelevant alternatives. Further results establish that our notion of single-plateauedness conforms to the motivation underlying the term and we analyze the consequences of alternative continuity properties. The importance of basic assumptions such as closedness and convexity is discussed. Journal of Economic Literature Classification Nos.: D11, D71.

Single-plateaued choice

Single-plateaued preferences generalize single-peaked preferences by allowing for multiple best elements. These preferences have played an important role in areas such as voting, strategy-proofness and matching problems. We examine the notion of single-plateauedness in a choice-theoretic setting. Single-plateaued choice is characterized by means of a collinear interval continuity property in the presence of independence of irrelevant alternatives. Further results establish that our notion of single-plateauedness conforms to the motivation underlying the term and we analyze the consequences of alternative continuity properties. The importance of basic assumptions such as closedness and convexity is discussed. Journal of Economic Literature Classification Nos.: D11, D71.

Single-basined choice

Single-basined preferences generalize single-dipped preferences by allowing for multiple worst elements. These preferences have played an important role in areas such as voting, strategy-proofness and matching problems. We examine the notion of single-basinedness in a choice-theoretic setting. In conjunction with independence of irrelevant alternatives, single-basined choice implies a structure that conforms to the motivation underlying our definition. We also establish the consequenes of requiring single-basined choice correspondences to be upper semicontinuous, and of the revealed preference relation to be Suzumura consistent. Journal of Economic Literature.