Asymmetric Demand Information in Uniform and Discriminatory Call Auctions: An Experimental Analysis Motivated by Electricity Markets

We study experimental multi-unit uniform and discriminatory auctions with demand uncertainty, motivated by the ongoing debate about market design in the electricity industry. We study the effect of asymmetric demand-information in the two auction institutions. In our treatment condition some sellers have less information than in our baseline conditions. In both conditions transaction prices and price volatility are not significantly different under the two auction institutions. However, under asymmetric information discriminatory auctions are significantly less efficient. These results are not in line with typical arguments made in favor of discriminatory pricing in electricity industries; namely, lower prices and less volatility.     

Asymmetric Nash equilibrium in emission rights auctions

This paper studies the problems of emission rights auctions, and presents a uniform price auction mechanism based on three assumptions, i.e., all buyers are asymmetric, every buyer submits a nonincreasing continuous demand function, and every buyer's valuation to per unit of the emission rights is common value information. It focuses on solving the asymmetric Nash equilibrium for this auction mechanism. It concludes that there exist multiple Nash equilibria in our auction mechanism, but the arbitrary low equilibrium prices cannot emerge. We also give several suggestions on how to induce the auction to a desired ideal equilibrium state in mechanism design of emission rights auctions.     

Auctions with almost homogeneous bidders

We prove that, around the symmetric case, where the values are identically distributed, the equilibrium of the first price auction is jointly differentiable with respect to general bidder-specific parameters of the value distributions. We show that the revenue equivalence between the first-price and the second-price auctions to the first-order in the size of the parameters is an immediate consequence of this differentiability and the Revenue Equivalence Theorem; thereby formally establishing the first-order equivalence Fibich et al. [G. Fibich, A. Gavious, A. Sela, Revenue equivalence in asymmetric auctions, J. Econ. Theory 115 (2004) 309-321] noticed for their particular perturbation.     

Increasing Competition and the Winner's Curse: Evidence from Procurement

We assess empirically the effects of the winner's curse which, in common–value auctions, counsels more conservative bidding as the number of competitors increases. First, we construct an econometric model of an auction in which bidders' preferences have both common– and private–value components, and propose a new monotone quantile approach which facilitates estimation of this model. Second, we estimate the model using bids from procurement auctions held by the State of New Jersey. For a large subset of these auctions, we find that median procurement costs rise as competition intensifies. In this setting, then, asymmetric information overturns the common economic wisdom that more competition is always desirable.     

Economics and emotion: Institutions matter

In two different types of institutions, English and Dutch auctions, we collect heart rate data, a proxy for emotion, to test hypotheses based on findings in neural science about the effect of emotion on economic behavior. We first demonstrate that recording heart rates does not distort prices in these auctions. Next we ask if knowledge of the intensity of a participant's emotional state improves our ability to predict price setting behavior beyond predictions of price based on usual economic variables. Our answer is that “institutions matter.” In the Dutch (English) auctions we find (no) evidence that knowledge of emotional intensity affects our ability to predict price setting behavior. We then entertain the proposition that the cardiac system is an information system that processes economic events. We are able to show that this hypothesis is consistent with our observations and furthermore that the processes differ across institutions.     

Reduced Form Auctions Revisited

This note uses the Theorem of the Alternative to prove new results on the implementability of general, asymmetric auctions, and to provide simpler proofs of known results for symmetric auctions. The tradeoff is that type spaces are taken to be finite.     

An elementary proof of the common maximal bid in asymmetric first-price and all-pay auctions

We prove that the maximal bid in asymmetric first-price and all-pay auctions is the same for all bidders. Our proof is elementary, and does not require that bidders are risk neutral, or that the distribution functions of their valuations are independent or smooth.     

Pure strategy equilibria of single and double auctions with interdependent values

We prove the existence of monotonic pure strategy equilibrium for many kinds of asymmetric auctions with n bidders and unitary demands, interdependent values and independent types. The assumptions require monotonicity only in the own bidder's type. The payments can be a function of all bids. Thus, we provide a new equilibrium existence result for asymmetrical double auctions and a small number of bidders. The generality of our setting requires the use of special tie-breaking rules. We present an example of a double auction with interdependent values where all equilibria are trivial, that is, they have zero probability of trade. This is related to Akerlof's “market for lemmons” example and to the “winner's curse,” establishing a connection between them. However, we are able to provide sufficient conditions for non-trivial equilibrium existence.     

Learning to bid: The design of auctions under uncertainty and adaptation

We examine auction design in a context where symmetrically informed adaptive agents with common valuations learn to bid for a good. Despite the absence of private valuations, asymmetric information, or risk aversion, bidder strategies do not converge to the Bertrand–Nash equilibrium strategies even in the long run. Deviations from equilibrium strategies depend on uncertainty regarding the value of the good, auction structure, the agents? learning model, and the number of bidders. Although individual agents learn Nash bidding strategies in isolation, the learning of each agent, by flattening the best-reply correspondence of other agents, blocks common learning. These negative externalities are more severe in second-price auctions, auctions with many bidders, and auctions where the good has an uncertain value ex post.     

Time is money: The effect of clock speed on seller’s revenue in Dutch auctions

We study the role of timing in auctions under the premise that time is a valuable resource. When one object is for sale, Dutch and first-price sealed bid auctions are strategically equivalent in standard models, and therefore, they should yield the same revenue for the auctioneer. We study Dutch and first-price sealed bid auctions in the laboratory, with a specific emphasis on the speed of the clock in the Dutch auction. At fast clock speeds, revenue in the Dutch auction is significantly lower than it is in the sealed bid auction. When the clock is sufficiently slow, however, revenue in the Dutch auction is higher than the revenue in the sealed bid auction. We develop and test a simple model of auctions with impatient bidders that is consistent with these laboratory findings.

