Eliciting Preferences to Assign Positions and Compensation

We describe strategy-proof rules for economies where an agent is assigned a position (e.g., a job) plus some of a divisible good. For the 2-agent–2-position case we derive a robust characterization. For the multi-agent–position case, many “arbitrary” such rules exist, so we consider additional requirements. By also requiring coalitional strategy-proofness or nonbossiness, the range of a solution is restricted to the point that such rules are not more complex than those for the Shapley–Scarf housing model (no divisible good). Third, we show that essentially only constant solutions are immune to manipulations involving “bribes.” Finally, we demonstrate a conflict between efficiency and strategy-proofness. The results extend to models (without externalities) in which agents share positions. Journal of Economic Literature Classification Numbers: C72, D70.     

Population-monotonicity and separability for economies with single-dipped preferences and the assignment of an indivisible object

We study two allocation models. In the first model, we consider the problem of allocating an infinitely divisible commodity among agents with single-dipped preferences. In the second model, a degenerate case of the first one, we study the allocation of an indivisible object to a group of agents. We consider rules that satisfy Pareto efficiency, strategy-proofness, and in addition either the consistency property separability or the solidarity property population-monotonicity. We show that the class of rules that satisfy Pareto efficiency, strategy-proofness, and separability equals the class of rules that satisfy Pareto efficiency, strategy-proofness, and non-bossiness. We also provide characterizations of all rules satisfying Pareto efficiency, strategy-proofness, and either separability or population-monotonicity. Since any such rule consists for the largest part of serial-dictatorship components, we can interpret the characterizations as impossibility results. Received: September 29, 1999; revised version: March 22, 2000     

On Fixed-Path Rationing Methods

Moulin (J. Econ. Theory84 (1999), 41-72) 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. Journal of Economics Literature Classification Numbers: D63, D70.     

Efficient priority rules

