English
Related papers

Related papers: Inference on Auctions with Weak Assumptions on Inf…

200 papers

We provide efficient estimation methods for first- and second-price auctions under independent (asymmetric) private values and partial observability. Given a finite set of observations, each comprising the identity of the winner and the…

Computer Science and Game Theory · Computer Science 2022-05-05 Yeshwanth Cherapanamjeri , Constantinos Daskalakis , Andrew Ilyas , Manolis Zampetakis

We provide algorithms that learn simple auctions whose revenue is approximately optimal in multi-item multi-bidder settings, for a wide range of valuations including unit-demand, additive, constrained additive, XOS, and subadditive. We…

Computer Science and Game Theory · Computer Science 2017-09-04 Yang Cai , Constantinos Daskalakis

In this paper we design information elicitation mechanisms for Bayesian auctions. While in Bayesian mechanism design the distributions of the players' private types are often assumed to be common knowledge, information elicitation considers…

Computer Science and Game Theory · Computer Science 2018-06-27 Jing Chen , Bo Li , Yingkai Li

The main goal of this paper is to develop a theory of inference of player valuations from observed data in the generalized second price auction without relying on the Nash equilibrium assumption. Existing work in Economics on inferring…

Computer Science and Game Theory · Computer Science 2015-05-05 Denis Nekipelov , Vasilis Syrgkanis , Eva Tardos

This paper studies a simplicity notion in a mechanism design setting in which agents do not necessarily share a common prior. I develop a model in which agents participate in a prior-free game of (coarse) information acquisition followed by…

Theoretical Economics · Economics 2024-10-10 Joseph Feffer

One of the goals of probabilistic inference is to decide whether an empirically observed distribution is compatible with a candidate Bayesian network. However, Bayesian networks with hidden variables give rise to highly non-trivial…

Machine Learning · Statistics 2014-10-14 R. Chaves , L. Luft , T. O. Maciel , D. Gross , D. Janzing , B. Schölkopf

We introduce several new estimation methods that leverage shape constraints in auction models to estimate various objects of interest, including the distribution of a bidder's valuations, the bidder's ex ante expected surplus, and the…

Econometrics · Economics 2019-12-17 Joris Pinkse , Karl Schurter

In mechanism design, it is challenging to design the optimal auction with correlated values in general settings. Although value distribution can be further exploited to improve revenue, the complex correlation structure makes it hard to…

Computer Science and Game Theory · Computer Science 2023-02-21 Da Huo , Zhilin Zhang , Zhenzhe Zheng , Chuan Yu , Jian Xu , Fan Wu

We propose a novel statistical learning method for multi-item auctions that incorporates credible intervals. Our approach employs nonparametric density estimation to estimate credible intervals for bidder types based on historical data. We…

Computer Science and Game Theory · Computer Science 2026-03-10 Jiale Han , Xiaowu Dai

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

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

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 advance empirical equilibrium analysis (Velez and Brown, 2020, arXiv:1907.12408) of the winner-bid and loser-bid auctions for the dissolution of a partnership. We show, in a complete information environment, that even though these…

Theoretical Economics · Economics 2020-07-15 Rodrigo A. Velez , Alexander L. Brown

We perform a simulation-based analysis of keyword auctions modeled as one-shot games of incomplete information to study a series of mechanism design questions. Our first question addresses the degree to which incentive compatibility fails…

Computer Science and Game Theory · Computer Science 2012-05-14 Yevgeniy Vorobeychik

Auction data often contain information on only the most competitive bids as opposed to all bids. The usual measurement error approaches to unobserved heterogeneity are inapplicable due to dependence among order statistics. We bridge this…

Econometrics · Economics 2023-04-25 Yao Luo , Ruli Xiao

We experimentally evaluate the comparative performance of the winner-bid, average-bid, and loser-bid auctions for the dissolution of a partnership. The analysis of these auctions based on the empirical equilibrium refinement of Velez and…

General Economics · Economics 2020-07-15 Alexander L. Brown , Rodrigo A. Velez

Auction theory traditionally assumes that bidders' valuation distributions are known to the auctioneer, such as in the celebrated, revenue-optimal Myerson auction. However, this theory does not describe how the auctioneer comes to possess…

Computer Science and Game Theory · Computer Science 2014-07-11 Avrim Blum , Yishay Mansour , Jamie Morgenstern

Estimation of the covariance matrix of asset returns is crucial to portfolio construction. As suggested by economic theories, the correlation structure among assets differs between emerging markets and developed countries. It is therefore…

Methodology · Statistics 2021-09-28 Xin Chen , Dan Yang , Yan Xu , Yin Xia , Dong Wang , Haipeng Shen

Traditionally, the Bayesian optimal auction design problem has been considered either when the bidder values are i.i.d., or when each bidder is individually identifiable via her value distribution. The latter is a reasonable approach when…

Computer Science and Game Theory · Computer Science 2023-07-11 Nikhil R. Devanur , Zhiyi Huang , Christos-Alexandros Psomas

Many of the causal discovery methods rely on the faithfulness assumption to guarantee asymptotic correctness. However, the assumption can be approximately violated in many ways, leading to sub-optimal solutions. Although there is a line of…

Machine Learning · Computer Science 2022-01-19 Ignavier Ng , Yujia Zheng , Jiji Zhang , Kun Zhang
‹ Prev 1 2 3 10 Next ›