Correlation-Robust Optimal Auctions
I study the design of auctions in which the auctioneer is assumed to have information only about the marginal distribution of a generic bidder's valuation, but does not know the correlation structure of the joint distribution of bidders' valuations. I assume that a generic bidder's valuation is bounded and $\bar{v}$ is the maximum valuation of a generic bidder. The performance of a mechanism is evaluated in the worst case over the uncertainty of joint distributions that are consistent with the marginal distribution. For the two-bidder case, the second-price auction with the uniformly distributed random reserve maximizes the worst-case expected revenue across all dominant-strategy mechanisms under certain regularity conditions. For the $N$-bidder ($N\ge3$) case, the second-price auction with the $\bar{v}-$scaled $Beta (\frac{1}{N-1},1)$ distributed random reserve maximizes the worst-case expected revenue across standard (a bidder whose bid is not the highest will never be allocated) dominant-strategy mechanisms under certain regularity conditions. When the probability mass condition (part of the regularity conditions) does not hold, the second-price auction with the $s^*-$scaled $Beta (\frac{1}{N-1},1)$ distributed random reserve maximizes the worst-case expected revenue across standard dominant-strategy mechanisms, where $s^*\in (0,\bar{v})$.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Auction Design with Data-Driven Misspecifications
We consider auction environments in which at the time of the auction bidders observe signals about their ex-post value. We introduce a model of novice bidders who do not know know the joint distribution of signals and in…
Enhancing Affine Maximizer Auctions with Correlation-Aware Payment
Affine Maximizer Auctions (AMAs), a generalized mechanism family from VCG, are widely used in automated mechanism design due to their inherent dominant-strategy incentive compatibility (DSIC) and individual rationality (…
Recurring Auctions with Costly Entry: Theory and Evidence
Recurring auctions are ubiquitous for selling durable assets like artworks and homes, with follow-up auctions held for unsold items. We investigate such auctions theoretically and empirically. Theoretical analysis demons…
Optimal Bidding Strategy for Maker Auctions
The Maker Protocol is a decentralized finance application that enables collateralized lending. The application uses open-bid, second-price auctions to complete its loan liquidation process. In this paper, we develop a bi…
On the Pseudo-Dimension of Nearly Optimal Auctions
This paper develops a general approach, rooted in statistical learning theory, to learning an approximately revenue-maximizing auction from data. We introduce t-level auctions to interpolate between simple auctions, such…
Learning Theory