English
Related papers

Related papers: A Simple Mechanism for a Budget-Constrained Buyer

200 papers

Classical optimal auction theory assumes that bids reach the seller directly. We study how this picture changes when a revenue-maximizing intermediary controls access to the seller's auction. Motivated by blockchain auctions, online…

Computer Science and Game Theory · Computer Science 2026-05-22 Jingyi Liu , Aviad Rubinstein , Ertem Nusret Tas , S. Matthew Weinberg , Qianfan Zhang

Robust mechanism design is a rising alternative to Bayesian mechanism design, which yields designs that do not rely on assumptions like full distributional knowledge. We apply this approach to mechanisms for selling a single item, assuming…

Computer Science and Game Theory · Computer Science 2022-05-24 Nir Bachrach , Inbal Talgam-Cohen

We study the limits of an information intermediary in the classical Bayesian auction, where a revenue-maximizing seller sells one item to $n$ buyers with independent private values. In addition, we have an intermediary who knows the buyers'…

Computer Science and Game Theory · Computer Science 2022-05-20 Reza Alijani , Siddhartha Banerjee , Kamesh Munagala , Kangning Wang

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

Finding the optimal (revenue-maximizing) mechanism to sell multiple items has been a prominent and notoriously difficult open problem. Existing work has mainly focused on deriving analytical results tailored to a particular class of…

Theoretical Economics · Economics 2026-01-09 Kento Hashimoto , Keita Kuwahara , Reo Nonaka

The assortment problem in revenue management is the problem of deciding which subset of products to offer to consumers in order to maximise revenue. A simple and natural strategy is to select the best assortment out of all those that are…

Data Structures and Algorithms · Computer Science 2019-02-22 Gerardo Berbeglia , Gwenaël Joret

We consider a revenue-maximizing single seller with $m$ items for sale to a single buyer whose value $v(\cdot)$ for the items is drawn from a known distribution $D$ of support $k$. A series of works by Cai et al. establishes that when each…

Computer Science and Game Theory · Computer Science 2020-07-13 Natalie Collina , S. Matthew Weinberg

Selling a single item to $n$ self-interested buyers is a fundamental problem in economics, where the two objectives typically considered are welfare maximization and revenue maximization. Since the optimal mechanisms are often impractical…

Computer Science and Game Theory · Computer Science 2024-11-06 Billy Jin , Thomas Kesselheim , Will Ma , Sahil Singla

We develop efficient algorithms to construct utility maximizing mechanisms in the presence of risk averse players (buyers and sellers) in Bayesian settings. We model risk aversion by a concave utility function, and players play…

Computer Science and Game Theory · Computer Science 2012-06-28 Anand Bhalgat , Tanmoy Chakraborty , Sanjeev Khanna

We study the problem of selling identical goods to n unit-demand bidders in a setting in which the total supply of goods is unknown to the mechanism. Items arrive dynamically, and the seller must make the allocation and payment decisions…

Computer Science and Game Theory · Computer Science 2009-05-22 Moshe Babaioff , Liad Blumrosen , Aaron L. Roth

We study the power of price discrimination via an intermediary in bilateral trade, when there is a revenue-maximizing seller selling an item to a buyer with a private value drawn from a prior. Between the seller and the buyer, there is an…

Computer Science and Game Theory · Computer Science 2023-04-28 Shao-Heng Ko , Kamesh Munagala

A monopolist sells multiple goods to an uninformed buyer. The buyer chooses to learn any one-dimensional linear signal of their values for the goods, anticipating the seller's mechanism. The seller designs an optimal mechanism, anticipating…

Theoretical Economics · Economics 2025-09-23 Agathe Pernoud , Frank Yang

In the quest for market mechanisms that are easy to implement, yet close to optimal, few seem as viable as posted pricing. Despite the growing body of impressive results, the performance of most posted price mechanisms however, rely…

Computer Science and Game Theory · Computer Science 2016-09-23 Shreyas Sekar

We show that the mechanism-design problem for a monopolist selling multiple, heterogeneous objects to a buyer with ex ante symmetric and additive values is equivalent to the mechanism-design problem for a monopolist selling identical…

Theoretical Economics · Economics 2024-08-20 Sushil Bikhchandani , Debasis Mishra

We study multi-item profit maximization when there is an underlying distribution over buyers' values. In practice, a full description of the distribution is typically unavailable, so we study the setting where the mechanism designer only…

Machine Learning · Computer Science 2023-05-09 Maria-Florina Balcan , Tuomas Sandholm , Ellen Vitercik

We study a repeated trading problem in which a mechanism designer facilitates trade between a single seller and multiple buyers. Our model generalizes the classic bilateral trade setting to a multi-buyer environment. Specifically, the…

Computer Science and Game Theory · Computer Science 2025-03-04 Anna Lunghi , Matteo Castiglioni , Alberto Marchesi

We consider a monopoly information holder selling information to a budget-constrained decision maker, who may benefit from the seller's information. The decision maker has a utility function that depends on his action and an uncertain state…

Computer Science and Game Theory · Computer Science 2020-02-18 Yiling Chen , Haifeng Xu , Shuran Zheng

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

A fundamental economic question is that of designing revenue-maximizing mechanisms in dynamic environments. This paper considers a simple yet compelling market model to tackle this question, where forward-looking buyers arrive at the market…

Theoretical Economics · Economics 2024-10-16 Jose Correa , Andres Cristi , Laura Vargas Koch

We provide a characterization of revenue-optimal dynamic mechanisms in settings where a monopolist sells k items over k periods to a buyer who realizes his value for item i in the beginning of period i. We require that the mechanism…

Computer Science and Game Theory · Computer Science 2016-07-06 Itai Ashlagi , Constantinos Daskalakis , Nima Haghpanah
‹ Prev 1 4 5 6 7 8 10 Next ›