English
Related papers

Related papers: Private Private Information in Second-Price Auctio…

200 papers

I establish nonparametric identification results in first- and second-price auctions when transaction prices are truncated by a binding reserve price under a range of information structures. When the number of potential bidders is fixed and…

Econometrics · Economics 2025-10-09 Tonghui Qi

We study revenue maximization in multi-item auctions, where bidders have subadditive valuations over independent items. Providing a simple mechanism that is approximately revenue-optimal in this setting is a major open problem in mechanism…

Computer Science and Game Theory · Computer Science 2023-10-13 Yang Cai , Ziyun Chen , Jinzhao Wu

We study the problem of designing a two-sided market (double auction) to maximize the gains from trade (social welfare) under the constraints of (dominant-strategy) incentive compatibility and budget-balance. Our goal is to do so for an…

Computer Science and Game Theory · Computer Science 2024-06-21 Moshe Babaioff , Amitai Frey , Noam Nisan

This paper analyzes repeated version of the bilateral trade model where the independent payoff relevant private information of the buyer and the seller is correlated across time. Using this setup it makes the following five contributions.…

Theoretical Economics · Economics 2022-02-10 Rohit Lamba

How do consultants price expertise? This paper studies a problem of selling information products (expertise) to a buyer (client) who faces decision-making problem under uncertainty. The client is privately informed about the type of…

Theoretical Economics · Economics 2024-05-21 Klajdi Hoxha

We develop multiattribute auctions that accommodate generalized additive independent (GAI) preferences. We propose an iterative auction mechanism that maintains prices on potentially overlapping GAI clusters of attributes, thus decreases…

Computer Science and Game Theory · Computer Science 2014-01-17 Yagil Engel , Michael P. Wellman

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

We study auctions with severe bounds on the communication allowed: each bidder may only transmit t bits of information to the auctioneer. We consider both welfare- and profit-maximizing auctions under this communication restriction. For…

Computer Science and Game Theory · Computer Science 2011-10-13 L. Blumrosen , N. Nisan , I. Segal

We study the Bayesian coarse correlated equilibrium (BCCE) of continuous and discretised first-price and all-pay auctions under the standard symmetric independent private-values model. Our study is motivated by the question of how the…

Computer Science and Game Theory · Computer Science 2024-11-19 Mete Şeref Ahunbay , Martin Bichler

We study the problem of repeatedly auctioning off an item to one of $k$ bidders where: a) bidders have a per-round individual rationality constraint, b) bidders may leave the mechanism at any point, and c) the bidders' valuations are…

Computer Science and Game Theory · Computer Science 2021-03-03 Mark Braverman , Jon Schneider , S. Matthew Weinberg

Information disclosure can compromise privacy when revealed information is correlated with private information. We consider the notion of inferential privacy, which measures privacy leakage by bounding the inferential power a Bayesian…

Cryptography and Security · Computer Science 2024-12-16 Shuaiqi Wang , Shuran Zheng , Zinan Lin , Giulia Fanti , Zhiwei Steven Wu

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

A monopolistic seller aims to sell an indivisible item to multiple potential buyers. Each buyer's valuation depends on their private type and the item's quality. The seller can observe the quality but it is unknown to buyers. This quality…

Computer Science and Game Theory · Computer Science 2024-11-13 Zhikang Fan , Weiran Shen

In this paper we study the implementation challenge in an abstract interdependent values model and an arbitrary objective function. We design a mechanism that allows for approximate optimal implementation of insensitive objective functions…

Computer Science and Game Theory · Computer Science 2015-03-14 Kobbi Nissim , Rann Smorodinsky , Moshe Tennenholtz

We study risk-free bidding strategies in combinatorial auctions with incomplete information. Specifically, what is the maximum profit that a complement-free (subadditive) bidder can guarantee in a multi-item combinatorial auction? Suppose…

Computer Science and Game Theory · Computer Science 2021-11-30 Vishnu V. Narayan , Gautam Rayaprolu , Adrian Vetta

We study a single-buyer pricing problem with unreliable side information, motivated by the increasing use of AI-assisted decision-making and LLM-based predictions. The seller observes a private sample that may be either accurate (coinciding…

Computer Science and Game Theory · Computer Science 2026-04-06 Zhihao Gavin Tang , Yixin Tao , Shixin Wang

Auctions have been proposed as a way to provide economic incentives for primary users to dynamically allocate unused spectrum to other users in need of it. Previously proposed schemes do not take into account the fact that the power…

Computer Science and Game Theory · Computer Science 2014-12-24 Deepan Palguna , David J. Love , Ilya Pollak

Traditional economic models typically treat private information, or signals, as generated from some underlying state. Recent work has explicated alternative models, where signals correspond to interpretations of available information. We…

Computer Science and Game Theory · Computer Science 2012-02-20 Michael P. Wellman , Lu Hong , Scott E. Page

This paper studies inference in first-price and second-price sealed-bid auctions with many bidders, using an asymptotic framework where the number of bidders increases while the number of auctions remains fixed. Our approach enables…

Econometrics · Economics 2026-04-28 Federico A. Bugni , Yulong Wang

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