A study of proportionality and robustness in economies with a commonly owned technology

Abstract. Studying one-input one-output economies, we say that an allocation is proportional if the input-output ratio is identical among agents and if each agent maximizes her welfare given this ratio. We propose three equity axioms based on this definition, and we use them to compare the main solutions to this simple equity problem. We also combine efficiency, robustness axioms and our proportionality axioms to characterize two solutions. Received: 11 June 1997 / Accepted: 26 May 2000     

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-proof allocation when preferences are single-plateaued

Abstract. We consider private good economies with single-plateaued preferences. A solution selects for each preference profile a non-empty set of allocations. An agent strictly prefers a set of allocations to another set of allocations if and only if he strictly prefers any allocation in the first set to any in the second set according to his single-plateaued preference relation. We characterize the class of sequential-allotment solutions by essentially single-valuedness, Pareto-indifference, and coalitional stragety-proofness. These solutions are the Pareto-indifferent extensions of the solutions studied by Barberà et al. 1997. Received: 9 May 2000 / Accepted: 1 May 2001     

Stable matchings and the small core in Nash equilibrium in the college admissions problem

Both rematching proof and strong equilibrium outcomes are stable with respect to the true preferences in the marriage problem. We show that not all rematching proof or strong equilibrium outcomes are stable in the college admissions problem. But we show that both rematching proof and strong equilibrium outcomes in truncations at the match point are all stable in the college admissions problem. Further, all true stable matchings can be achieved in both rematching proof and strong equilibrium in truncations at the match point. We show that any Nash equilibrium in truncations admits one and only one matching, stable or not. Therefore, the core at a Nash equilibrium in truncations must be small. But examples exist such that the set of stable matchings with respect to a Nash equilibrium may contain more than one matching. Nevertheless, each Nash equilibrium can only admit at most one true stable matching. If, indeed, there is a true stable matching at a Nash equilibrium, then the only possible equilibrium outcome will be the true stable matching, no matter how different are players' equilibrium strategies from the true preferences and how many other unstable matchings are there at that Nash equilibrium. Thus, we show that a necessary and sufficient condition for the stable matching rule to be implemented in a subset of Nash equilibria by the direct revelation game induced by a stable mechanism is that every Nash equilibrium profile in that subset admits one and only one true stable matching. Received: 30 December 1998 / Accepted: 12 October 2001 This paper is a revision of the paper “Manipulation and Stability in a College Admissions Problem” circulated since 1994. I thank Rich McLean, Abraham Neyman, Mark Satterthwaite, Sang-Chul Suh, and Tetsuji Yamada for helpful discussions. I thank the associate editor and the two anonymous referees for their helpful comments that have greatly improved the paper. I am grateful to the Kellogg G.S.M. at the Northwestern University for the hospitality for my visit. Any errors are mine.     

Single-peakedness and coalition-proofness

We prove that multidimensional generalized median voter schemes are coalition-proof. Received: 16 July 1998 / Accepted 23 March 1999     

Solutions for cooperative games with r alternatives

We consider games with n players and r alternatives. In these games each player must choose one and only one alternative, reaching an ordered partition of the set of players. An extension of the Shapley value to this framework is studied. Received: 1 November 1997 / Accepted: 24 January 1999     

The not-so-secret-agent: Professional monitors,hierarchies and implementation

Abstract. It is well-known that, when agents in an organization possess private information that is unverifiable by an outside party, games where agents simply announce their information can have multiple equilibria that may impede the successful implementation of the organization's objectives. We show that the introduction of a professional monitor (e.g. auditor, regulator, supervisor) can help to destroy the “bad' equilibria when agents have private information but have incomplete info rmation about others' information. Received: 21 May 1998 / Accepted: 26 May 2000     

Coalitional manipulations in a bankruptcy problem

In a bankruptcy problem framework we consider rules immune to possible manipulations by the creditors involved in the problem via merging or splitting of their individual claims. The paper provides characterization theorems for the non manipulable rules, the no advantageous merging parametric rules and the no advantageous splitting parametric rules. Received: 24 February 1998 / accepted: 9 March 1999     

Strategyproof multiple assignment using quotas

The allocation of heterogeneous and indivisible objects is considered where there is no medium of exchange. We characterize the set of strategyproof, nonbossy, Pareto-optimal, and neutral social choice functions when preferences are monotonic and quantity-monotonic. The characterized sets of social choice functions are sequential; agents are assigned their favorite objects among the objects not given to others before them, subject to a quota. Received: 5 January 1999 / Accepted: 14 June 1999     

Are serial Condorcet rules strategy-proof?

Abstract. This paper explores the extent to which majority rule is invulnerable to manipulation by individuals and coalitions, even when majority rule is used to select more than one alternative. The resulting rule may or may not be strategy-proof, depending on the size of the coalitions that can form, and on the nature of the individual preferences over sets of alternatives. No individual can manipulate with respect to a wide family of preferences over sets. The only restriction on the domain of true and revealed individual preferences is that the selection rule is always well defined. Received: 1 November 1999 / Accepted: 7 May 2001 We thank two anonymous referees for suggestions that have significantly improved the paper. We are also grateful to l'Université de Caen for sponsoring a Workshop on Social Choice Theory, where a first draft of this paper was presented in May, 1999, and to the workshop participants for helpful observations. Work on the final version of the paper was done while one of the authors was a guest of the Project on Intergenerational Equity supported by the Ministry of Education, Science, and Technology of Japan. We are grateful to the Ministry and to the project leader, Professor Kotaro Suzumura, for their support.     

