Reduction-consistency in collective choice problems

We consider the problem of choosing a subset of a feasible set over which each agent has a strict preference. We propose an invariance property, reduction-consistency, of choice rules and study its implications. The property is a natural expression for the problems of a general principle of consistency having been studied extensively in resource allocation problems. We show that no scoring rule satisfies reduction-consistency, and base a characterization of the top rule on the property. We also investigate the minimal extension of a rule needed to recover reduction-consistency, and identify the minimal extensions of several rules including the Borda and plurality rules.     

A characterization and an impossibility of finite length anonymity for infinite generations

In the context of ranking infinite utility streams, the impartiality axiom of finite length anonymity requires the equal ranking of any two utility streams that are equal up to a finite length permutation ( Fleurbaey and Michel, 2003). We first characterize any finite length permutation as a composition of a fixed step permutation and an “almost” fixed step permutation. We then show that if a binary relation satisfies finite length anonymity, then it violates all the distributional axioms that are based on a segment-wise comparison. Examples of those axioms include the weak Pareto principle and the weak Pigou-Dalton principle.     

Binary effectivity rules

A social choice rule (SCR) is a collection of social choice correspondences, one for each agenda. An effectivity rule is a collection of effectivity functions, one for each agenda. We prove that every monotonic and superadditive effectivity rule is the effectivity rule of some SCR. A SCR is binary if it is rationalized by an acyclic binary relation. The foregoing result motivates our definition of a binary effectivity rule as the effectivity rule of some binary SCR. A binary SCR is regular if it satisfies unanimity, monotonicity, and independence of infeasible alternatives. A binary effectivity rule is regular if it is the effectivity rule of some regular binary SCR. We characterize completely the family of regular binary effectivity rules. Quite surprisingly, intrinsically defined von Neumann–Morgenstern solutions play an important role in this characterization.     

May’s theorem in an infinite setting

We generalize May’s theorem to an infinite setting, preserving the elementary character of the original theorem. We define voting scenarios and generalized voting scenarios, and prove appropriate versions of May’s theorem. The case of generalized voting scenarios specialized to a countably infinite set of voters and the collections of all coalitions that have asymptotic density, shows that majority rule is the only aggregation rule that satisfies neutrality, irrelevance of null coalitions, anonymity, and positive responsiveness.     

On the computability of quasi-transitive binary social choice rules in an infinite society and the halting problem

This paper investigates the computability problem of the existence of a vetoer and an oligarchy for quasi-transitive binary social choice rules (Mas-Colell and Sonnenschein in Rev Econ Stud 39:185–192, 1972) in a society with an infinite number of individuals (infinite society) according to the computable calculus (or computable analysis) by Aberth (Computable analysis, McGraw-Hill, New York, 1980; Computable calculus, Academic Press, Dublin, 2001). We will show the following results. The problem whether a quasi-transitive binary social choice rule which satisfies Pareto principle and independence of irrelevant alternatives (IIA) has a vetoer or has no vetoer in an infinite society is a nonsolvable problem, that is, there exists no ideal computer program for a quasi-transitive binary social choice rule which satisfies Pareto principle and IIA that decides whether it has a vetoer or has no vetoer. And it is equivalent to nonsolvability of the halting problem. We also show that if for any quasi-transitive binary social choice rule there exists an oligarchy in an infinite society, whether it is finite or infinite is a nonsolvable problem. A vetoer is an individual such that if he strictly prefers an alternative to another alternative, then the society prefers the former to the latter or is indifferent between them regardless of the preferences of other individuals, and an oligarchy is the minimal set of individuals which has dictatorial power and its each member is a vetoer. It will be shown that an oligarchy is a set of vetoers if it exists. This research was partially supported by the Ministry of Education, Science, Sports and Culture, Grant-in-Aid for Scientific Research (C), 20530165, and the Grant-in-Aid from the Zengin Foundation for Studies on Economics and Finance in Japan.     

Uniform allocation and reallocation revisited

Thomson (1995a) proved that the uniform allocation rule is the only allocation rule for allocation economies with single-peaked preferences that satisfies Pareto efficiency, no-envy,one-sided population-monotonicity, and replication-invariance on a restricted domain of single-peaked preferences. We prove that this result also holds on the unrestricted domain of single-peaked preferences. Next, replacing one-sided population-monotonicity by one-sided replacement-domination yields another characterization of the uniform allocation rule, Thomson (1997a). We show how this result can be extended to the more general framework of reallocation economies with individual endowments and single-peaked preferences. Following Thomson (1995b) we present allocation and reallocation economies in a unified framework of open economies. Received: 20 February 1999 / Accepted: 15 February 2000     

