Coalitional strategy-proofness and fairness

This paper considers the problem of assigning a finite number of indivisible objects, like jobs, houses, positions, etc., to the same number of individuals. There is also a divisible good (money) and the individuals consume money and one object each. The class of fair allocation rules that are strategy-proof in the strong sense that no coalition of individuals can improve the allocation for all of its members, by misrepresenting their preferences, is characterized. It turns out that given a regularity condition, the outcome of a fair and coalitionally strategy-proof allocation rule must maximize the use of money subject to upper quantity bounds determined by the allocation rule. If available money is nonnegative, objects may be jobs and the distribution of money a wage structure. If available money is negative, the formal model may reflect a multi-object auction. In both cases fairness means equilibrium, i.e., that each individual receives a most demanded object. I would like to thank Tommy Andersson, Bo Larsson, Zaifu Yang and the participants of the seminars in Copenhagen and Lund for helpful comments on this paper. I will also thank an anonymous referee for very valuable comments. Financial support from The Jan Wallander and Tom Hedelius Foundation is gratefully acknowledged.     

GAINS FROM TRADE

In a social choice context, we ask whether there exists a rule in which nobody loses under trade liberalization. We consider a resource allocation problem in which the traded commodities vary. We propose an axiom stating that enlarging the set of tradable commodities hurts nobody. We show that if a rule satisfies this axiom, together with an allocative efficiency axiom and an institutional constraint axiom stating that only preferences over tradable commodities matter, gains from trade can be given to only one individual in the first step of liberalization.     

Weak monotonicity and Bayes–Nash incentive compatibility

An allocation rule is called Bayes–Nash incentive compatible, if there exists a payment rule, such that truthful reports of agents' types form a Bayes–Nash equilibrium in the direct revelation mechanism consisting of the allocation rule and the payment rule. This paper provides a characterization of Bayes–Nash incentive compatible allocation rules in social choice settings where agents have multi-dimensional types, quasi-linear utility functions and interdependent valuations. The characterization is derived by constructing complete directed graphs on agents' type spaces with cost of manipulation as lengths of edges. Weak monotonicity of the allocation rule corresponds to the condition that all 2-cycles in these graphs have non-negative length. For the case that type spaces are convex and the valuation for each outcome is a linear function in the agent's type, we show that weak monotonicity of the allocation rule together with an integrability condition is a necessary and sufficient condition for Bayes–Nash incentive compatibility.     

Weak monotonicity and Bayes–Nash incentive compatibility

An allocation rule is called Bayes–Nash incentive compatible, if there exists a payment rule, such that truthful reports of agents' types form a Bayes–Nash equilibrium in the direct revelation mechanism consisting of the allocation rule and the payment rule. This paper provides a characterization of Bayes–Nash incentive compatible allocation rules in social choice settings where agents have multi-dimensional types, quasi-linear utility functions and interdependent valuations. The characterization is derived by constructing complete directed graphs on agents' type spaces with cost of manipulation as lengths of edges. Weak monotonicity of the allocation rule corresponds to the condition that all 2-cycles in these graphs have non-negative length. For the case that type spaces are convex and the valuation for each outcome is a linear function in the agent's type, we show that weak monotonicity of the allocation rule together with an integrability condition is a necessary and sufficient condition for Bayes–Nash incentive compatibility.     

Strategyproof and Nonbossy Multiple Assignments

We consider the allocation of heterogeneous indivisible objects without using monetary transfers. Each agent may be assigned more than one object. We show that an allocation rule is strategyproof, nonbossy, and satisfies citizen sovereignty if and only if it is a sequential dictatorship . In a sequential dictatorship agents are assigned their favorite objects that are still available, according to a sequentially endogenously determined hierarchy of the agents. We also establish that replacing nonbossiness by a stronger criterion restricts the characterized class of allocation rules to serial dictatorships , in which the hierarchy of the agents is fixed a priori.     

Market and non-market mechanisms for the optimal allocation of scarce resources

A number of identical objects is allocated to a set of privately informed agents. Agents have linear utility in money. The designer wants to assign objects to agents that possess specific traits, but the allocation can only be conditioned on the willingness to pay and on observable characteristics. I solve for the optimal mechanism. The choice between market or non-market mechanisms depends on the statistical linkage between characteristics valued by the designer and willingness to pay.     

Optimal sale across venues and auctions with a buy-now option

