The Separability Principle in Economies with Single-Peaked Preferences

We investigate the implications of the “separability principle” for the class of problems allocating an infinitely divisible commodity among a group of agents with single-peaked preferences. The separability principle requires that for two problems with the same population, but possibly different social endowments, in which the preferences of agents may change, if there is a subgroup of agents whose preferences are the same and the total amounts awarded to them are the same, then the amount awarded to each agent in the subgroup should be the same. First, we investigate the logical relations between separability and other axioms. As it turns out, consistency implies separability. Then, we present characterizations of the uniform rule on the basis of separability and also on the basis of other axioms.     

Balanced consistency and balanced cost reduction for sequencing problems

We investigate the implications of balanced consistency and balanced cost reduction in the context of sequencing problems. Balanced consistency requires that the effect on the payoff from the departure of one agent to another agent should be equal between any two agents. On the other hand, balanced cost reduction requires that if one agent leaves a problem, then the total payoffs of the remaining agents should be affected by the amount previously assigned to the leaving agent. We show that the minimal transfer rule is the only rule satisfying efficiency and Pareto indifference together with either one of our two main axioms, balanced consistency and balanced cost reduction.     

Balanced allocation methods for claims problems with indivisibilities

We study claims problems in which a certain amount of indivisible units (of an homogeneous good) has to be distributed among a group of agents, when this amount is not enough to fully satisfy agents’ demands. Our aim is to find solutions fulfilling procedural and fairness properties. To do that, we define the M-down methods, which are the unique robust (composition down and consistency) and fair (balancedness and conditional full compensation) rules. Besides, we also establish the relationship between these M-down methods and the constrained equal awards rule.     

Consistency, dummy and independence of irrelevant strategies for strategic games

The relationships between the consistency (CONS) principle and two other axioms, dummy (DUM) and independence of irrelevant strategies (IIS) for solution concepts on families of strategic form games are studied. If a solution satisfies DUM and IIS, then it also satisfies CONS (Peleg and Tijs 1996). The converse of this proposition is not true: CONS implies neither DUM nor IIS as shown in two simple examples, using the concept of coalition-proof Nash equilibrium. The axiom of weak dummy (WDUM) is introduced. WDUM, along with IIS, implies CONS. Moreover, CONS implies WDUM. Received: 13 August 1998/Accepted: 19 January 1999     

Allocating multiple estates among agents with single-peaked preferences

We consider the problem of allocating multiple social endowments (estates) of a perfectly divisible commodity among a group of agents with single-peaked preferences when each agent’s share can come from at most one estate. We inquire if well-known single-estate rules, such as the Uniform rule, the Proportional rule or the fixed-path rules can be coupled with a matching rule so as to achieve efficiency in the multi-estate level. On the class of problems where all agents have symmetric preferences, any efficient single-estate rule can be extended to an efficient multi-estate rule. If we allow asymmetric preferences however, this is no more the case. For nondictatorial single-estate rules that satisfy efficiency, strategy proofness, consistency, and resource monotonicity, an efficient extension to multiple estates is impossible. A similar impossibility also holds for single-estate rules that satisfy efficiency, peak-only, and a weak fairness property. We would like to express our gratitude to Bhaskar Dutta, Semih Koray, Hervé Moulin, and Yuntong Wang as well as an associate editor and two anonymous referees of this journal for detailed comments and suggestions. We also thank the seminar participants at Bilkent University, Indian Statistical Institute, Bilgi University, University of Warwick, ASSET 2003, and BWED XXVI.     

Smith and Rawls share a room: stability and medians

We consider one-to-one, one-sided matching (roommate) problems in which agents can either be matched as pairs or remain single. We introduce a so-called bi-choice graph for each pair of stable matchings and characterize its structure. Exploiting this structure we obtain as a corollary the “lone wolf” theorem and a decomposability result. The latter result together with transitivity of blocking leads to an elementary proof of the so-called stable median matching theorem, showing how the often incompatible concepts of stability (represented by the political economist Adam Smith) and fairness (represented by the political philosopher John Rawls) can be reconciled for roommate problems. Finally, we extend our results to two-sided matching problems.     

The core of social choice problems with monotone preferences and a feasibility constraint

We consider collective choice with agents possessing strictly monotone, strictly convex and continuous preferences over a compact and convex constraint set contained in ₊^k . If it is non-empty the core will lie on the efficient boundary of the constraint set and any policy not in the core is beaten by some policy on the efficient boundary. It is possible to translate the collective choice problem on this efficient boundary to another social choice problem on a compact and convex subset of ₊^c (c<k) with strictly convex and continuous preferences. In this setting the dimensionality results in Banks (1995) and Saari (1997) apply to the dimensionality of the boundary of the constraint set (which is lower than the dimensionality of the choice space by at least one). If the constraint set is not convex then the translated lower dimensional problem does not necessarily involve strict convexity of preferences but the dimensionality of the problem is still lower. Broadly, the results show that the homogeneity afforded by strict monotonicity of preferences and a compact constraint set makes generic core emptyness slightly less common. One example of the results is that if preferences are strictly monotone and convex on ² then choice on a compact and convex constraint exhibits a version of the median voter theorem.I thank Donald Saari for helpful comments on an earlier version of this paper.     

