arXiv subjects

Alex Suzdaltsev

Publications and source records attributed to Alex Suzdaltsev.

4 recordsLinked to original sources

arXiv2026

Reduced Forms: Feasibility, Extremality, Optimality

We study independent private values auction environments in which the auctioneer's revenue depends nonlinearly on bidders' interim winning probabilities. Our framework accommodates heterogeneity among bidders and places no ad hoc constraints on the mechanisms available to the auctioneer. Within this general setting, we show that feasibility of interim winning probabilities can be tested along a unidimensional curve -- the principal curve -- and use this insight to explicitly characterize the extreme points of the feasible set. We then combine our results on feasibility and extremality to solve for the optimal auction under a natural regularity condition. We show that the optimal mechanism allocates the good based on principal virtual values, which extend Myerson's virtual values to nonlinear settings and are constructed to equalize bidders' marginal revenue along the principal curve. We apply our approach to the classical linear model, settings with endogenous valuations due to ex ante investments, and settings with non-expected utility preferences, where previous results were largely limited either to symmetric environments with symmetric allocations or to two-bidder environments.

econ.TH↗

arXiv2024

Scoring and Favoritism in Optimal Procurement Design

We study buyer-optimal procurement mechanisms when quality is contractible. When some costs are borne by every participant of a procurement auction regardless of winning, the classic analysis should be amended. We show that an optimal symmetric mechanism is a scoring auction with a score function that may be either flatter or steeper than classically. This depends on the relative degrees of information asymmetry over the all-pay and winner-pay costs. However, the symmetry of the optimal mechanism is not granted due to the presence of all-pay costs. When ex-post efficiency is less important than the duplication of costs, favoritism becomes optimal. We show that, depending on the degree of convexity of costs, the solution takes one of two novel formats with a partially asymmetric treatment of firms, which we call a score floor and a score ceiling auction. Interestingly, these auctions feature side payments from or to the buyer, which has nothing to do with corruption.

econ.TH↗

arXiv2020

An Optimal Distributionally Robust Auction

An indivisible object may be sold to one of $n$ agents who know their valuations of the object. The seller would like to use a revenue-maximizing mechanism but her knowledge of the valuations' distribution is scarce: she knows only the means (which may be different) and an upper bound for valuations. Valuations may be correlated. Using a constructive approach based on duality, we prove that a mechanism that maximizes the worst-case expected revenue among all deterministic dominant-strategy incentive compatible, ex post individually rational mechanisms is such that the object should be awarded to the agent with the highest linear score provided it is nonnegative. Linear scores are bidder-specific linear functions of bids. The set of optimal mechanisms includes other mechanisms but all those have to be close to the optimal linear score auction in a certain sense. When means are high, all optimal mechanisms share the linearity property. Second-price auction without a reserve is an optimal mechanism when the number of symmetric bidders is sufficiently high.

econ.TH↗

arXiv2020

Distributionally Robust Pricing in Independent Private Value Auctions

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. Using an indirect technique, we prove that it is always optimal to set the reserve price to the seller's own valuation. However, the maxmin reserve price may not be unique. If the number of bidders is sufficiently high, all prices below the seller's valuation, including zero, are also optimal. A second-price auction with the reserve equal to seller's value (or zero) is an asymptotically optimal mechanism (among all ex post individually rational mechanisms) as the number of bidders grows without bound.

econ.TH↗