English
Related papers

Related papers: Nonparametric inference on counterfactuals in firs…

200 papers

In non-truthful auctions such as first-price and all-pay auctions, the independent strategic behaviors of bidders, with the corresponding Bayes-Nash equilibrium notion, are notoriously difficult to characterize and can cause undesirable…

Computer Science and Game Theory · Computer Science 2025-10-28 Hu Fu , Tao Lin

This paper shows how to identify and estimate the seller's risk parameter in an ascending auction. We consider a semiparametric model where the seller has a parametric utility function (such as CARA or CRRA) and the distribution of bidder…

Econometrics · Economics 2026-02-10 Nathalie Gimenes , Tonghui Qi , Sorawoot Srisuma

We study the problem of selling a good to a group of bidders with interdependent values in a prior-free setting. Each bidder has a signal that can take one of $k$ different values, and her value for the good is a weakly increasing function…

Computer Science and Game Theory · Computer Science 2021-07-21 Vasilis Gkatzelis , Rishi Patel , Emmanouil Pountourakis , Daniel Schoepflin

We focus on online second price auctions, where bids are made sequentially, and the winning bidder pays the maximum of the second-highest bid and a seller specified starting price. For many such auctions, the seller does not see all the…

Methodology · Statistics 2026-02-23 Sourav Mukherjee , Ziqian Yang , Rohit K Patra , Kshitij Khare

In this work we consider selling items using a sequential first price auction mechanism. We generalize the assumption of conservative bidding to extensive form games (henceforth optimistic conservative bidding), and show that for both…

Computer Science and Game Theory · Computer Science 2015-02-02 Avinatan Hassidim , Yishay Mansour

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

We consider a dynamic pricing problem for repeated contextual second-price auctions with multiple strategic buyers who aim to maximize their long-term time discounted utility. The seller has limited information on buyers' overall demand…

Machine Learning · Computer Science 2023-02-08 Negin Golrezaei , Patrick Jaillet , Jason Cheuk Nam Liang

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…

Machine Learning · Computer Science 2015-06-10 Mehryar Mohri , Andres Munoz Medina

In today's online advertising markets, it is common for advertisers to set long-term budgets. Correspondingly, advertising platforms adopt budget control methods to ensure that advertisers' payments lie within their budgets. Most budget…

Computer Science and Game Theory · Computer Science 2024-02-13 Zhaohua Chen , Mingwei Yang , Chang Wang , Jicheng Li , Zheng Cai , Yukun Ren , Zhihua Zhu , Xiaotie Deng

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…

Machine Learning · Statistics 2015-06-25 Maja R. Rudolph , Joseph G. Ellis , David M. Blei

In this paper, we study how a budget-constrained bidder should learn to bid adaptively in repeated first-price auctions to maximize cumulative payoff. This problem arises from the recent industry-wide shift from second-price auctions to…

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

The first-price auction is popular in practice for its simplicity and transparency. Moreover, its potential virtues grow in complex settings where incentive compatible auctions may generate little or no revenue. Unfortunately, the…

Computer Science and Game Theory · Computer Science 2013-04-30 Darrell Hoy , Kamal Jain , Christopher A. Wilkens

The paper proposes a parsimonious and flexible semiparametric quantile regression specification for asymmetric bidders within the independent private value framework. Asymmetry is parameterized using powers of a parent private value…

Econometrics · Economics 2020-09-21 Jayeeta Bhattacharya , Nathalie Gimenes , Emmanuel Guerre

We study decision-making problems where data comprises points from a collection of binary polytopes, capturing aggregate information stemming from various combinatorial selection environments. We propose a nonparametric approach for…

Optimization and Control · Mathematics 2026-02-24 Yanqiu Ruan , Karthyek Murthy , Karthik Natarajan

A central problem in Microeconomics is to design auctions with good revenue properties. In this setting, the bidders' valuations for the items are private knowledge, but they are drawn from publicly known prior distributions. The goal is to…

Computer Science and Game Theory · Computer Science 2013-01-11 Sayan Bhattacharya , Janardhan Kulkarni , Xiaoming Xu

Simultaneous ascending auctions present agents with the exposure problem: bidding to acquire a bundle risks the possibility of obtaining an undesired subset of the goods. Auction theory provides little guidance for dealing with this…

Computer Science and Game Theory · Computer Science 2012-07-09 Anna Osepayshvili , Michael P. Wellman , Daniel Reeves , Jeffrey K. MacKie-Mason

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…

Theoretical Economics · Economics 2022-11-24 Sosung Baik , Sung-Ha Hwang

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…

Theoretical Economics · Economics 2022-02-16 Ethan Che

This paper considers prior-independent mechanism design, namely identifying a single mechanism that has near optimal performance on every prior distribution. We show that mechanisms with truthtelling equilibria, a.k.a., revelation…

Computer Science and Game Theory · Computer Science 2018-08-01 Yiding Feng , Jason D. Hartline

The problem of pricing Bermudan options using Monte Carlo and a nonparametric regression is considered. We derive optimal non-asymptotic bounds for a lower biased estimate based on the suboptimal stopping rule constructed using some…

Pricing of Securities · Quantitative Finance 2009-08-03 Denis Belomestny