We characterize the optimal selling mechanism for a seller who faces demand demarcated by a high and a low end and who can access an (online) auction site (by paying an access cost) in addition to using his own store that can be used as a posted price selling venue. We first solve for the optimal mechanism of a direct revelation game in which there is no venue-restriction constraint. We find that the direct optimal mechanism must necessarily incorporate a certain kind of pooling. We then show that even with the venue constraint, the seller can use a two stage indirect mechanism that implements the allocation rule from the optimal direct mechanism, and uses the venues in an optimal fashion. The first stage of the indirect mechanism is a posted price at the store. If the object is not sold, we move to stage two, which involves an auction at the auction site. A feature of this auction is a buy-now option which is essential for implementing the pooling feature of the optimal direct mechanism. We also show that the buy-now option in the optimal mechanism is of a “temporary” variety, and that a “permanent” buy-now option, in contrast, cannot implement the optimal mechanism. Auctions with a temporary buy-now option are in widespread use on eBay. We thank the Associate Editor, George Deltas, for his insightful comments. We also thank seminar participants at the University of Basel and the SAET conference 2007.     

The Dynamic Vickrey Auction

We study the efficient allocation of a single object over a finite time horizon. Buyers arrive randomly over time, are long-lived, and have independent private values. The valuation of a buyer may depend on the time of the allocation in an arbitrary way. We construct an incentive compatible mechanism in which (A) there is a single financial transaction (with the buyer), (B) ex-post participation constraints are fulfilled, (C) there is no positive transfer to any agent and (D) payments are determined online. We exploit that under the efficient allocation rule, there is a unique potential winning period for each buyer. This reduces the multidimensional type to one dimension and the payment of the winner can be defined as the lowest valuation for the potential winning period, with which the buyer would have won the object. In a static model, this payment rule coincides with the payment rule of the Vickrey Auction.     

Voluntary Participation and Provision of Public Goods in Large Finite Economies

We consider a public good provision game with voluntary participation. Agents participating in the game provide a public good and pay the fees according to a mechanism (allocation rule), while nonparticipants can free‐ride on the participants. We examine how the equilibrium public good provision level is affected by enlarging the population of an economy. We introduce a condition for an allocation rule, the asymptotic uniform continuity in replication (AUCR), which requires that small changes in the population must yield only small changes in the public good provision and which is satisfied by many mechanisms. We show that under AUCR, the equilibrium level of the public good converges to zero as the economy is replicated in the sense of Milleron.     

Cardinal Bayesian allocation mechanisms without transfers

In allocating goods with no use of monetary transfers, random allocation mechanisms can be designed in order to elicit information on preference intensities. I study the nontransfer allocation of two ex-ante identical objects under Bayesian incentive compatibility, with symmetric agents and independent private valuations. I find the ex-ante utilitarian-optimal mechanism, in which the probability of receiving a specified object is used as “numeraire” to purchase probability units of the other object. I characterize this mechanism as an appropriate combination of lotteries, auctions and insurance. The latter element ensures that efficient auctions are feasible. If the problem is constrained to guarantee exactly one object per agent, then the optimal mechanism uses no information other than the agents? ordinal preferences.     

Fair welfare maximization

We consider the general problem of finding fair constrained resource allocations. As a criterion for fairness we propose an inequality index, termed “fairness ratio,” the maximization of which produces Lorenz-undominated, Pareto-optimal allocations. The fairness ratio does not depend on the choice of any particular social welfare function, and hence it can be used for an a priori evaluation of any given feasible resource allocation. The fairness ratio for an allocation provides a bound on the discrepancy between this allocation and any other feasible allocation with respect to a large class of social welfare functions. We provide a simple representation of the fairness ratio as well as a general method that can be used to directly determine optimal fair allocations. For general convex environments, we provide a fundamental lower bound for the optimal fairness ratio and show that as the population size increases, the optimal fairness ratio decreases at most logarithmically in what we call the “inhomogeneity” of the problem. Our method yields a unique and “balanced” fair optimum for an important class of problems with linear budget constraints.     

Climate Change and the Stability of Water Allocation Agreements

We analyse agreements on river water allocation between riparian countries. Besides being efficient, water allocation agreements need to be stable in order to be effective in increasing the efficiency of water use. In this paper we assess the stability of water allocation agreements using a game theoretic model. We consider the effects of climate change and the choice of a sharing rule on stability. Our results show that a decrease in mean river flow decreases the stability of an agreement, while an increased variance can have a positive or a negative effect on stability. An agreement where the downstream country is allocated a fixed amount of water has the lowest stability compared to other sharing rules. These results hold for both constant and flexible non-water transfers.     

Fault Tolerant Implementation

In this paper we investigate the implementation problem arising when some of the players are "faulty" in the sense that they fail to act optimally. The planner and the non-faulty players only know that there can be at most  k  faulty players in the population. However, they know neither the identity of the faulty players, their exact number nor how faulty players behave. We define a solution concept which requires a player to optimally respond to the non-faulty players regardless of the identity and actions of the faulty players. We introduce a notion of fault tolerant implementation, which unlike standard notions of full implementation, also requires robustness to deviations from the equilibrium. The main result of this paper establishes that under symmetric information any choice rule that satisfies two properties—  k  -monotonicity and no veto power—can be implemented by a strategic game form if there are at least three players and the number of faulty players is less than     . As an application of our result we present examples of simple mechanisms that implement the constrained Walrasian function and a choice rule for the efficient allocation of an indivisible good.     