We study the assignment of indivisible objects with quotas (universities, 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 acyclic priority structure and the allocations are determined using the deferred acceptance algorithm.     

The Pareto-dominant strategy-proof and fair rule for problems with indivisible goods

We study the problem of allocating a set of indivisible goods among a set of agents when monetary transfers are not allowed. We consider two interesting cases of this problem: (1) the supply of each object is exactly one; and (2) the supply of an object may be greater than one. Our central requirements are strategy-proofness and ex post fairness. We propose a particular rule satisfying strategy-proofness and no-envy (as well as equal treatment of equals). For the first case, it Pareto dominates any other rule satisfying strategy-proofness and equal treatment of equals. For the second case, it Pareto dominates any other rule satisfying strategy-proofness and no-envy.     

Second price auctions on general preference domains: two characterizations

Auction theory usually assumes the quasi-linearity of individual preferences. We drop this assumption and define an extension of second price mechanisms that applies to general preferences. It turns out that the extended second price mechanisms are the only rules satisfying efficiency, strategy-proofness, and a mild non-imposition property. Their definition is simple just as much as the definition of usual second price mechanisms: everyone reports his maximum willingness to pay and the bidder whose reported value is highest buys the auctioned object for the price equal to the second highest reported value. The characterization is valid if efficiency is replaced by envy-freeness. I gratefully acknowledge an associate editor and two anonymous referees for their very helpful comments. Hiroki Saitoh and Shigehiro Serizawa independently obtain a result that is closely related to my main result (see, Remark in Sect. 1). I thank them for sending me the paper and communication, and Yuji Fujinaka for informing me about their work. I also thank the financial support by KAKENHI (19310031).     

Strategy-proof risk sharing

We consider risk sharing problems with a single good and a finite number of states. Agents have a common prior and their preferences are represented in the expected utility form and are risk averse. We study efficient and individually rational risk sharing rules satisfying strategy-proofness, the requirement that no one can ever benefit by misrepresenting his preference. When aggregate certainty holds, we show that “fixed price selections” from Walrasian correspondence are the only rules satisfying efficiency, individual rationality, and strategy-proofness. However, when aggregate uncertainty holds, we show that there exists no rule satisfying the three requirements. Moreover, in the two agents case, we show that dictatorial rules are the only efficient and strategy-proof rules. Dropping the common prior assumption in the model, we show that this assumption is necessary and sufficient for the existence of rules satisfying the three main requirements in the two agents and aggregate certainty case.     

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. We are grateful to the Editor and an anonymous referee for helpful comments and suggestions. L. Ehlers acknowledges financial support from the SSHRC (Canada)     

Second-best efficiency of allocation rules: strategy-proofness and single-peaked preferences with multiple commodities

We study strategy-proof allocation rules in economies with perfectly divisible multiple commodities and single-peaked preferences. In this setup, it is known that the incompatibility among strategy-proofness, Pareto efficiency and non-dictatorship arises in contrast with the Sprumont (Econometrica 59:509–519, 1991) one commodity model. We first investigate the existence problem of strategy-proof and second-best efficient rules, where a strategy-proof rule is second-best efficient if it is not Pareto-dominated by any other strategy-proof rules. We show that there exists an egalitarian rational (consequently, non-dictatorial) strategy-proof rule satisfying second-best efficiency. Second, we give a new characterization of the generalized uniform rule with the second-best efficiency in two-agent case.     

When too little is as good as nothing at all: Rationing a disposable good among satiable people with acceptance thresholds

We study the problem of rationing a divisible good among a group of people. Each person?s preferences are characterized by an ideal amount that he would prefer to receive and a minimum quantity that he will accept: any amount less than this threshold is just as good as receiving nothing at all. Any amount beyond his ideal quantity has no effect on his welfare.We search for Pareto-efficient, strategy-proof, and envy-free rules. The definitions of these axioms carry through from the more commonly studied problem without disposability or acceptance thresholds. However, these are not compatible in the model that we study. We adapt the equal-division lower bound axiom and propose another fairness axiom called awardee-envy-freeness. Unfortunately, these are also incompatible with strategy-proofness. We characterize all of the Pareto-efficient rules that satisfy these two properties. We also characterize all Pareto-efficient, strategy-proof, and non-bossy rules.     

Coalitional Strategy-Proofness in Economies with Single-Dipped Preferences and the Assignment of an Indivisible Object

We study two allocation models. In the first model, we consider the problem of allocating an infinitely divisible commodity among agents with single-dipped preferences. In the second model, a degenerate case of the first one, we study the allocation of an indivisible object to a group of agents. Our main result is the characterization of the class of Pareto optimal and coalitionally strategy-proof allocation rules. Alternatively, this class of rules, which largely consists of serially dictatorial components, can be characterized by Pareto optimality, strategy-proofness, and weak non-bossiness (in terms of welfare). Furthermore, we study properties of fairness such as anonymity and no-envy. Journal of Economic Literature Classification Numbers: D63, D71.     

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 of public facilities to be located. We consider public facilities that do not suffer from congestion and are non-excludable. We characterize 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 the subclasses of priority rules that respectively satisfy anonymity, avoid the no-show paradox, strategy-proofness and population-monotonicity. 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. Any such rule can also be viewed as a collection of generalized peak-selection median rules, that are linked across populations, in a way that we describe.     

Majority Rule in a Stochastic Model of Bargaining

In this paper we consider multilateral stochastic bargaining models with general agreement rules. For n-player games where in each period a player is randomly selected to allocate a stochastic level of surplus and q?n players have to agree on a proposal to induce its acceptance, we characterize the set of stationary subgame perfect equilibrium payoffs and establish their existence. We show that for agreement rules other than the unanimity rule, the equilibrium payoffs need not be unique. Furthermore, even when the equilibrium is unique, it need not be efficient. Journal of Economic Literature Classification Numbers: C73, C78, D70.     

Joint misrepresentation with bribes

We study the problem of assigning objects to buyers. Monetary transfers are allowed. Each buyer’s preference space contains, but is not limited to, the linear additively separable preferences. A rule maps each preference profile to an allocation. We are concerned about the possibility that a group of buyers may engage in the following kind of manipulation: They make side payments internally and then carry out a joint misrepresentation. A rule is strongly group strategy-proof if no group can gain by engaging in such operations. We also consider several other appealing requirements. We find that the posted-price rules are the only one that satisfies non-triviality, non-imposition, envy-freeness, and strong group strategy-proofness.     

An ordinal Shapley value for economic environments

We propose a new solution concept to address the problem of sharing a surplus among the agents generating it. The problem is formulated in the preferences-endowments space. The solution is defined recursively, incorporating notions of consistency and fairness and relying on properties satisfied by the Shapley value for transferable utility (TU) games. We show a solution exists, and call it the ordinal Shapley value (OSV). We characterize the OSV using the notion of coalitional dividends, and furthermore show it is monotone and anonymous.     

A characterization of consistent collective choice rules

We characterize a class of collective choice rules such that collective preference relations are consistent. Consistency is a weakening of transitivity and a strengthening of acyclicity requiring that there be no cycles with at least one strict preference, which excludes the possibility of a “money pump.” The properties of collective choice rules used in our characterization are unrestricted domain, strong Pareto, anonymity and neutrality. If there are at most as many individuals as there are alternatives, the axioms provide an alternative characterization of the Pareto rule. If there are more individuals than alternatives, however, further rules become available.     

On weighted Kalai–Samet solutions for non-transferable utility coalitional form games

We investigate the implications of the axiom of coalitional concavity for non-transferable utility coalitional form games. This axiom says that if the feasible set of some coalition is uncertain whereas the feasible sets of other coalitions are known, then all players in the coalition with the uncertain feasible set should (weakly) benefit from reaching a compromise before the uncertainty is resolved. By imposing this axiom, in addition to other minor axioms, we characterize the weighted Kalai–Samet [Econometrica 53 (1985) 307] solutions: these solutions coincide with the weighted egalitarian solutions on the domain of bargaining problems, and with the weighted Shapley values on the domain of transferable utility coalitional form games.     

On the nature of equilibria in a Downsian model with candidate valence

We analyze mechanisms that are used to allocate dormitory rooms to students at college campuses. Students consist of newcoming freshmen, who do not currently occupy any rooms, and more senior students each of whom occupies a room from the previous year. In addition to the rooms already occupied by the existing tenants, there are vacated rooms by the graduating class. Students have strict preferences over dormitory rooms. Each student shall be assigned a dormitory room in an environment where monetary transfers are not allowed. An existing tenant can move to another room as a result of the assignment. We show that you request my house–I get your turn mechanisms are the only mechanisms that are Pareto-efficient, individually rational, strategy-proof, weakly neutral, and consistent.     

Ordinal efficiency and dominated sets of assignments

Using lotteries is a common tool for allocating indivisible goods. Since obtaining preferences over lotteries is often difficult, real-life mechanisms usually rely on ordinal preferences over deterministic outcomes. Bogomolnaia and Moulin (J. Econom. Theory 19 (2002) 623) show that the outcome of an ex post efficient mechanism may be stochastically dominated. They define a random assignment to be ordinally efficient if and only if it is not stochastically dominated. In this paper we investigate the relation between ex post efficiency and ordinal efficiency. We introduce a new notion of domination defined over sets of assignments and show that a lottery induces an ordinally efficient random assignment if and only if each subset of the full support of the lottery is undominated.     

Coalitional Bayesian Nash implementation in differential information economies

Summary. A mechanism coalitionally implements a social choice set if any outcome of the social choice set can be achieved as a coalitional Bayesian Nash equilibrium of a mechanism and vice versa. We say that a social choice set is coalitionally implementable if there is a mechanism which coalitionally implements it. Our main theorem proves that a social choice set is coalitionally implementable if and only if it is interim individually rational, interim efficient, coalitional B ayesian incentive compatible, and satisfies a coalitional Bayesian monotonicity condition as well as a closure condition. As an application of our main result, we show that the private core and the private Shapley value of an economy with differential information are coalitionally implementable. Received: January 12, 1998; revised version: March 30, 2000