---

Electronic Supplementary Material  The online version of this article () contains supplementary material, which is available to authorized users.      

An experimental investigation of the explosive effect in almost common value auctions

With only two bidders, a slight private value advantage in a common value auction is predicted to have an explosive effect on the allocation and revenue of the auction when using a second price and/or English clock mechanism. This paper uses the “wallet game” in an English clock mechanism with two players to test these predictions. The results show that the effect is proportional, not explosive, confirming the results of past experiments. A behavioral model with two types of players, naive and sophisticated, is developed and tested against the experimental data. In the model, naive players use a rule of thumb bidding function, while the sophisticated players are fully rational and, when forming their strategy (choosing the best response), correctly account for the probability that a rival is naive or sophisticated. We use cluster analysis to classify the players in the symmetric auctions as naive or sophisticated and a strict win/lose criteria to classify players in the asymmetric auctions. We find that those players classified as sophisticated are more aggressive in responding to high signals or advantaged status than their naive counterparts, but do not lower their bids relative to the naive players when receiving low signals or when regular.     

Competitive auctions

We study a class of single-round, sealed-bid auctions for an item in unlimited supply, such as a digital good. We introduce the notion of competitive auctions. A competitive auction is truthful (i.e. encourages bidders to bid their true valuations) and on all inputs yields profit that is within a constant factor of the profit of the optimal single sale price. We justify the use of optimal single price profit as a benchmark for evaluating a competitive auctions profit. We exhibit several randomized competitive auctions and show that there is no symmetric deterministic competitive auction. Our results extend to bounded supply markets, for which we also give competitive auctions.     

Does asymmetric information affect the premium in mergers and acquisitions?

We test the influence of information asymmetry on the premium paid for an acquisition. We analyze mergers and acquisitions as English auctions. The theory of dynamic auctions with private and common value predicts that more informed bidders may pay a lower price. We test that prediction with a sample of 1,026 acquisitions in the United States between 1990 and 2007. We assume that blockholders of the target's shares are better informed than other bidders because they possess privileged information on the target. Our empirical results show that blockholders pay a much lower premium than do other buyers     

Equilibria in second price auctions with participation costs

We investigate equilibria of sealed-bid second price auctions with bidder participation costs in the independent private values environment. We focus on equilibria in cutoff strategies (participate and bid the valuation iff it is greater than the cutoff), since if a bidder finds it optimal to participate, she cannot do better than bidding her valuation. When bidders are symmetric, concavity (strict convexity) of the cumulative distribution function from which the valuations are drawn is a sufficient condition for uniqueness (multiplicity) within this class. We also study a special case with asymmetric bidders and show that concavity/convexity plays a similar role.     

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.     

Nonparametric panel estimation of online auction price processes

In this study, we examine the price process of eBay online auctions. We pool sparse and unevenly spaced bidding histories of individual auctions, resulting in an unbalanced panel of bids. Since the price processes of online auctions are monotonically increasing within individual auctions and exhibit a substantial degree of heterogeneity, we propose a monotone series estimator for panel data with auction-specific slopes for a common relative price growth curve. We generalize Ramsay’s (1998, J R Stat Soc B 60(2):365–375) monotone series estimator to fit our panel model of the price process. We apply the proposed model and estimator to eBay auctions of a popular hand-held device (a Palm PDA). The results are shown to capture closely the overall pattern of observed price dynamics. In particular, the early bidding, mid-auction bidding drought, and end-auction bid sniping are well approximated by the estimated price curve.     

Strategic Jump Bidding in English Auctions

This paper solves for equilibria of sequential bid (or English) auctions with affiliated values when jump bidding strategies may be employed to intimidate one's opponents. In these equilibria, jump bids serve as correlating devices which select asymmetric bidding functions to be played subsequently. Each possibility of jump bidding provides a Pareto improvement for the bidders from the symmetric equilibrium of a sealed bid, second-price auction. The expanded set of equilibria can approximate either first- or second-price outcomes and produce exactly the set of expected prices between those two bounds. These results contrast with standard conclusions that equate English and second-price auctions.     

Comparing competition and collusion: a numerical approach

Summary. Collusion is a serious problem in many procurement auctions. In this research, I study a model of first price sealed bid procurement auctions with asymmetric bidders. I demonstrate that the equilibrium to the model is unique and describe three algorithms that can be used to compute the inverse equilibrium bid functions. I then use the computational algorithms to compare competitive and collusive bidding. The algorithms are useful for structural estimation of auction models and for assessing the damages from bid-rigging. Received: January 14, 2000; revised version: February 28, 2001     

Communication and reputation in procurement auctions — Some empirical evidence

This paper studies communication and reputation in market interactions using data from online procurement auctions. Positive reputation ratings and engaging in communication increase a bidder’s probability of winning. Messages are primarily used to reduce the asymmetric information associated with transactions.     

Charitable asymmetric bidders

Recent papers show that the all‐pay auction is better at raising money for charity than the first‐price auction with symmetric bidders under incomplete information. Yet, this result is lost with sufficiently asymmetric bidders under complete information. In this paper, we consider a framework on charity auctions with asymmetric bidders under some incomplete information. We find that the all‐pay auction still raises more money than the first‐price auction. Thus, the all‐pay auction should be seriously considered when one wants to organize a charity auction.