Implementation in undominated strategies by bounded mechanisms: Some results on compromise alternatives

We consider an impossibility result in Börgers (1991), which says in a restricted environment with two players or three alternatives it is impossible to implement a social choice correspondence that is efficient, enforces compromises at a profile and is implementable in undominated strategies by a bounded mechanism. We extend and refine this result in many ways- we generalize the impossibility result for any number of players and alternatives when the compromises are enforced at a near-unanimous preference profile. We further show that the impossibility result in Börgers (1991) holds good if we replace efficiency of SCCs by neutrality. Also the impossibility result holds good for two agents and any number of alternatives when the SCC is unanimous and minimal. Interestingly, we get a possibility result when we relax the assumption of minimality.     

Coalitional Bayesian Nash implementation in differential information economies

Summary. A mechanism coalitionally implements a social choice set if any outcome of the social choice set can be achieved as a coalitional Bayesian Nash equilibrium of a mechanism and vice versa. We say that a social choice set is coalitionally implementable if there is a mechanism which coalitionally implements it. Our main theorem proves that a social choice set is coalitionally implementable if and only if it is interim individually rational, interim efficient, coalitional B ayesian incentive compatible, and satisfies a coalitional Bayesian monotonicity condition as well as a closure condition. As an application of our main result, we show that the private core and the private Shapley value of an economy with differential information are coalitionally implementable. Received: January 12, 1998; revised version: March 30, 2000     

Nash implementation and uncertain renegotiation

We study Nash implementation when the outcomes of the mechanism can be renegotiated among the agents but the planner does not know the renegotiation function that they will use. We characterize the social objectives that can be implemented in Nash equilibrium when the same mechanism must work for every admissible renegotiation function, and show the importance of allowing the planner to sometimes take away resources from the agents.     

Ex post implementation

We analyze the problem of fully implementing a social choice set in ex post equilibrium. We identify an ex post monotonicity condition that is necessary and—in economic environments—sufficient for full implementation in ex post equilibrium. We also identify an ex post monotonicity no veto condition that is sufficient. Ex post monotonicity is satisfied in all single crossing environments with strict ex post incentive constraints.We show by means of two classic examples that ex post monotonicity does not imply nor is it implied by Maskin monotonicity. The single unit auction with interdependent valuations is shown to satisfy ex post monotonicity but not Maskin monotonicity. We further describe a Pareto correspondence that fails ex post monotonicity but satisfies Maskin monotonicity.     

Adjusting the model to adjust the world: constructive mechanisms in postwar general equilibrium theory

Economic methodologists most often study the relations between models and reality while focusing on the issues of the model's epistemic relevance in terms of its relation to the ‘real world’ and representing the real world in a model. We complement the discussion by bringing the model's constructive mechanisms or self-implementing technologies in play. By this, we mean the elements of the economic model that are aimed at ‘implementing’ it by envisaging the ways to change the reality in order to bring it more in line with the model. We are thus concerned mainly not with the ways to change the model to ‘fit’ the reality, but rather with the model's own armature that is supposed to transform the world along theoretical lines. The case we study is Arrow–Debreu–McKenzie general equilibrium model. In particular, we show the following: gradient methods and stability could be regarded as constructive mechanisms of general equilibrium modeling in the context of market socialism debates; the obsession of general equilibrium theorists with these concepts can be partly explained by the fact that they hoped not to be faithful to reality, but rather to adjust it to fit the theoretical model; mechanism design theory initiated by the stability theorist Leonid Hurwicz could be seen as a successor of this position. We conclude by showing the relevance of this analysis for epistemic culture of much of contemporary economics and hence, claim that it is an important complement to the traditional philosophy of economic modeling.     

Simple mechanisms and preferences for honesty

We consider full implementation in complete-information environments when agents have an arbitrarily small preference for honesty. We offer a condition called separable punishment and show that when it holds and there are at least two agents, any social choice function can be implemented by a simple mechanism in two rounds of iterated deletion of strictly dominated strategies.     

