English
Related papers

Related papers: Limits of Efficiency in Sequential Auctions

200 papers

The internet advertising market is a multi-billion dollar industry, in which advertisers buy thousands of ad placements every day by repeatedly participating in auctions. An important and ubiquitous feature of these auctions is the presence…

Computer Science and Game Theory · Computer Science 2022-10-11 Santiago Balseiro , Christian Kroer , Rachitesh Kumar

Mature internet advertising platforms offer high-level campaign management tools to help advertisers run their campaigns, often abstracting away the intricacies of how each ad is placed and focusing on aggregate metrics of interest to…

Computer Science and Game Theory · Computer Science 2021-09-07 Vincent Conitzer , Christian Kroer , Debmalya Panigrahi , Okke Schrijvers , Eric Sodomka , Nicolas E. Stier-Moses , Chris Wilkens

In a multiple-object auction, every bidder tries to win as many objects as possible with a bidding algorithm. This paper studies position-randomized auctions, which form a special class of multiple-object auctions where a bidding algorithm…

Computational Engineering, Finance, and Science · Computer Science 2007-05-23 Yuyu Chen , Ming-Yang Kao , Hsueh-I Lu

In non-truthful auctions, agents' utility for a strategy depends on the strategies of the opponents and also the prior distribution over their private types; the set of Bayes Nash equilibria generally has an intricate dependence on the…

Computer Science and Game Theory · Computer Science 2022-11-02 Hu Fu , Tao Lin

This paper studies an environment of simultaneous, separate, first-price auctions for complementary goods. Agents observe private values of each good before making bids, and the complementarity between goods is explicitly incorporated in…

Trading and Market Microstructure · Quantitative Finance 2013-12-11 Wiroy Shin

We study the optimal auction design problem when bidders' preferences follow the maxmin expected utility model. We suppose that each bidder's set of priors consists of beliefs close to the seller's belief, where "closeness" is defined by a…

Theoretical Economics · Economics 2021-10-19 Sosung Baik , Sung-Ha Hwang

Revenue-optimal auction design is a challenging problem with significant theoretical and practical implications. Sequential auction mechanisms, known for their simplicity and strong strategyproofness guarantees, are often limited by…

Computer Science and Game Theory · Computer Science 2024-07-12 Sai Srivatsa Ravindranath , Zhe Feng , Di Wang , Manzil Zaheer , Aranyak Mehta , David C. Parkes

The all-pay auction, a classic competitive model, is widely applied in scenarios such as political elections, sports competitions, and research and development, where all participants pay their bids regardless of winning or losing. However,…

Theoretical Economics · Economics 2025-07-24 Yan Liu , Ying Qin , Zihe Wang

Motivated by Carbon Emissions Trading Schemes, Treasury Auctions, Procurement Auctions, and Wholesale Electricity Markets, which all involve the auctioning of homogeneous multiple units, we consider the problem of learning how to bid in…

Computer Science and Game Theory · Computer Science 2024-11-12 Rigel Galgana , Negin Golrezaei

In this paper, we derive bounds for profit maximizing prior-free procurement auctions where a buyer wishes to procure multiple units of a homogeneous item from n sellers who are strategic about their per unit valuation. The buyer earns the…

Computer Science and Game Theory · Computer Science 2015-04-07 Arupratan Ray , Debmalya Mandal , Y. Narahari

In markets with budget-constrained buyers, competitive equilibria need not be efficient in the utilitarian sense, or maximise the seller's revenue. We consider a setting with multiple divisible goods. Competitive equilibrium outcomes, and…

Theoretical Economics · Economics 2025-04-09 Simon Finster , Paul W. Goldberg , Edwin Lock

We study revenue variance in the sale of $k$ homogeneous items to risk-neutral, unit-demand bidders with independent private values. Although the Revenue Equivalence Theorem implies that standard auctions generate the same expected revenue,…

Computer Science and Game Theory · Computer Science 2026-02-16 Marek Bojko , Preston McAfee , Renato Paes Leme , Balasubramanian Sivan , Sergei Vassilvitskii

Generating good revenue is one of the most important problems in Bayesian auction design, and many (approximately) optimal dominant-strategy incentive compatible (DSIC) Bayesian mechanisms have been constructed for various auction settings.…

Computer Science and Game Theory · Computer Science 2020-08-07 Jing Chen , Bo Li , Yingkai Li , Pinyan Lu

We study multi-unit auctions in which bidders have limited knowledge of opponent strategies and values. We characterize optimal prior-free bids; these bids minimize the maximal loss in expected utility resulting from uncertainty surrounding…

Theoretical Economics · Economics 2023-05-02 Bernhard Kasberger , Kyle Woodward

We study the liquid welfare in sequential first-price auctions with budget-limited buyers. We focus on first-price auctions, which are increasingly commonly used in many settings, and consider liquid welfare, a natural and well-studied…

Computer Science and Game Theory · Computer Science 2024-05-15 Giannis Fikioris , Éva Tardos

We study individual rational, Pareto optimal, and incentive compatible mechanisms for auctions with heterogeneous items and budget limits. For multi-dimensional valuations we show that there can be no deterministic mechanism with these…

Computer Science and Game Theory · Computer Science 2012-10-01 Paul Duetting , Monika Henzinger , Martin Starnberger

Equilibrium problems in Bayesian auction games can be described as systems of differential equations. Depending on the model assumptions, these equations might be such that we do not have a rigorous mathematical solution theory. The lack of…

Computer Science and Game Theory · Computer Science 2024-12-18 Martin Bichler , Stephan B. Lunowa , Matthias Oberlechner , Fabian R. Pieroth , Barbara Wohlmuth

The declining price anomaly states that the price weakly decreases when multiple copies of an item are sold sequentially over time. The anomaly has been observed in a plethora of practical applications. On the theoretical side, Gale and…

Computer Science and Game Theory · Computer Science 2019-05-03 Vishnu V. Narayan , Enguerrand Prebet , Adrian Vetta

We study the aggregate welfare and individual regret guarantees of dynamic \emph{pacing algorithms} in the context of repeated auctions with budgets. Such algorithms are commonly used as bidding agents in Internet advertising platforms,…

Computer Science and Game Theory · Computer Science 2026-01-06 Jason Gaitonde , Yingkai Li , Bar Light , Brendan Lucier , Aleksandrs Slivkins

In many first-price auctions, bidders face considerable strategic uncertainty: They cannot perfectly anticipate the other bidders' bidding behavior. We propose a model in which bidders do not know the entire distribution of opponent bids…

Theoretical Economics · Economics 2022-03-30 Bernhard Kasberger