Sprumont's characterization of the uniform rule when all single-peaked preferences are admissible

Sprumont (1991) has established that the only allocation rule for the division problem that is strategy-proof, efficient, and anonymous is the uniform rule when the domain is the set of all possible profiles of continuous single-peaked preferences. Sprumont's characterization of the uniform rule is shown to hold on any larger domain of single-peaked preferences. Received: 15 December 1998 / Accepted: 12 April 1999     

A characterization of the existenceof optimal dominant strategy mechanisms

This paper provides two theorems which characterize the domains of valuation functions for which there exist Pareto efficient and truth dominant strategy mechanisms (balanced Groves mechanisms). Theorem 1 characterizes the existence of balanced Groves mechanisms for a general class of valuation functions. Theorem 2 provides new balance-permitting domains of valuation functions by reducing the problem of solving partial differential equations to the problem of solving a polynomial function. It shows that a balanced Groves mechanism exists if and only if each valuation function in the family under consideration can be obtained by solving a polynomial function with order less than , where n is the number of individuals. Received: 5 January 1997 / Accepted: 25 May 1999     

A social choice function implementable via backward induction with values in the ultimate uncovered set

We prove the existence of a social choice function implementable via backward induction which always selects within the ultimate uncovered set. Whereas the uncovered set is the set of maximal elements of the covering relation, the ultimate uncovered set is the set obtained by iterative application of this covering operation. Dutta and Sen (1993) showed that any social choice function which is the solution of a generalized binary voting procedure is implementable via backward induction. Our result follows from Dutta and Sen's theorem, in that we construct a binary voting procedure always selecting within the ultimate uncovered set. We use the classical multistage elimination procedure, which always selects an alternative within the uncovered set. When this procedure is also used to select among all of the possible agendas or orderings of alternatives within the procedure, the alternative selected (from the agenda selected) will be within the uncovered set of the uncovered set. Our result follows from repeated application of this construction. Intuitively, the procedure constructed consists of requiring agents to vote on how they should vote and so on. Received: 7 April 1997 / Accepted: 15 October 1998     

Hedonic estimation of housing demand elasticity with a markup over marginal costs

We show that recent developments in hedonic pricing theory allow modeling of the equilibrium pricing function as the marginal cost of an additional housing unit plus a markup that varies inversely with the elasticity of demand. Useful information about demand elasticity at a given point on the envelope function can be recovered from the hedonic regression and limited information on marginal costs. In particular, the elasticity of the envelope with respect to any characteristic such as interior area provides information on the elasticity of demand. Relative price elasticities (i.e., elasticities that vary from a base value in a known way with interior area, unit type or neighborhood characteristics) can be computed from the elasticity of the hedonic envelope. Like Yinger (2010), our method is based on a single hedonic equation.We test our method using sales of new high rise condominiums in two districts within Shenzhen, China: Futian and Longgang. The results strongly confirm the main hypothesis of this paper: price elasticity with respect to size is increasing for more complex types of units. Together with estimates of marginal costs of production, these results imply that relative demand elasticity is declining for larger, more complex units.     

Arbitrage, equilibrium, and gains from trade: A counterexample

We present a counterexample to a theorem due to Chichilnisky (Bulletin of the American Mathematical Society, 1993, 29, 189–207; American Economic Review, 1994, 84, 427–434). Chichilnisky's theorem states that her condition of limited arbitrage is necessary and sufficient for the existence of an equilibrium in an economy with unbounded short sales. Our counterexample shows that the condition defined by Chichilnisky is not sufficient for existence of equilibrium. We also discuss difficulties in Chichilnisky (Economic Theory, 1995, 5, 79–107).     

Who else is bidding? The Pareto optimality of disclosing bidder identities

This paper examines whether the seller of an object should reveal the identities of the participating bidders before bids become due. It is shown that when bidders experience identity dependent externalities and auction participation is exogenous, then for a large class of standard auction mechanisms, a policy of revelation serves to realize a higher surplus because it improves the accuracy of each bidder's estimate of her ex-post willingness-to-pay, and therefore changes the auction allocation in a more ex-post efficient manner. Furthermore, it is shown that the policy of revelation increases both the expected seller revenues as well as ex-ante expected bidder payoffs. Received: 4 February 2000 / Accepted: 15 November 2000 An earlier version of this paper had the title 'Disclosure of Bidder Identities'. I thank an anonymous referee and an Associate Editor for suggestions that improved the paper. I also acknowledge comments made by participants of the Auctions session during the North American Winter Meetings of the Econometric Society 2001 held in New Orleans. I remain solely responsible for any errors.     

Managerial costs for one-shot decentralized information processing

Radner (1993) proposed a model of decentralized associative computation as a means to understand information processing in organizations. In the model, in which an organization processes a single cohort of data, resources are measured by the number of managers. This paper (i) explains why resources should instead be measured by the time the managers are busy, (ii) shows that, nevertheless, the characterization of sufficient conditions for efficient networks in Radner (1993) and Keren and Levhari (1979) is valid for either measure, (iii) shows that measuring resources by the number of operations leads to sharper results on necessary conditions for efficiency, (iv) strengthens Radner's results on the irregularity of efficient hierarchies, and (v) compares the relative costs of parallelization under the two measures. Received: 28 February 1997 / Accepted: 30 September 1997