Optimal advertising of auctions

We study a symmetric independent private values auction model where the revenue-maximizing seller faces a cost cn of attracting n bidders to the auction. If the distribution of valuations possesses an increasing failure rate (IFR), the seller overinvests in attracting bidders compared to the social optimum. Conversely, if the distribution is DFR, the seller underinvests compared to the social optimum. If the distribution of valuations becomes more dispersed, both, a revenue- and a welfare-maximizing seller, attract more bidders.     

Auctions in which losers set the price

We study auctions of a single asset among symmetric bidders with affiliated values. We show that the second-price auction minimizes revenue among all efficient auction mechanisms in which only the winner pays, and the price only depends on the losers' bids. In particular, we show that the kth price auction generates higher revenue than the second-price auction, for all k>2. If rationing is allowed, with shares of the asset rationed among the t highest bidders, then the (t+1)st price auction yields the lowest revenue among all auctions with rationing in which only the winners pay and the unit price only depends on the losers' bids. Finally, we compute bidding functions and revenue of the kth price auction, with and without rationing, for an illustrative example much used in the experimental literature to study first-price, second-price and English auctions.     

An Optimal Auction for Complements

This paper considers the optimal selling mechanism for complementary items. When buyers are perfectly symmetric, the optimal procedure is to bundle the items and run a standard auction. In general, however, bundling the items is not necessarily desirable, and the standard auctions do not maximize revenue. Moreover, the optimal auction allocation may not be socially efficient since the auction must discriminate against bidders who have strong incentives to misrepresent their true preferences.Journal of Economic LiteratureClassification Number: D44.     

Credit contracting and bidding under wealth constraints

Summary. We model credit contracting and bidding in a first-price sealed-bid auction when bidder valuation and wealth are private information. An efficient separating equilibrium exists only if the wealth levels of both bidder types are sufficiently different. If not, high-valuation bidders signal by borrowing more and using less of their wealth – this is inefficient as wealth is a cheaper source of funds. An increase in the amount of borrowing required to signal does not necessarily decrease seller expected revenue. In contrast to separating equilibria, high-valuation bidders adopt pure strategy bids in pooling equilibria. Conditions are identified under which the lower bound on winning bids is higher in pooling than separating equilibria. Received: January 22, 2001; revised version: August 28, 2001     

Budget-constrained sequential auctions with incomplete information

I study a budget-constrained, private-valuation, sealed-bid sequential auction with two incompletely-informed, risk-neutral bidders in which the valuations and income may be non-monotonic functions of a bidder's type. Multiple equilibrium symmetric bidding functions may exist that differ in allocation, efficiency and revenue. The sequence of sale affects the competition for a good and therefore also affects revenue and the prices of each good in a systematic way that depends on the relationship among the valuations and incomes of bidders. The sequence of sale may affect prices and revenue even when the number of bidders is large relative to the number of goods. If a particular good, say α, is allocated to a strong bidder independent of the sequence of sale, then auction revenue and the price of good α are higher when good α is sold first.     

The Relevance of a Choice of Auction Format in a Competitive Environment

We examine the relevance of an auction format in a competitive environment by comparing uniform and discriminatory price auctions with many bidders in a private values setting. We show that if the number of objects for sale is small relative to the number of bidders, then all equilibria of both auctions are approximately efficient and lead to approximately the same revenue. When the number of objects for sale is proportional to the number of bidders, then the particulars of the auction format matter. All equilibria of the uniform auction are efficient, while all of the equilibria of the discriminatory auction are inefficient. The relative revenue rankings of the auction formats can go in either direction, depending on the specifics of the environment. These conclusions regarding the efficiency and revenue ranking are in contrast to the previous literature, which focused on the case of independent information across agents.     

First-price auctions with resale: the case of many bidders

We study first-price auctions with resale when there are many bidders and derive existence and characterization results under the assumption that the winner of the initial auction runs a second-price auction with an optimal reserve price. The fact that symmetrization fails when there are more than two bidders has been observed before, but we also provide the direction: weaker bidders are less likely to win than stronger ones. For a special class of distributions and three bidders, we prove that the bid distributions are more symmetric with resale than without. Numerical simulations suggest that the more bidders there are, the more similar the allocation is to the case without resale, and thus, the more asymmetric the bid distributions are between strong and weak bidders. We also show in an example that the revenue advantage of first-price auctions over second-price auctions is positive, but decreasing in the number of bidders.     