Consistency and population sensitivity properties in marriage and roommate markets

We consider one-to-one matching markets in which agents can either be matched as pairs or remain single. In these so-called roommate markets agents are consumers and resources at the same time. Klaus (Games Econ Behav 72:172–186, 2011) introduced two new “population sensitivity” properties that capture the effect newcomers have on incumbent agents: competition sensitivity and resource sensitivity. On various roommate market domains (marriage markets, no-odd-rings roommate markets, solvable roommate markets), we characterize the core using either of the population sensitivity properties in addition to weak unanimity and consistency. On the domain of all roommate markets, we obtain two associated impossibility results.     

Markovian assignment rules

We analyze dynamic assignment problems where agents successively receive different objects (positions, offices, etc.). A finite set of n vertically differentiated indivisible objects are assigned to n agents who live n periods. At each period, a new agent enters society, and the oldest agent retires, leaving his object to be reassigned. We define independent assignment rules (where the assignment of an object to an agent is independent of the way other objects are allocated to other agents), efficient assignment rules (where there does not exist another assignment rule with larger expected surplus), and fair assignment rules (where agents experiencing the same circumstances have identical histories in the long run). When agents are homogenous, we characterize efficient, independent and fair rules as generalizations of the seniority rule. When agents draw their types at random, we prove that independence and efficiency are incompatible, and that efficient and fair rules only exist when there are two types of agents. We characterize two simple rules (type-rank and type-seniority) which satisfy both efficiency and fairness criteria in dichotomous settings.     

The C1 topology on the space of smooth preference profiles

This paper defines a fine C ¹-topology for smooth preferences on a “policy space”, W, and shows that the set of convex preference profiles contains open sets in this topology.  It follows that if the dimension(W)≤v(?)−2 (where v(?) is the Nakamura number of the voting rule, ?), then the core of ? cannot be generically empty. For higher dimensions, an “extension” of the voting core, called the heart of ?, is proposed. The heart is a generalization of the “uncovered set”. It is shown to be non-empty and closed in general. On the C ¹-space of convex preference profiles, the heart is Paretian. Moreover, the heart correspondence is lower hemi-continuous and admits a continuous selection. Thus the heart converges to the core when the latter exists. Using this, an aggregator, compatible with ?, can be defined and shown to be continuous on the C ¹-space of smooth convex preference profiles. Received: 3 April 1995/Accepted: 8 April 1998     

Agreement, separability, and other axioms for quasi-linear social choice problems

A quasi-linear social choice problem is concerned with choosing one among a finite set of public projects and determining side payments among agents to cover the cost of the project, assuming each agent has quasi-linear preferences. We first investigate the logical relations between various axioms in this context. They are: agreement, separability, population solidarity, consistency, converse consistency, and population-and-cost solidarity. Also, on the basis of these axioms, we present alternative characterizations of egalitarian solutions; each solution assigns to each agent an equal share of the surplus derived from the public project over some reference utility level, but uses a different method to compute the reference utility level. Received: 18 May 1998/Accepted: 1 July 1999     

Strategy-proofness versus efficiency on restricted domains of exchange economies

 Strategy-proofness has been shown to be a strong property, particularly on large domains of preferences. We therefore examine the existence of strategy-proof and efficient solutions on restricted, 2-person domains of exchange economies. On the class of 2-person exchange economies in which agents have homothetic, strictly convex preferences we show, as Zhou (1991) did for a larger domain, that such a solution is necessarily dictatorial. As this proof requires preferences exhibiting high degrees of complementarity, our search continues to a class of linear preferences. Even on this “small” domain, the same negative result holds. These two results are extended to many superdomains, including Zhou’s. Received: 9 June 1995/Accepted: 8 January 1996     

Reconciling marginalism with egalitarianism: consistency, monotonicity, and implementation of egalitarian Shapley values

One of the main issues in economic allocation problems is the trade-off between marginalism and egalitarianism. In the context of cooperative games this trade-off can be framed as one of choosing to allocate according to the Shapley value or the equal division solution. In this paper we provide three different characterizations of egalitarian Shapley values being convex combinations of the Shapley value and the equal division solution. First, from the perspective of a variable player set, we show that all these solutions satisfy the same reduced game consistency. Second, on a fixed player set, we characterize this class of solutions using monotonicity properties. Finally, towards a strategic foundation, we provide a non-cooperative implementation for these solutions which only differ in the probability of breakdown at a certain stage of the game. These characterizations discover fundamental differences as well as intriguing connections between marginalism and egalitarianism.     

