Abstract Arrowian aggregation

In a general framework of abstract binary aggregation, we characterize aggregation problems in terms of the monotone Arrowian aggregators they admit. Specifically, we characterize the problems that admit non-dictatorial, locally non-dictatorial, anonymous, and neutral monotone Arrowian aggregation, respectively. As a consequence of these characterizations, we also obtain new results on the possibility of strategy-proof social choice and the “concrete Arrowian” aggregation of preferences into a social ordering on generalized single-peaked domains.     

On strategy-proofness and symmetric single-peakedness

We characterize the class of strategy-proof social choice functions on the domain of symmetric single-peaked preferences. This class is strictly larger than the set of generalized median voter schemes (the class of strategy-proof and tops-only social choice functions on the domain of single-peaked preferences characterized by Moulin, 1980) since, under the domain of symmetric single-peaked preferences, generalized median voter schemes can be disturbed by discontinuity points and remain strategy-proof on the smaller domain. Our result identifies the specific nature of these discontinuities which allow to design non-onto social choice functions to deal with feasibility constraints.     

Random dictatorship domains

A domain of preference orderings is a random dictatorship domain if every strategy-proof random social choice function satisfying unanimity defined on the domain is a random dictatorship. Gibbard (1977) showed that the universal domain is a random dictatorship domain. We ask whether an arbitrary dictatorial domain is a random dictatorship domain and show that the answer is negative by constructing dictatorial domains that admit anonymous, unanimous, strategy-proof random social choice functions which are not random dictatorships. Our result applies to the constrained voting model. Lastly, we show that substantial strengthenings of linked domains (a class of dictatorial domains introduced in Aswal et al., 2003) are needed to restore random dictatorship and such strengthenings are “almost necessary”.     

Voluntary formation of communities for the provision of public projects

In this paper we examine a group formation problem, where heterogeneous individuals partitioned themselves into communities, each choosing its own public project from the given space of feasible projects. The model is that of “horizontal product differentiation” where individuals display distinct preferences over the policy space. We consider the notion of “efficient” configuration that minimizes the total project-related costs and aggregate personalized costs of all individuals, and “sustainable” configurations, those are immune against breakaways by subgroups of individuals. Our main result is that, with a unidimensional project space and single-peaked personalized costs, every efficient partition is sustainable.     

An extreme point characterization of random strategy-proof social choice functions: The two alternative case

We show that every strategy-proof random social choice function is a convex combination of strategy-proof deterministic social choice functions in a two-alternative voting model. This completely characterizes all strategy-proof random social choice functions in this setting.     

Are incentives against economic justice?

