English
Related papers

Related papers: Nonparametric inference on counterfactuals in firs…

200 papers

Given a sample of bids from independent auctions, this paper examines the question of inference on auction fundamentals (e.g. valuation distributions, welfare measures) under weak assumptions on information structure. The question is…

Econometrics · Economics 2018-03-20 Vasilis Syrgkanis , Elie Tamer , Juba Ziani

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 instead build a…

Theoretical Economics · Economics 2021-07-02 Philippe Jehiel , Konrad Mierendorff

In digital goods auctions, there is an auctioneer who sells an item with unlimited supply to a set of potential buyers, and the objective is to design truthful auction to maximize the total profit of the auctioneer. Motivated from an…

Computer Science and Game Theory · Computer Science 2011-07-27 Nick Gravin , Pinyan Lu

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'…

Computer Science and Game Theory · Computer Science 2015-07-30 Hu Fu , Nicole Immolica , Brendan Lucier , Philipp Strack

We present a general framework for designing approximately revenue-optimal mechanisms for multi-item additive auctions, which applies to both truthful and non-truthful auctions. Given a (not necessarily truthful) single-item auction format…

Computer Science and Game Theory · Computer Science 2022-09-23 Constantinos Daskalakis , Maxwell Fishelson , Brendan Lucier , Vasilis Syrgkanis , Santhoshini Velusamy

We study the design of prior-independent auctions in a setting with heterogeneous bidders. In particular, we consider the setting of selling to $n$ bidders whose values are drawn from $n$ independent but not necessarily identical…

Computer Science and Game Theory · Computer Science 2023-11-08 Guru Guruganesh , Aranyak Mehta , Di Wang , Kangning Wang

Bidding in simultaneous auctions is challenging because an agent's value for a good in one auction may depend on the uncertain outcome of other auctions: the so-called exposure problem. Given the gap in understanding of general simultaneous…

Computer Science and Game Theory · Computer Science 2012-10-19 Michael P. Wellman , Eric Sodomka , Amy Greenwald

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…

Computer Science and Game Theory · Computer Science 2024-11-15 Gagan Aggarwal , Anupam Gupta , Andres Perlroth , Grigoris Velegkas

First-price auctions have many desirable properties, including uniquely possessing some, like credibility. However, first-price auctions are also inherently non-truthful, and non-truthfulness may result in instability and inefficiencies.…

Computer Science and Game Theory · Computer Science 2022-03-25 Johannes Brustle , Paul Dütting , Balasubramanian Sivan

Classic results show that even an arbitrarily small correlation across bidders' information can enable full surplus extraction in auctions and related mechanism design settings. Motivated by this fragility, we study the information…

Computer Science and Game Theory · Computer Science 2026-04-28 Boyu Liu , Wei Tang , Zihe Wang , Shuo Zhang

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…

Theoretical Economics · Economics 2026-02-23 Pasha Andreyanov , Ilia Krasikov , Alex Suzdaltsev

Inspired by Internet ad auction applications, we study the problem of allocating a single item via an auction when bidders place very different values on the item. We formulate this as the problem of prior-free auction and focus on…

Computer Science and Game Theory · Computer Science 2009-09-30 Vahab Mirrokni , S. Muthukrishnan , Uri Nadav

Automated bidding to optimize online advertising with various constraints, e.g. ROI constraints and budget constraints, is widely adopted by advertisers. A key challenge lies in designing algorithms for non-truthful mechanisms with ROI…

Computer Science and Game Theory · Computer Science 2025-10-21 Yuan Deng , Yilin Li , Wei Tang , Hanrui Zhang

We study a market for private data in which a data analyst publicly releases a statistic over a database of private information. Individuals that own the data incur a cost for their loss of privacy proportional to the differential privacy…

Computer Science and Game Theory · Computer Science 2012-10-01 Pranav Dandekar , Nadia Fawaz , Stratis Ioannidis

The paper studies the problem of auction design in a setting where the auctioneer accesses the knowledge of the valuation distribution only through statistical samples. A new framework is established that combines the statistical decision…

Econometrics · Economics 2022-02-22 Haitian Xie

We study how a budget-constrained bidder should learn to adaptively bid in repeated first-price auctions to maximize her cumulative payoff. This problem arose due to an industry-wide shift from second-price auctions to first-price auctions…

Computer Science and Game Theory · Computer Science 2026-04-14 Yige Wang , Jiashuo Jiang

We propose nonparametric identification and semiparametric estimation of joint potential outcome distributions in the presence of confounding. First, in settings with observed confounding, we derive tighter, covariate-informed bounds on the…

Methodology · Statistics 2026-02-19 Jianle Sun , Kun Zhang

We initiate the study of statistical inference and A/B testing for first-price pacing equilibria (FPPE). The FPPE model captures the dynamics resulting from large-scale first-price auction markets where buyers use pacing-based budget…

Statistics Theory · Mathematics 2023-06-30 Luofeng Liao , Christian Kroer

We consider the sample complexity of revenue maximization for multiple bidders in unrestricted multi-dimensional settings. Specifically, we study the standard model of $n$ additive bidders whose values for $m$ heterogeneous items are drawn…

Computer Science and Game Theory · Computer Science 2021-04-13 Yannai A. Gonczarowski , S. Matthew Weinberg

While nonparametric density estimators often perform well on low dimensional data, their performance can suffer when applied to higher dimensional data, owing presumably to the curse of dimensionality. One technique for avoiding this is to…

Statistics Theory · Mathematics 2020-10-07 Robert A. Vandermeulen