Strategy-proofness in many-to-one matching problems

We search forstrategy-proof solutions in the context of (many-to-one) matching problems (Gale and Shapley, 1962). In this model, whenever the firms can hire as many workers as they want (the capacities are unlimited) the stable set is a singleton. There exists aPareto efficient, individually rational, andstrategy-proof matching rule if and only if the capacities are unlimited. Furthermore, whenever the capacities unlimited, the matching rule which selects the unique stable matching is the only matching rule that isPareto efficient, individually rational, andstrategy-proof.     

A policy-based rationalization of collective rules: Dimensionality,specialized houses,and decentralized authority

We offer a policy-basis for interpreting, justifying, and designing (3, 3)-political rules, a large class of collective rules analogous to those governing the selection of papers in peer-reviewed journals, where each referee chooses to accept, reject, or invite a resubmission of a paper, and an editor aggregates his own and referees’ opinions into one of these three recommendations. We prove that any such rule is a weighted multicameral rule: a policy is collectively approved at a given level if and only if it is approved by a minimal number of chambers — the dimension of the rule — where each chamber evaluates a different aspect of the policy using a weighted rule, with each evaluator’s weight or authority possibly varying across chambers depending on his area(s) of expertise. These results imply that a given rule is only suitable for evaluating finite-dimensional policies whose dimension corresponds to that of the rule, and they provide a rationale for using different rules to pass different policies even within the same organization. We further introduce the concept of compatibility with a rule and exploit its topological properties to propose a method to construct integer weights corresponding to evaluators’ possible judgments under a given rule, which are more intuitive and easier to interpret for policymakers. Our findings shed light on multicameralism in political institutions and multi-criteria group decision-making in the firm. We provide applications to peer review politics, rating systems, and real-world organizations.     

An equity characterization of second price auctions when preferences may not be quasilinear

In a single item auction model that allows non-quasilinear preferences, we show that an auction rule satisfies weak envy-freeness for equals, strategy-proofness, and nonimposition if and only if it is a (generalized) second price auction. This characterization is established on a wide class of preference domains, including the quasilinear domain, a positive income effect domain, and a negative income effect domain.     

Condorcet meets Bentham

We show that if the statistical distribution of utility functions in a population satisfies a certain condition, then a Condorcet winner will not only exist, but will also maximize the utilitarian social welfare function. We also show that, if people’s utility functions are generated according to certain plausible random processes, then in a large population, this condition will be satisfied with very high probability. Thus, in a large population, the utilitarian outcome will be selected by any Condorcet consistent voting rule.     

Parametric continuity in dynamic programming problems

We examine conditions under which the solutions to parametric families of dynamic programming problems are continuous in the parameters. Our main results are that parametric continuity obtains whenever either (a) the family of dynamic programming problems satisfies strong (joint-) continuity properties in the parameter and state or (b) if it satisfies weaker (separate-) continuity requirements, provided these are supplemented by either stronger assumptions on the transition probabilities or by monotonicity restrictions such as are common in economic modelling. The usefulness of our results is illustrated by applying them to some commonly used dynamic economic models.     

A topological approach to Wilson’s impossibility theorem

We will present a topological approach to Wilson’s impossibility theorem [Wilson, R.B., 1972. Social choice theory without the Pareto principle. Journal of Economic Theory 5, 478–486] that there exists no non-null binary social choice rule which satisfies transitivity, independence of irrelevant alternatives, non-imposition and has no dictator nor inverse dictator. Our research is in line with the studies of topological approaches to discrete social choice problems initiated by [Baryshnikov, Y., 1993. Unifying impossibility theorems: a topological approach. Advances in Applied Mathematics 14, 404–415]. This paper extends the result about the Arrow impossibility theorem shown in [Tanaka, Y., 2006. A topological approach to the Arrow impossibility theorem when individual preferences are weak orders. Applied Mathematics and Computation 174, 961–981] to Wilson’s theorem.     

A non-cooperative approach to the ordinal Shapley–Shubik rule

In bargaining problems, a rule satisfies ordinal invariance if it does not depend on order-preserving transformations of the agents’ utilities. In this paper, a non-cooperative game for three agents, based on bilateral offers, is presented. The ordinal Shapley–Shubik rule arises in subgame perfect equilibrium as the agents have more time to reach an agreement.     