We consider the problem of fairly allocating a social endowment of indivisible goods and money when the domain of admissible preferences contains, but is not restricted to, quasi-linear preferences. We analyze the manipulability of the Generalized Money Rawlsian Fair (GMRF) solutions. (i) We show that the Nash and strong Nash equilibrium correspondences of the “preference revelation game form” associated with each GMRF solution coincide with the no-envy solution (in equilibrium, efficiency is preserved according to agents' true preferences). (ii) A corollary is that the GMRF solutions “naturally implement” the no-envy solution in Nash and strong Nash equilibria.     

The veil of public ignorance

A theory of cooperative choice under incomplete information is developed in which agents possess private information at the time of contracting and have agreed on a utilitarian “standard of evaluation” governing choices under complete information. The task is to extend this standard to situations of incomplete information. Our first main result generalizes Harsanyi's (J. Polit. Econ. 63 (1955) 309) classical result to situations of incomplete information, assuming that group preferences satisfy Bayesian Coherence and Interim Pareto Dominance. These axioms are mutually compatible if and only if a common prior exists. We argue that this result partly resolves the impossibility of Bayesian preference aggregation under complete information.     

Voting by committees under constraints

We consider social choice problems where a society must choose a subset from a set of objects. Specifically, we characterize the families of strategy-proof voting procedures when not all possible subsets of objects are feasible, and voters’ preferences are separable or additively representable.     

Arrow's Possibility Theorem for one-dimensional single-peaked preferences

In one-dimensional environments with single-peaked preferences we consider social welfare functions satisfying Arrow's requirements, i.e. weak Pareto and independence of irrelevant alternatives. When the policy space is a one-dimensional continuum such a welfare function is determined by a collection of 2^N strictly quasi-concave preferences and a tie-breaking rule. As a corollary we obtain that when the number of voters is odd, simple majority voting is transitive if and only if each voter's preference is strictly quasi-concave.     

Nash implementation with partially honest individuals

We investigate the problem of Nash implementation in the presence of “partially honest” individuals. A partially honest player is one who has a strict preference for revealing the true state over lying when truthtelling does not lead to a worse outcome than that which obtains when lying. We show that when there are at least three individuals, all social choice correspondences satisfying No Veto Power can be implemented. If all individuals are partially honest and if the domain is separable, then all social choice functions can be implemented in strictly dominant strategies by a mechanism which does not use “integer/modulo games”. We also provide necessary and sufficient conditions for implementation in the two-person case, and describe some implications of these characterization conditions.     

多维条件下的单峰定理研究

对著名经济学家邓肯·布莱克的单峰定理进行深入研究,一维条件下,个体为单峰偏好可以解决＂投票悖论＂。将单峰偏好分析从一维条件扩展到二维条件直至N维条件,探讨N维条件下单峰定理是否适用。     

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.     

Cognitive constraints, contraction consistency, and the satisficing criterion

A theory of decision making is proposed that offers an axiomatic basis for the notion of “satisficing” postulated by Herbert Simon. The theory relaxes the standard assumption that the decision maker always fully perceives his preferences among the available alternatives, requiring instead that his ability to perceive any given preference be decreasing with respect to the complexity of the choice problem at hand. When complexity is aligned with set inclusion, this exercise is shown to be equivalent to abandoning the contraction consistency axiom of classical choice theory.     

Individual versus group strategy-proofness: When do they coincide?

A social choice function is group strategy-proof on a domain if no group of agents can manipulate its final outcome to their own benefit by declaring false preferences on that domain. There are a number of economically significant domains where interesting rules satisfying individual strategy-proofness can be defined, and for some of them, all these rules turn out to also satisfy the stronger requirement of group strategy-proofness. We provide conditions on domains guaranteeing that for all rules defined on them, individual and group strategy-proofness become equivalent. We also provide a partial answer regarding the necessity of our conditions.     

Efficient strategy-proof exchange and minimum consumption guarantees

For exchange economies with classical economic preferences, it is shown that any strategy-proof social choice function that selects Pareto optimal outcomes cannot guarantee everyone a consumption bundle bounded away from the origin. This result demonstrates that there is a fundamental conflict between efficiency and distributional goals in exchange economies if the social choice rule is required to be strategy-proof.     

Maximal Domain of Preferences in the Division Problem

The division problem consists of allocating an amount of a perfectly divisible good among a group of n agents. Sprumont (1991) showed that if agents have single-peaked preferences over their shares, then the uniform allocation rule is the unique strategy-proof, efficient, and anonymous rule. We identify the maximal set of preferences, containing the set of single-peaked preferences, under which there exists at least one rule satisfying the properties of strategy-proofness, efficiency, and strong symmetry. In addition, we show that our characterization implies a slightly weaker version of Ching and Serizawa's (1998) result. Journal of Economic Literature Classification Numbers: D71, D78, D63.     

Redistributive policies with heterogeneous social preferences of voters

There is growing evidence on the roles of fairness and other-regarding preferences as fundamental human motives. Call voters with fair preferences, as in Fehr and Schmidt (1999), fair-voters. By contrast, traditional political economy models are based on selfish-voters who derive utility solely from “own” payoff. In a general equilibrium model with endogenous labor supply, a mixture of fair and selfish voters choose optimal policy through majority voting. First, we show that majority voting produces a unique winner in pairwise contests over feasible policies (the Condorcet winner). Second, we show that a preference for greater fairness leads to greater redistribution. An increase in the number of fair voters can also lead to greater redistribution. Third, we show that in economies where the majority are selfish-voters, the decisive policy could be chosen by fair-voters, and vice versa. Fourth, while choosing labor supply, even fair voters behave exactly like selfish voters. We show how this apparently inconsistent behavior in different domains (voting and labor supply) can be rationalized within the model.     

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.     

Strategy-proof and individually rational social choice functions for public good economies

Summary This note is to inform about a mistake in my paper (Serizawa, 1996). In that paper, I characterized strategy-proof, individually rational, budget-balancing, non-exploitative and non-bossy social choice functions for economies with one public good and one private good. I established as Theorem 3 (page 507) that a social choice function is strategy-proof, individually rational with respect to endowment, budget-balancing, non-exploitative and non-bossy if and only if it is a scheme of semi-convex cost sharing determined by the minimum demand principle. I also exposed one example (Example 2, page 507) in order to emphasize that non-bossiness is indispensable for this characterization. I claimed that the social choice function in that example satisfies the above axioms except for non-bossiness, and is not a scheme of semi-convex cost sharing. However, the social choice function in the example is actually not strategy-proof, as shown in the simple discussion below. Therefore it is an open question whether or not a similar characterization theorem holds without non-bossiness.I thank Professor Rajat Deb, who kindly pointed out my mistake.     

Bribe-proof rules in the division problem

The division problem consists of allocating an amount of a perfectly divisible good among a group of n agents with single-peaked preferences. A rule maps preference profiles into n shares of the amount to be allocated. A rule is bribe-proof if no group of agents can compensate one of its subgroups to misrepresent their preferences and, after an appropriate redistribution of their shares, each obtains a weakly preferred share and all agents in the misrepresenting subgroup obtain a strictly preferred share. We characterize all bribe-proof rules as the class of Pareto efficient, strategy-proof, and weakly replacement monotonic rules. This class is larger than the set of sequential allotment rules identified in Barberà et al. [Barberà, S., Jackson, M., Neme, A., 1997. Strategy-proof allotment rules. Games Econ. Behav. 18, 1–21].