The most ordinally egalitarian of random voting rules

Aziz and Stursberg propose an “Egalitarian Simultaneous Reservation” rule (ESR), a generalization of Serial rule, one of the most discussed mechanisms in the random assignment problem, to the more general random social choice domain. This article provides an alternative definition, or characterization, of ESR as the unique most ordinally egalitarian one. Specifically, given a lottery p over alternatives, for each agent i the author considers the total probability share in p of objects from her first k indifference classes. ESR is shown to be the unique one which leximin maximizes the vector of all such shares (calculated for all i, k). Serial rule is known to be characterized by the same property. Thus, the author provides an alternative way to show that ESR, indeed, coincides with Serial rule on the assignment domain. Moreover, since both rules are defined as the unique most ordinally egalitarian ones, the result shows that ESR is “the right way” to think about generalizing Serial rule.     

Government policy and the probability of coordination failures

This paper introduces an approach to the study of optimal government policy in economies characterized by a coordination problem and multiple equilibria. Such models are often criticized as not being useful for policy analysis because they fail to assign a unique prediction to each possible policy choice. We employ a selection mechanism that assigns, ex ante, a probability to each equilibrium indicating how likely it is to obtain. We show how such a mechanism can be derived as the natural result of an adaptive learning process. This approach leads to a well-defined optimal policy problem, and has important implications for the conduct of government policy. We illustrate these implications using a simple model of technology adoption under network externalities.     

On the design of optimal grandfathering schemes for emission allowances

This paper derives optimal schemes for the free allocation of emission allowances in a dynamic context. We consider emissions- and output-based allocation rules which allow for updating of the basis of allocation over time and thereby do not rely on historical data only. We show that such dynamic schemes do not necessarily induce inefficient outcomes. In closed trading systems with an absolute cap on emissions, grandfathering schemes which allocate allowances proportionally to past emissions are first-best. However, in open trading systems where allowances can be traded with outsiders, first-best allocation schemes must not depend on firm-specific decisions while second-best schemes correspond to a Ramsey rule of optimal tax differentiation and are generally based on both past emission and output levels.     

Duality theory for dynamic optimization models of economics: The continuous time case

This paper establishes that the competitive allocation process is the only informationally decentralized mechanism for exchange environments which (i) achieves Pareto optimal allocations; (ii) gives each consumer an allocation which is, according to his preferences, at least as good as his endowment; (iii) satisfies certain regularity conditions; and (iv) has a message space of the smallest dimension necessary to satisfy (i–iii).     

About optimal harvesting policies for a multiple species forest without discounting

We study the optimal harvesting of a mixed forest composed of multiple species, each one having a different maturity age, where only mature trees can be harvested. We prove the existence of an optimal program and the equivalence of maximal, optimal and minimal value-loss programs. We characterize the unique golden rule stock and prove that it is sustainable, i.e., it is invariant along the optimal program. Furthermore, we also prove that along any good program from any initial condition there is convergence of the forest’s state to this sustainable state. Finally, we define a value function in the set of forest states and define a pre-order that provides an alternative way of characterizing the golden rule stock and may potentially have independent interest.     

‘Regular’ choice and the weak axiom of stochastic revealed preference

We explore the relation between two ‘rationality conditions’ for stochastic choice behavior: regularity and the weak axiom of stochastic revealed preference (WASRP). We show that WASRP implies regularity, but the converse is not true. We identify a restriction on the domain of the stochastic choice function, which suffices for regularity to imply WASRP. When the universal set of alternatives is finite, this restriction is also necessary for regularity to imply WASRP. Furthermore, we identify necessary and sufficient domain restrictions for regularity to imply WASRP, when the universal set of alternatives is finite and stochastic choice functions are all degenerate. Results in the traditional, deterministic, framework regarding the relation between Chernoff’s condition and the weak axiom of revealed preference follow as special cases. Thus, general conditions are established, under which regularity can substitute for WASRP as the axiomatic foundation for a theory of choice behavior.     

Selling an asset to a competitor

A seller decides whether to allocate an item among two potential buyers. The seller and buyer 1 interact ex post in such a way that each of them suffers a negative externality if the other possesses the item. We show that the optimal allocation rule favors buyer 2, who does not interact ex post with the seller, and in particular bidder 1 may not obtain the good even if his valuation is highest. The auction is therefore subject to resale. When resale is possible, the seller must distort the original auction. We show that the mechanism depends crucially on the way resale is organized ex post. The seller may decide to always allocate the good to the agent with the highest valuation when rents are fully extracted by an intermediary on the resale market. However, she may resort to a stochastic mechanism when the winner of the primary auction has full bargaining power in the resale stage.