Rationality,external norms,and the epistemic value of menus

Ever since Sen’s criticism of internal consistency properties of choice, there exists a perception that the standard rational choice approach has difficulties in coping with the existence of external norms, or the information a menu of choice might convey to a decision maker. This article provides a brief survey of possible responses to these criticisms of traditional rational choice theory. We review approaches to the internalization of external norms as well as ways to formulate norm-conditional rationalizability. Furthermore, we illustrate how the epistemic value of an opportunity set can be incorporated into rational choice theory.     

Minimal monotonic extensions of scoring rules

Noting the existence of social choice problems over which no scoring rule is Maskin monotonic, we characterize minimal monotonic extensions of scoring rules. We show that the minimal monotonic extension of any scoring rule has a lower and upper bound, which can be expressed in terms of alternatives with scores exceeding a certain critical score. In fact, the minimal monotonic extension of a scoring rule coincides with its lower bound if and only if the scoring rule satisfies a certain weak monotonicity condition (such as the Borda and antiplurality rule). On the other hand, the minimal monotonic extension of a scoring rule approaches its upper bound as its degree of violating weak monotonicity increases, an extreme case of which is the plurality rule with a minimal monotonic extension reaching its upper bound.

---

The minimal overlap rule revisited

This paper provides an analysis of the Minimal Overlap Rule, a solution for bankruptcy problems introduced by O’Neill (1982). We point out that this rule can be understood as a composition of Ibn Ezra’s proposal and the recommendation given by the Constrained Equal Loss Rule. Following an interpretation of bankruptcy problems in terms of TU games, we show that the Minimal Overlap Value is the unique solution for bankruptcy games which satisfies Anonymity and Core Transition Responsiveness.     

Identical preferences lower bound solution and consistency in economies with indivisible goods

We consider the problem of allocating a finite set of indivisible goods and a single infinitely divisible good among a group of agents, and we study a solution, called the Identical Preferences Lower Bound solution, in the presence of consistency properties. This solution is not consistent. We prove that its maximal consistent subsolution is the No-envy solution. Our main result is that the minimal consistent extension of the intersection of the Identical Preferences Lower Bound solution with the Pareto solution is the Pareto solution. This result remains true in the restricted domain when all the indivisible goods are identical, but not when there is a unique indivisible good.This paper was developed during my stay at Rochester University in the summer of 1992. I would like to express my special thanks to Professor William Thomson for all his help and advice. Iam also grateful to my supervisor Luis Corchón, to Koichi Tadenuma and to the anonymous referees for their helpful comments. The remaining errors are my exclusive responsibility. Financial support from the DGCYT under project PB 91-0756 and the Instituto Valenciano de Investigaciones Económicas are gratefully acknowledged.     

Linear cost sharing in economies with non-Samuelsonian public goods: Core equivalence

 We consider an economy with non-Samuelsonian public goods and we focus on linear cost sharing. In a linear cost sharing equilibrium all agents in the economy optimize given a certain fixed cost share to be contributed towards the provision of public goods in the economy. Hence, each agent pays a certain fraction of the total establishment costs of public goods and these cost shares are common knowledge. We show that for a certain fixed contribution scheme the resulting linear cost share equilibria are equivalent to corresponding core allocations, in which the core is based on the integral of the individual cost shares. We also show that there is no equivalence of the Foley core with cost share equilibria, even in well-behaved large economies. Received: 16 August 1995/Accepted: 29 July 1996     

Solidarity in choosing a location on a cycle

We study the implications of two solidarity conditions on the efficient location of a public good on a cycle, when agents have single-peaked, symmetric preferences. Both conditions require that when circumstances change, the agents not responsible for the change should all be affected in the same direction: either they all gain or they all loose. The first condition, population-monotonicity, applies to arrival or departure of one agent. The second, replacement-domination, applies to changes in the preferences of one agent. Unfortunately, no Pareto-efficient solution satisfies any of these properties. However, if agents’ preferred points are restricted to the vertices of a small regular polygon inscribed in the circle, solutions exist. We characterize them as a class of efficient priority rules.     

Choice rules with fuzzy preferences: Some characterizations

Consider an agent with fuzzy preferences. This agent, however, has to make exact choices when faced with different feasible sets of alternatives. What rule does he follow in making such choices? This paper provides an axiomatic characterization of a class of binary choice rules called the α satisfying rule. When α=1, this rule is the Orlovsky choice rule. On the other hand, for α≤1/2, the rule coincides with the M _α rule that has been extensively analyzed in the literature on fuzzy preferences. Received: 3 August 1995/Accepted: 19 November 1997