English
Related papers

Related papers: Simple Mechanisms for Profit Maximization in Multi…

200 papers

Myerson derived a simple and elegant solution to the single-parameter revenue-maximization problem in his seminal work on optimal auction design assuming the usual model of quasi-linear utilities. In this paper, we consider a slight…

Computer Science and Game Theory · Computer Science 2016-01-27 Amy Greenwald , Takehiro Oyakawa , Vasilis Syrgkanis

A multi-product monopolist faces a buyer who is privately informed about his valuations for the goods. As is well-known, optimal mechanisms are in general complicated, while simple mechanisms -- such as pure bundling or separate sales --…

Theoretical Economics · Economics 2025-09-03 Mira Frick , Ryota Iijima , Yuhta Ishii

We study the problem of learning revenue-optimal multi-bidder auctions from samples when the samples of bidders' valuations can be adversarially corrupted or drawn from distributions that are adversarially perturbed. First, we prove tight…

Computer Science and Game Theory · Computer Science 2021-07-14 Wenshuo Guo , Michael I. Jordan , Manolis Zampetakis

A monopolist seller of multiple goods screens a buyer whose type is initially unknown to both but drawn from a commonly known distribution. The buyer privately learns about his type via a signal. We derive the seller's optimal mechanism in…

Theoretical Economics · Economics 2021-05-27 Rahul Deb , Anne-Katrin Roesler

A special case of Myerson's classic result describes the revenue-optimal equilibrium when a seller offers a single item to a buyer. We study a repeated sales extension of this model: a seller offers to sell a single fresh copy of an item to…

Computer Science and Game Theory · Computer Science 2019-03-12 Nikhil R. Devanur , Yuval Peres , Balasubramanian Sivan

We study the classic single-item auction setting of Myerson, but under the assumption that the buyers' values for the item are distributed over finite supports. Using strong LP duality and polyhedral theory, we rederive various key results…

Computer Science and Game Theory · Computer Science 2025-01-27 Yiannis Giannakopoulos , Johannes Hahn

This paper studies mechanism design for revenue maximization in a distribution-reporting setting, where the auctioneer does not know the buyers' true value distributions. Instead, each buyer reports and commits to a bid distribution in the…

Computer Science and Game Theory · Computer Science 2025-07-08 Xiaotie Deng , Yanru Guan , Ningyuan Li , Zihe Wang , Jie Zhang

We study multi-unit auctions in which bidders have limited knowledge of opponent strategies and values. We characterize optimal prior-free bids; these bids minimize the maximal loss in expected utility resulting from uncertainty surrounding…

Theoretical Economics · Economics 2023-05-02 Bernhard Kasberger , Kyle Woodward

In this paper, we consider the problem of designing incentive compatible auctions for multiple (homogeneous) units of a good, when bidders have private valuations and private budget constraints. When only the valuations are private and the…

Computer Science and Game Theory · Computer Science 2009-04-23 Sayan Bhattacharya , Vincent Conitzer , Kamesh Munagala , Lirong Xia

We consider the problem of designing a revenue-optimal mechanism in the two-item, single-buyer, unit-demand setting when the buyer's valuations, $(z_1, z_2)$, are uniformly distributed in an arbitrary rectangle $[c,c+b_1]\times[c,c+b_2]$ in…

Computer Science and Game Theory · Computer Science 2019-03-06 D. Thirumulanathan , Rajesh Sundaresan , Y Narahari

A seller is selling a pair of divisible complementary goods to an agent. The agent consumes the goods only in a specific ratio and freely disposes of excess in either goods. The value of the bundle and the ratio are private information of…

Theoretical Economics · Economics 2022-07-15 Komal Malik , Kolagani Paramahamsa

We study a natural combinatorial pricing problem for sequentially arriving buyers with equal budgets. Each buyer is interested in exactly one pair of items and purchases this pair if and only if, upon arrival, both items are still available…

Computer Science and Game Theory · Computer Science 2023-02-24 Christoph Dürr , Mathieu Mari , Ulrike Schmidt-Kraepelin

We study the bilateral trade problem: one seller, one buyer and a single, indivisible item for sale. It is well known that there is no fully-efficient and incentive compatible mechanism for this problem that maintains a balanced budget. We…

Computer Science and Game Theory · Computer Science 2018-11-20 Liad Blumrosen , Shahar Dobzinski

A seller with one unit of a good faces N\geq3 buyers and a single competitor who sells one other identical unit in a second-price auction with a reserve price. Buyers who do not get the seller's good will compete in the competitor's…

Theoretical Economics · Economics 2021-10-26 Kenneth Hendricks , Thomas Wiseman

Online auctions are one of the most fundamental facets of the modern economy and power an industry generating hundreds of billions of dollars a year in revenue. Auction theory has historically focused on the question of designing the best…

Computer Science and Game Theory · Computer Science 2021-09-23 Thomas Nedelec , Clément Calauzènes , Noureddine El Karoui , Vianney Perchet

We study gains from trade in multi-dimensional two-sided markets. Specifically, we focus on a setting with $n$ heterogeneous items, where each item is owned by a different seller $i$, and there is a constrained-additive buyer with…

Computer Science and Game Theory · Computer Science 2022-03-15 Yang Cai , Kira Goldner , Steven Ma , Mingfei Zhao

Consider a seller with m heterogeneous items for sale to a single additive buyer whose values for the items are arbitrarily correlated. It was previously shown that, in such settings, distributions exist for which the seller's optimal…

Computer Science and Game Theory · Computer Science 2018-12-03 Christos-Alexandros Psomas , Ariel Schvartzman , S. Matthew Weinberg

We examine information structure design, also called "persuasion" or "signaling", in the presence of a constraint on the amount of communication. We focus on the fundamental setting of bilateral trade, which in its simplest form involves a…

Computer Science and Game Theory · Computer Science 2020-03-09 Shaddin Dughmi , David Kempe , Ruixin Qiang

Bilateral trade is a fundamental economic scenario comprising a strategically acting buyer and seller, each holding valuations for the item, drawn from publicly known distributions. A mechanism is supposed to facilitate trade between these…

Computer Science and Game Theory · Computer Science 2017-10-24 Riccardo Colini-Baldeschi , Paul Goldberg , Bart de Keijzer , Stefano Leonardi , Stefano Turchetta

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