Nash bargaining in ordinal environments

We analyze the implications of Nash’s (Econometrica 18:155–162, 1950) axioms in ordinal bargaining environments; there, the scale invariance axiom needs to be strenghtened to take into account all order-preserving transformations of the agents’ utilities. This axiom, called ordinal invariance, is a very demanding one. For two-agents, it is violated by every strongly individually rational bargaining rule. In general, no ordinally invariant bargaining rule satisfies the other three axioms of Nash. Parallel to Roth (J Econ Theory 16:247–251, 1977), we introduce a weaker independence of irrelevant alternatives (IIA) axiom that we argue is better suited for ordinally invariant bargaining rules. We show that the three-agent Shapley–Shubik bargaining rule uniquely satisfies ordinal invariance, Pareto optimality, symmetry, and this weaker IIA axiom. We also analyze the implications of other independence axioms.     

The modified golden rule of a multi-sector economy

We consider an n-good model of optimal accumulation determined by a technology, a utility function, and a discount factor. A technology is δ-productive if it contains an input-output pair such that the discounted output vector strictly dominates the input vector. We show that a δ-productive technology has a non-trivial modified golden rule. We also report a counter- example of David Starrett showing that the modified golden rule need not have turnpike properties, and that there may exist non-trivial periodic optimal consumption plans even when there is no non-trivial modified golden rule.     

On the generalized principal-agent problem: Decomposition and existence results

This paper addresses the class of generalized agency problems: situations in which adverse selection and moral hazard are jointly present. We present a decomposition of the principal's optimization problem under the first-order approach that sheds light on the interactions between the two types of private information, and also significantly improves tractability. We use the decomposition to (1) provide examples of closed form solutions of the optimal contract, and (2) analyze the existence of optimal contracts. We also show that the first-order approach is valid in generalized agency problems if the production technology satisfies the linear distribution function condition (LDFC) in actions and types. For more general production technologies the Mirrlees-Rogerson sufficient conditions need to be extended to include restrictions on the form of the optimal contract. Received: 11 August 1997 / 26 September 1999     

The Computational Complexity of Rationalizing Behavior

We study the computational complexity of rationalizing choice behavior. We do so by analyzing two polar cases, and a number of intermediate ones. In our most structured case, that is where choice behavior is defined in universal choice domains and satisfies the “weak axiom of revealed preference,” finding the complete preorder rationalizing choice behavior is a simple matter. In the polar case, where no restriction whatsoever is imposed, either on choice behavior or on choice domain, finding a collection of complete preorders that rationalizes behavior turns out to be intractable. We also show that the task of finding the rationalizing complete preorders is equivalent to a graph problem. This allows the search for existing algorithms in the graph theory literature, for the rationalization of choice.     

On stable rules for selecting committees

A voting rule is said to be stable if it always elects a fixed-size subset of candidates such that there is no outside candidate who is majority preferred to any candidate in this set whenever such a set exists. Such a set is called a Weak Condorcet Committee (WCC). Four stable rules have been proposed in the literature. In this paper, we propose two new stable rules. Since nothing is known about the properties of the stable rules, we evaluate all the identified stable rules on the basis of some appealing properties of voting rules. We show that they all satisfy the Pareto criterion and they are not monotonic. More, we show that every stable rule fails the reinforcement requirement.     

A strategic analysis of network reliability

Abstract. We consider a non-cooperative model of information networks where communication is costly and not fully reliable. We examine the nature of Nash networks and efficient networks. We find that if the society is large, and link formation costs are moderate, Nash networks as well as efficient networks will be ‘super-connected’ i.e. every link is redundant in the sense that the network remains connected even after the link is deleted. This contrasts with the properties of a deterministic model of information decay, where Nash networks typically involve unique paths between agents. We also find that if costs are very low or very high, or if links are highly reliable then there is virtually no conflict between efficiency and stability. However, for intermediate values of costs and link reliability, Nash networks may be underconnected relative to the social optimum.     

Secured lower bound, composition up, and minimal rights first for bankruptcy problems

We study the implications of secured lower bound when imposed together with minimal rights first or composition up for the resolution of conflicting claims. We show that the Talmud rule is the only rule satisfying secured lower bound, minimal rights first, and consistency. In addition, we show that if minimal rights first and consistency in the above characterization were replaced with composition up and null claims consistency, respectively, the constrained equal awards rule stands out as the only acceptable rule.