Related papers: A Field Guide to Personalized Reserve Prices
A seller chooses a reserve price in a second-price auction to maximize worst-case expected revenue when she knows only the mean of value distribution and an upper bound on either values themselves or variance. Values are private and iid.…
Designing revenue optimal auctions for selling an item to $n$ symmetric bidders is a fundamental problem in mechanism design. Myerson (1981) shows that the second price auction with an appropriate reserve price is optimal when bidders'…
A large fraction of online advertisement is 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: Can…
In classic auction theory, reserve prices are known to be effective for improving revenue for the auctioneer against quasi-linear utility maximizing bidders. The introduction of reserve prices, however, usually do not help improve total…
We study a seller who sells a single good to multiple bidders with uncertainty over the joint distribution of bidders' valuations, as well as bidders' higher-order beliefs about their opponents. The seller only knows the (possibly…
We study the revenue comparison problem of auctions when the seller has a maxmin expected utility preference. The seller holds a set of priors around some reference belief, interpreted as an approximating model of the true probability law…
We study reserve prices in auctions with independent private values when bidders are expectations-based loss averse. We find that the optimal public reserve price excludes fewer bidder types than under risk neutrality. Moreover, we show…
Setting an effective reserve price for strategic bidders in repeated auctions is a central question in online advertising. In this paper, we investigate how to set an anonymous reserve price in repeated auctions based on historical bids in…
A single unit of a good is sold to one of two bidders. Each bidder has either a high prior valuation or a low prior valuation for the good. Their prior valuations are independently and identically distributed. Each bidder may observe an…
Many online companies sell advertisement space in second-price auctions with reserve. In this paper, we develop a probabilistic method to learn a profitable strategy to set the reserve price. We use historical auction data with features to…
Second-price auctions with reserve play a critical role for modern search engine and popular online sites since the revenue of these companies often directly de- pends on the outcome of such auctions. The choice of the reserve price is the…
We study a setting where agents use no-regret learning algorithms to participate in repeated auctions. \citet{kolumbus2022auctions} showed, rather surprisingly, that when bidders participate in second-price auctions using no-regret bidding…
A seller with one unit of a good faces N\geq3 buyers and a single competitor who sells one other identical unit in a second-price auction with a reserve price. Buyers who do not get the seller's good will compete in the competitor's…
We study revenue optimization learning algorithms for repeated second-price auctions with reserve where a seller interacts with multiple strategic bidders each of which holds a fixed private valuation for a good and seeks to maximize his…
We study auction design when a seller relies on machine-learning predictions of bidders' valuations that may be unreliable. Motivated by modern ML systems that are often accurate but occasionally fail in a way that is essentially…
We present an extensive analysis of the key problem of learning optimal reserve prices for generalized second price auctions. We describe two algorithms for this task: one based on density estimation, and a novel algorithm benefiting from…
In this paper, we study the non-stationary online second price auction problem. We assume that the seller is selling the same type of items in $T$ rounds by the second price auction, and she can set the reserve price in each round. In each…
We provide a unifying way to analyze how risk aversion changes bidding in auctions by asking which bids become more attractive as bidders become more risk averse. In first-price auctions, under two payoff conditions--winning is never worse…
We consider the problem of learning optimal reserve price in repeated auctions against non-myopic bidders, who may bid strategically in order to gain in future rounds even if the single-round auctions are truthful. Previous algorithms,…
The progressive second-price auction of Lazar and Semret is a decentralized mechanism for the allocation and real-time pricing of a divisible resource. Our focus is on how delays in the receipt of bid messages, asynchronous analysis by…