Revenue ranking of first-price auctions with resale

When the price setter in post-auction resale is chosen according to exogenous probabilities, Hafalir and Krishna (2008) [2] showed that the first-price auction brings more expected revenues than the second-price auction with truth-bidding bidders. We complete their revenue ranking by proving that the first-price auction produces higher expected revenues the higher the probability the auction winner sets the resale price.     

Uniqueness in symmetric first-price auctions with affiliation

The first-price auction has a unique monotone pure strategy equilibrium when there are n symmetric risk-averse bidders having affiliated types and interdependent values.     

Asymmetry and revenue in first-price auctions

We show by an example that in first-price IPV auctions, asymmetry in bidders' valuations need not reduce the revenue compared to a benchmark symmetric model with the same amount of social surplus. Asymmetry need not reduce competition in first-price auctions.     

Sequential procurement auctions with risk-averse suppliers

We compare two procurement mechanisms, bundling and unbundling, in a two-stage auction model with risk-averse suppliers. The mechanisms differ in that the two tasks of investment and production are procured through a single auction or two sequential auctions. Suppliers’ production costs are affected by two risk factors, aggregate risk and idiosyncratic risk, as well as by the cost-reducing investment. We show that the bundling mechanism is optimal for a buyer and socially desirable if the aggregate risk is below certain thresholds. The result may not hold true for idiosyncratic risk.     

Pre-auction offers in asymmetric first-price and second-price auctions

We consider first-price and second-price auctions with asymmetric buyers, and examine whether pre-auction offers to a subset of buyers are profitable. A single offer is never profitable prior to a second-price auction, but may be profitable prior to a first-price auction. However, a sequence of offers is profitable in either type of auction. In our model, suitably chosen pre-auction offers work because they move the assignment when bidder valuations are “near the top” closer to the optimal, revenue-maximizing assignment.     

How bidder’s number affects optimal reserve price in first-price auctions under risk aversion

This paper shows that in the classic symmetric and independent private value environments, the seller’s optimal reserve price is a decreasing function of the number of bidders in the first-price auctions when the seller and/or buyers are risk averse.     

Individual bidder behavior in first-price private value auctions

Individual bid functions display sensitivity to the strategic considerations inherent in first-price auctions. However, several formal models, including heterogeneous Nash equilibrium bidding models with constant relative risk aversion, perform quite poorly.     

Allotment in first-price auctions: an experimental investigation

We experimentally study the effects of allotment—the division of an item into homogeneous units—in independent private value auctions. We compare a bundling first-price auction with two equivalent treatments where allotment is implemented: a two-unit discriminatory auction and two simultaneous single-unit first-price auctions. We find that allotment in the form of a discriminatory auction generates a loss of efficiency with respect to bundling. In the allotment treatments, we observe large and persistent bid spread, and the discriminatory auction is less efficient than simultaneous auctions. We provide a unified interpretation of our results that is based on both a non-equilibrium response to the coordination problem characterizing the simultaneous auction format and a general class of behavioral preferences that includes risk aversion, joy of winning and loser’s regret as specific cases.     

Information aggregation in auctions with an unknown number of bidders

Information aggregation, a key concern for uniform-price, common-value auctions with many bidders, has been characterized in models where bidders know exactly how many rivals they face. A model allowing for uncertainty over the number of bidders is essential for capturing a critical condition for information to aggregate: as the numbers of winning and losing bidders grow large, information aggregates if and only if uncertainty about the fraction of winning bidders vanishes. It may be possible for the seller to impart this information by precommitting to a specified fraction of winning bidders, via a proportional selling policy. Intuitively, this could make the proportion of winners known, and thus provide all the information that bidders need to make winner's curse corrections.     

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.     

Expected revenue of all-pay and first-price sealed-bid auctions with affiliated signals

In the general symmetric auction framework of Milgrom and Weber (1982) it is shown—as a new manifestation of thelinkage principle—that the all-pay sealed-bid auction yieldshigher expected revenue than the standard first-price sealed-bid auction. This raises the question why sealed-bid auctions of the standard first-price variety are observed in practice whereas the all-pay variety is not.     

The effect of corruption on bidding behavior in first-price auctions

When the owner of an object sells it through an auction run by an agent of hers, corruption may appear. In a first-price auction, corruption can make honest bidders more or less aggressive, or their behavior can remain unchanged. We identify sufficient conditions for each of the three possibilities. We analyze the effects of corruption on efficiency, bidders’ welfare and expected revenue. Our results apply as well to the situation—unrelated to corruption—where one of the bidders is granted a right of first refusal.     

Equilibrium of a sequence of auctions when bidders demand multiple items

We construct an ex post perfect equilibrium in a sequence of second-price auctions with two bidders where each bidder’s marginal values for additional units are decreasing. This equilibrium implies an increasing path of transaction prices and is ex post efficient.     

Strategic price discounting and rationing in uniform price auctions

I modify the uniform-price auction rules in allowing the seller to ration bidders. This allows me to provide a strategic foundation for underpricing when the seller has an interest in ownership dispersion. Moreover, many of the so-called “collusive-seeming” equilibria disappear.     

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.     

Asymmetric first-price auctions with uniform distributions: analytic solutions to the general case

In 1961, Vickrey posed the problem of finding an analytic solution to a first-price auction with two buyers having valuations uniformly distributed on ${[\underline{v}_{1}, \overline{v}_{1}]}$ and ${[\underline{v}_{2}, \overline{v}_{2}]}$ . To date, only special cases of the problem have been solved. In this paper, we solve this general problem and in addition allow for the possibility of a binding minimum bid. Several interesting examples are presented, including a class where the two bid functions are linear.     

Entry decisions and bidding behavior in sequential first-price procurement auctions: An experimental study

Though many real life auctions are run independently of each other, from the bidders' point of view they often form sequences of auctions. We investigate how behavior responds to the additional incentives that are present in such auction sequences. Comparing subjects' decisions in single first-price procurement auctions with their decisions in a game consisting of two subsequent first-price procurement auctions, we find that, in line with the theoretical prediction, entry and bidding behavior is crucially affected by the opportunity cost of early bid submission. Though, entry decisions and average bids in the auction sequence systematically deviate from the perfect Bayesian equilibrium prediction. While the nature of the opponent (human being or computer) has no significant effect on these findings, giving subjects additional feedback on winners and prices seems to reduce the deviations from the equilibrium prediction.     

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.     

Bribing and signaling in second price auctions

We examine whether a two-bidder, second-price auction for a single good (with private, independent values) is immune to a simple form of collusion, where one bidder may bribe the other to commit to stay away from the auction (i.e. submit a bid of zero). In either of two cases—where the potential bribe is fixed or allowed to vary—the only robust equilibria involve bribing. In the fixed-bribe case, there is a unique such equilibrium. In the variable bribes case, all robust equilibria involve low briber-types revealing themselves through the amount they offer, while all high types offer the same bribe; only one such equilibrium is continuous. Bribing in all cases causes inefficiency.