Information at equilibrium

Summary. In a game with rational expectations, individuals simultaneously refine their information with the information revealed by the strategies of other individuals. At a Nash equilibrium of a game with rational expectations, the information of individuals is essentially symmetric: the same profile of strategies is also an equilibrium of a game with symmetric information; and strategies are common knowledge. If each player has a veto act, which yields a minimum payoff that no other profile of strategies attains, then the veto profile is the only Nash equilibrium, and it is is an equilibrium with rational expectations and essentially symmetric information; which accounts for the impossibility of speculation. Received: June 20, 2001; revised version: January 9, 2002 RID="*" ID="*" We wish to thank Pierpaolo Battigalli, Fran?oise Forges, Franco Donzelli, Leonidas Koutsougeras, Aldo Rustichini, Rajiv Vohra and Nicholas Yannelis for their comments. Correspondence to: H. Polemarchakis     

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.     

Comparing finite mechanisms

Summary. This paper obtains finite analogues to propositions that a previous literature obtained about the informational efficiency of mechanisms whose possible messages form a continuum. Upon reaching an equilibrium message, to which all persons “agree”, a mechanism obtains an action appropriate to the organization's environment. Each person's privately observed characteristic (a part of the organization's environment) enters her agreement rule. An example is the Walrasian mechanism in an exchange economy. There a message specifies a proposed trade vector for each trader as well as a price for each non-numeraire commodity. A trader agrees if the price of each non-numeraire commodity equals her marginal utility for that commodity (at the proposed trades) divided by her marginal utility for the numeraire. At an equilibrium message, the mechanism's action consists of the trades specified in that message, and (for classic economies) those trades are Pareto-optimal and individually rational. Even though the space of environments (characteristics) is a continuum, mechanisms with a continuum of possible messages are unrealistic, since transmitting every point of a continuum is impossible. In reality, messages have to be rounded off and the number of possible messages has to be finite. Moreover, reaching a continuum mechanism's equilibrium message typically requires infinite time and that difficulty is absent if the number of possible messages is finite. The question therefore arises whether results about continuum mechanisms have finite counterparts. If we measure a continuum mechanism's communication cost by its message-space dimension, then our corresponding cost measure for a finite mechanism is the (finite) number of possible equilibrium messages. We find that if two continuum mechanisms yield the same action but the first has higher message-space dimension, then a sufficiently fine finite approximation of the first has larger error than an approximation of the second if the cost of the first approximation is no higher than the cost of the second approximation. An approximation's “error” is the largest distance between the continuum mechanism's action and the approximation's action. We obtain bounds on error. We also study the performance of Direct Revelation (DR) mechanisms relative to “indirect” mechanisms, both yielding the same action, when the environment set grows. We find that as the environment-set dimension goes to infinity, so does the extra cost of the DR approximation, if the error of the DR approximation is at least as small as the error of the indirect approximation. While the paper deals with information-processing costs and not incentives, it is related to the incentive literature, since the Revelation Principle is central to much of that literature and one of our main results is the informational inefficiency of finite Direct Revelation mechanisms. Received: May 21, 2001; revised version: December 14, 2001 RID="*" ID="*" Earlier versions of this paper were presented at the Decentralization Conference, Washington University, St Louis, April 2000 and at the Eighth World Congress of the Econometric Society, August 2000. We are grateful for comments received on those occasions. The second author gratefully acknowledges support from National Science Foundation grant #IIS9712131. Correspondence to: T. Marschak     

简化一般均衡模型中一般均衡点的确定

经济学教材在讨论一般均衡的时候,往往以两个人、两种生产要素、两种产品这种最简单的社会作为研究对象,它们通常只阐述了一般均衡的存在,但都没有说明这种最简单的社会一般均衡点的确定即以此作为研究对象。     

The value of information for auctioneers

An auctioneer wants to sell an indivisible object to one of multiple bidders, who have private information about their valuations of the object. A bidder's information structure determines the accuracy with which the bidder knows her private valuation. The main result of the paper is that the auctioneer's revenue is a convex function of bidders' information structures. One implication is that assigning asymmetric information structures instead of symmetric information structures to bidders is always revenue-enhancing. This paper generalizes a result of Bergemann and Pesendorfer [D. Bergemann, M. Pesendorfer, Information structures in optimal auctions, J. Econ. Theory 137 (2007) 580–609], who show that revenue-maximizing information structures are asymmetric.     

Optimal auctions with asymmetrically informed bidders

Summary. The paper analyzes a problem of optimal auction design when the seller faces asymmetrically informed bidders. Specifically, we consider a continuum of risk-neutral uninformed bidders taking part into the auction along with n risk-averse informed bidders. The contribution of the paper is threefold. First, we fully characterize the optimal auction in this non standard environment and in a very general set-up. We find that when informed bidders reveal “bad news” about the value of the good, the seller optimally awards the object to the uninformed bidders. Secondly, we show that the seller is better off in presence of uninformed bidders because this allows to lower the informational rents paid to the informed bidders. Last, we find that, with bi-lateral risk neutrality, the seller always awards the good to the uninformed bidders thereby keeping all the surplus.Received: 22 October 2004, Revised: 21 April 2005, JEL Classification Numbers: D44, D82.We are very grateful to two anonymous referees, Jacques Crémer, Patrick François, Angel Hernando-Veciana and seminar participants at the 2004 SCSE conference (Quebec, Canada) for their valuable comments. Moez Bennouri acknowledges the financial support by the Initiative of the New Economy (INE) program of SSHRC (Canada).     

A characterization of efficient, bayesian incentive compatible mechanisms

Summary. A mechanism that is both efficient and incentive compatible in the Bayesian-Nash sense is shown to be payoff-equivalent to a Groves mechanism at the point in time when each agent has just acquired his private information. This equivalence result simplifies the question of whether or not an efficient, Bayesian incentive compatible mechanism can satisfy other desired objectives, for the search for an appropriate mechanism can be restricted to the family of Groves mechanisms. The method is used to extend the result of Myerson and Satterthwaite on the inefficiency of bilateral bargaining to a multilateral setting. Received: June 30, 1997; revised version: May 22, 1998     

Truthful approximation mechanisms for restricted combinatorial auctions

When attempting to design a truthful mechanism for a computationally hard problem such as combinatorial auctions, one is faced with the problem that most efficiently computable heuristics can not be embedded in any truthful mechanism (e.g. VCG-like payment rules will not ensure truthfulness).We develop a set of techniques that allow constructing efficiently computable truthful mechanisms for combinatorial auctions in the special case where each bidder desires a specific known subset of items and only the valuation is unknown by the mechanism (the single parameter case). For this case we extend the work of Lehmann, O'Callaghan, and Shoham, who presented greedy heuristics. We show how to use If-Then-Else constructs, perform a partial search, and use the LP relaxation. We apply these techniques for several canonical types of combinatorial auctions, obtaining truthful mechanisms with provable approximation ratios.     

Individually rational, budget-balanced mechanisms and allocation of surplus

We investigate the issue of implementation via individually rational ex-post budget-balanced Bayesian mechanisms. We show that all decision rules generating a nonnegative expected social surplus are implementable via such mechanisms if and only if the probability distribution of the agents’ type profiles satisfies two conditions: the well-known condition of Crémer and McLean [1988. Full extraction of the surplus in Bayesian and dominant strategy auctions, Econometrica 56, 1247–1257] and the Identifiability condition introduced in this paper. We also show that these conditions are necessary for ex-post efficiency to be attainable with budget balance and individual rationality, and that the expected social surplus in these mechanisms can be distributed in any desirable way. Lastly, we demonstrate that, like Crémer–McLean condition, the Identifiability condition is generic if there are at least three agents.