Bid Functions in Auctions and Fair Division Games: Experimental Evidence

In auctions a seller offers a commodity for sale and collects the revenue. In fair division games the object is collectively owned by the group of bidders who equally share the revenue. We run an experiment in which the participants face four types of allocation games (auctions and fair division game under two price rules, first– versus second–price rule). We collect entire bid functions rather than bids for single values and investigate price and efficiency of the different trading institutions. We find that the first–price auction is more efficient than the second–price auction, whereas economic rationality assuming heterogeneous bidders suggests the opposite. Furthermore, we study the structure of individual bid functions.     

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).     

An Asymptotic Solution for Sealed Bid Common-Value Auctions with Bidders Having Asymmetric Information

We investigate a first-price common-value auction where bidders have asymmetric information about an item of unknown value. We compute the unique Nash equilibrium when the bidders are constrained to translation-invariant bid functions. Further, this profile of bid functions is also an asymptotic Nash equilibrium (without the constraint on the bidders' strategies) as the a priori distribution of the true value becomes increasingly diffuse. All bidders have positive expected profits at equilibrium. In the second-price analogue with two bidders there is a continuum of Nash equilibria in which both bidders have positive expected profits. Journal of Economic Literature Classification Number: C7.     

Collusion in one-shot second-price auctions

Summary. Most of the literature on collusive behavior in auctions ignores two important issues that make collusion difficult to sustain at least in one-shot interactions: the detection of cheating and the verification of bids. Colluding bidders may deceive each other by using shill bidders. Also, if the identities of the bidders and their bids are not published then it would be difficult to verify the bid of a colluding bidder. This paper addresses these problems in one shot second price auctions where one bidder offers another bidder a side payment in exchange for not participating in the auction, while the number of other bidders is stochastic. In spite of the barriers to collusion mentioned above, a simple side payment mechanism which depends only on the auction price is introduced. It induces a successful collusion, eliminates the verification problem, provides no incentive for the use of shill bidders and guarantees that the proponent obtains ex-post non-negative payoff. The colluding bidders are ex-ante strictly better off compared with the competitive case, irrespective of their types.Received: 27 November 2002, Revised: 28 January 2005, JEL Classification Numbers: C72, D44, D82.Yair Tauman: Correspondence toWe would like to thank an anonymous referee for very valuable comments and suggestions that significantly improved the paper. We thank Shmuel Zamir for a helpful discussion.     

On efficiency of the English auction

We study efficiency properties of the irrevocable exit English auction in a setting with interdependent values. Maskin (1992) [1] shows that the pairwise single-crossing condition is sufficient for efficiency of the English auction with two bidders and suggests that it is also a necessary condition. This paper clarifies and extends Maskin?s results to the case of N bidders. We introduce the generalized single-crossing condition—a fairly intuitive extension of the pairwise single-crossing condition—and prove that it is essentially a necessary and sufficient condition for the existence of an efficient equilibrium of the N-bidder English auction.     

Ratifiability of efficient collusive mechanisms in second-price auctions with participation costs

We investigate whether efficient collusive bidding mechanisms are affected by potential information leakage from bidders' decisions to participate in them within the independent private values setting. We apply the concept of ratifiability introduced by Cramton and Palfrey [Cramton, P.C., Palfrey, T.R., 1995, Ratifiable mechanisms: Learning from disagreement, Games Econ. Behav. 10 (2), 255–283] and show that when the seller uses a second-price auction with participation costs, the standard efficient cartel mechanisms such as pre-auction knockouts analyzed in the literature will not be ratified by cartel members. A high-value bidder benefits from vetoing the cartel mechanism since doing so sends a credible signal that she has high value, which in turn discourages other bidders from participating in the seller's auction.     

Asymmetric information about rivals'' types in standard auctions

We study auctions in which bidders may know the types of some rival bidders but not others. This asymmetry in bidders' knowledge about rivals' types has different effects on the two standard auction formats. In a second-price auction, it is weakly dominant to bid one's valuation, so the knowledge of rivals' types has no effect, and the good is allocated efficiently. In a first-price auction, bidders refine their bidding strategies based on their knowledge of rivals' types, which yields an inefficient allocation. We show that the inefficient allocation in the first-price auction translates into a poor revenue performance. Given a standard regularity condition, the seller earns higher expected revenue from the second-price auction than from the first-price auction, whereas the bidders are better off from the latter.     

Informational Size and Efficient Auctions

We develop an auction model for the case of interdependent values and multidimensional signals in which agents' signals are correlated. We provide conditions under which a modification of the Vickrey auction which includes payments to the bidders will result in an ex post efficient outcome. Furthermore, we provide a definition of informational size such that the necessary payments to bidders will be arbitrarily small if agents are sufficiently informationally small.     

License prices for financially constrained firms

It is often alleged that high auction prices inhibit service deployment. We investigate this claim under the extreme case of financially constrained bidders. If demand is just slightly elastic, auctions maximize consumer surplus if consumer surplus is a convex function of quantity (a common assumption), or if consumer surplus is concave and the proportion of expenditure spent on deployment is greater than one over the elasticity of demand. The latter condition appears to be true for most of the large telecom auctions in the US and Europe. Thus, even if high auction prices inhibit service deployment, auctions appear to be optimal from the consumers’ point of view.      

An ascending double auction

We show why the failure of the affiliation assumption prevents the double auction from achieving efficient outcomes when values are interdependent. This motivates the study of an ascending price version of the double auction. It is shown that when there is a sufficiently large, but still finite, number of sellers, this mechanism has an approximate perfect Bayesian equilibrium in which traders continue bidding if and only if their true estimates of the ‘value’ of the object being traded exceed the current price. This equilibrium is ex post efficient and has a rational expectations property in the sense that along the equilibrium path traders appear to have made the best possible trades conditional on information revealed by the trading process. We thank two anonymous referees and Dan Kovenock, the Editor, whose detailed comments and suggestions have allowed us to substantially improve the paper. We also thank seminar participants at University of Toronto, University of Wisconsin-Madison, Summer 2003 North American Meetings of the Econometric Society, 2004 NSF Decentralization Conference for their comments.     

Persistent unemployment and co-ordination issues: an evolutionary perspective

Abstract. In this paper we look at unemployment as a phenomenon which reflects the co-ordination problems that characterize out-of-equilibrium processes of adjustment. The analysis carried out shifts the focus from structural factors to the economic process. It shows that unemployment cannot be satisfactorily explained – and policy interventions devised – by focusing only on specific characters of the technology or confining the analysis to structural factors concerning the labour market. The co-ordination mechanisms of adjustment processes rather than the fundamentals of the economy appear, in this light, as the main determinants of differences in unemployment trends in different economies; and monetary policy comes back to the center of the stage as an essential element of the working of these mechanisms. RID="*" ID="*" We thank anonymous referees for their very useful comments, and Elena Lega for the helpful support to the simulation analysis carried out. Correspondence to: J.-L. Gaffard     

Compensating for the winner's curse: Experimental evidence

We conduct experiments on common value auctions with rationing. In each auction, the good is randomly allocated to one of the k highest bidders, at the (k+1)st highest price. When k>1, bidders are rationed. As the degree of rationing increases, the equilibrium bid function increases. Consistent with prior literature, we find that bidders suffer from the winner's curse and lose money on average. However, bids in the experiments do adjust in the appropriate direction as the degree of rationing changes, providing support for the comparative statics implications of the theory. Our results are consistent with subjects having an intuitive understanding of the winner's curse, but being unable to compute the equilibrium bid levels.     

Breaking Collusion in Auctions through Speculation: An Experiment on CO2 Emission Permit Markets

The European Emission Trading Scheme (EU‐ETS) has chosen to adopt an auctioning procedure to initially allocate CO₂ emission permits. Free allocation of permits will become an exception for the third phase (2013–2020) and most firms will have to buy all their permits on the market or via auctions. The ability of bidders to collude is a key concern about the design of the auction format. To counter collusion, the auction can be open to bidders without compliance obligations (speculators). This paper aims at studying experimentally speculation as a collusion‐breaking device in two different auction mechanisms: the uniform‐price sealed‐bid auction and the ascending clock auction. Our results suggest that a uniform sealed‐bid auction open to speculators should be chosen from a revenue maximization point of view. In this mechanism, compliance agents adopt an aggressive strategy toward speculators. This strategy significantly increases the seller's revenue, compared to the more collusive clock auction. In the latter, on the contrary, bidders accommodate speculators, letting them buy permits in the auction and buying their necessary permits on the secondary market. However, as opening the auction to speculators deteriorates efficiency, the regulator faces a trade‐off between these two objectives.