We study stationary equilibria in a sequential auction setting. A seller runs a sequence of standard first-price or second-price auctions to sell an indivisible object to potential buyers. The seller can commit to the rule of the auction and the reserve price of the current period but not to reserve prices of future periods. We prove the existence of stationary equilibria and establish a uniform Coase conjecture—at any point in time and in any stationary equilibrium, the seller’s profit from running sequential auctions converges to the profit of running an efficient auction as the period length goes to zero.
more »
« less
Auctions with Limited Commitment
We study the role of limited commitment in a standard auction environment. In each period, the seller can commit to an auction with a reserve price but not to future reserve prices. We characterize the set of equilibrium profits attainable for the seller as the period length vanishes. An immediate sale by efficient auction is optimal when there are at least three buyers. For many natural distributions two buyers is enough. Otherwise, we give conditions under which the maximal profit is attained through continuously declining reserve prices. (JEL D44, D82)
more »
« less
- Award ID(s):
- 1824328
- PAR ID:
- 10282142
- Date Published:
- Journal Name:
- American Economic Review
- Volume:
- 109
- Issue:
- 3
- ISSN:
- 0002-8282
- Page Range / eLocation ID:
- 876 to 910
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
Large fractions of online advertisements are sold via repeated second-price auctions. In these auctions, the reserve price is the main tool for the auctioneer to boost revenues. In this work, we investigate the following question: how can the auctioneer optimize reserve prices by learning from the previous bids while accounting for the long-term incentives and strategic behavior of the bidders? To this end, we consider a seller who repeatedly sells ex ante identical items via a second-price auction. Buyers’ valuations for each item are drawn independently and identically from a distribution F that is unknown to the seller. We find that if the seller attempts to dynamically update a common reserve price based on the bidding history, this creates an incentive for buyers to shade their bids, which can hurt revenue. When there is more than one buyer, incentive compatibility can be restored by using personalized reserve prices, where the personal reserve price for each buyer is set using the historical bids of other buyers. Such a mechanism asymptotically achieves the expected revenue obtained under the static Myerson optimal auction for F. Further, if valuation distributions differ across bidders, the loss relative to the Myerson benchmark is only quadratic in the size of such differences. We extend our results to a contextual setting where the valuations of the buyers depend on observed features of the items. When up-front fees are permitted, we show how the seller can determine such payments based on the bids of others to obtain an approximately incentive-compatible mechanism that extracts nearly all the surplus.more » « less
-
We consider the problem of a single seller repeatedly selling a single item to a single buyer (specifically, the buyer has a value drawn fresh from known distribution $$D$$ in every round). Prior work assumes that the buyer is fully rational and will perfectly reason about how their bids today affect the seller's decisions tomorrow. In this work we initiate a different direction: the buyer simply runs a no-regret learning algorithm over possible bids. We provide a fairly complete characterization of optimal auctions for the seller in this domain. Specifically: 1) If the buyer bids according to EXP3 (or any ``mean-based'' learning algorithm), then the seller can extract expected revenue arbitrarily close to the expected welfare. This auction is independent of the buyer's valuation $$D$$, but somewhat unnatural as it is sometimes in the buyer's interest to overbid. 2) There exists a learning algorithm $$\mathcal{A}$$ such that if the buyer bids according to $$\mathcal{A}$$ then the optimal strategy for the seller is simply to post the Myerson reserve for $$D$$ every round. 3) If the buyer bids according to EXP3 (or any ``mean-based'' learning algorithm), but the seller is restricted to ``natural'' auction formats where overbidding is dominated (e.g. Generalized First-Price or Generalized Second-Price), then the optimal strategy for the seller is a pay-your-bid format with decreasing reserves over time. Moreover, the seller's optimal achievable revenue is characterized by a linear program, and can be unboundedly better than the best truthful auction yet simultaneously unboundedly worse than the expected welfare.more » « less
-
Vidick, T. (Ed.)We study auctions for carbon licenses, a policy tool used to control the social cost of pollution. Each identical license grants the right to produce a unit of pollution. Each buyer (i.e., firm that pollutes during the manufacturing process) enjoys a decreasing marginal value for licenses, but society suffers an increasing marginal cost for each license distributed. The seller (i.e., the government) can choose a number of licenses to put up for auction, and wishes to maximize the societal welfare: the total economic value of the buyers minus the social cost. Motivated by emission license markets deployed in practice, we focus on uniform price auctions with a price floor and/or price ceiling. The seller has distributional information about the market, and their goal is to tune the auction parameters to maximize expected welfare. The target benchmark is the maximum expected welfare achievable by any such auction under truth-telling behavior. Unfortunately, the uniform price auction is not truthful, and strategic behavior can significantly reduce (even below zero) the welfare of a given auction configuration. We describe a subclass of “safe-price” auctions for which the welfare at any Bayes-Nash equilibrium will approximate the welfare under truth-telling behavior. We then show that the better of a safeprice auction, or a truthful auction that allocates licenses to only a single buyer, will approximate the target benchmark. In particular, we show how to choose a number of licenses and a price floor so that the worst-case welfare, at any equilibrium, is a constant approximation to the best achievable welfare under truth-telling after excluding the welfare contribution of a single buyer.more » « less
-
Abstract Biological market theory can be used to explain intraspecific cooperation, interspecific mutualism, and sexual selection through models of game theory. These models describe the interactions between organisms as two classes of traders (buyers/sellers) exchanging commodities in the form of goods (e.g. food, shelter, matings) and services (e.g. warning calls, protection). Here, we expand biological market theory to include auction theory where bidding serves to match buyers and sellers.In a reverse auction, the seller increases the value of the item or decreases the cost until a buyer steps forward. We provide several examples of ecological systems that may have reverse auctions as underlying mechanisms to form mutualistic relationships.We focus on the yellow baboon (Papio cynocephalus) mating system as a case study to propose how the mechanisms of a reverse auction, which have the unintended but emergent consequence of producing a mutually beneficial outcome that improves collective reproductive benefits of the troop in this multi‐female multi‐male polygynandrous social system. For the yellow baboon, we posit that the “seller” is the reproductively cycling female, and the “buyer” is a male looking to mate with a cycling female. To the male, the “item for the sale” is the opportunity to sire an offspring, the price is providing safety and foraging time (via consortship) to the female. The “increasing value of the item for sale” is the chance of conception, which increases with each cycle since a female has resumed cycling post‐partum. The female's sexual swelling is an honest indicator of that cycle's probability of conception, and since resident males can track a female's cycle since resumption, there is transparency. The males presumably know the chance of conception when choosing to bid by offering consortship.Across nature, this reverse auction game likely exists in other inter‐ and intraspecific social relationships. Considering an ecological system as a reverse auction broadens our view of social evolution and adaptations through the lens of human economic structures.more » « less
An official website of the United States government

