中文
相关论文

相关论文: A Tale of Two Monopolies

200 篇论文

We consider a principal seller with $m$ heterogeneous products to sell to an additive buyer over independent items. The principal can offer an arbitrary menu of product bundles, but faces competition from smaller and more agile single-item…

计算机科学与博弈论 · 计算机科学 2024-06-21 Moshe Babaioff , Linda Cai , Brendan Lucier

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…

理论经济学 · 经济学 2022-02-16 Ethan Che

Myerson's seminal characterization of the revenue-optimal auction for a single item \cite{myerson1981optimal} remains a cornerstone of mechanism design. However, generalizing this framework to multi-item settings has proven exceptionally…

计算机科学与博弈论 · 计算机科学 2025-10-08 Marios Mertzanidis , Athina Terzoglou

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…

理论经济学 · 经济学 2022-07-15 Komal Malik , Kolagani Paramahamsa

We study revenue maximization in a buyer-seller setting where the seller has a single object and the buyer has both a private valuation and a private budget. Private budgets complicate the classic single-product monopoly problem, making…

计算机科学与博弈论 · 计算机科学 2026-04-30 Juan Carlos Carbajal , Ahuva Mualem

Multi-item revenue-optimal mechanisms are known to be extremely complex, often offering buyers randomized lotteries of goods. In the standard buy-one model, it is known that optimal mechanisms can yield revenue infinitely higher than that…

计算机科学与博弈论 · 计算机科学 2022-11-22 Sepehr Assadi , Vikram Kher , George Li , Ariel Schvartzman

We study optimal bundling when consumers differ in one dimension. We introduce a partial order on the set of bundles defined by (i) set inclusion and (ii) sales volumes (if sold alone and priced optimally). We show that if the undominated…

理论经济学 · 经济学 2023-04-11 Frank Yang

Problem definition: Traditional monopoly pricing assumes sellers have full information about consumer valuations. We consider monopoly pricing under limited information, where a seller only knows the mean, variance and support of the…

最优化与控制 · 数学 2026-03-30 Tim S. G. van Eck , Pieter Kleer , Johan S. H. van Leeuwaarden

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…

理论经济学 · 经济学 2021-05-27 Rahul Deb , Anne-Katrin Roesler

We consider a robust version of the revenue maximization problem, where a single seller wishes to sell $n$ items to a single unit-demand buyer. In this robust version, the seller knows the buyer's marginal value distribution for each item…

计算机科学与博弈论 · 计算机科学 2020-08-27 Moshe Babaioff , Michal Feldman , Yannai A. Gonczarowski , Brendan Lucier , Inbal Talgam-Cohen

An indivisible object may be sold to one of $n$ agents who know their valuations of the object. The seller would like to use a revenue-maximizing mechanism but her knowledge of the valuations' distribution is scarce: she knows only the…

理论经济学 · 经济学 2020-08-27 Alex Suzdaltsev

A sequence of recent studies show that even in the simple setting of a single seller and a single buyer with additive, independent valuations over $m$ items, the revenue-maximizing mechanism is prohibitively complex. This problem has been…

计算机科学与博弈论 · 计算机科学 2018-01-10 Michal Feldman , Ophir Friedler , Aviad Rubinstein

It is well-known that optimal (i.e., revenue-maximizing) selling mechanisms in multidimensional type spaces may involve randomization. We obtain conditions under which deterministic mechanisms are optimal for selling two identical,…

理论经济学 · 经济学 2022-02-22 Sushil Bikhchandani , Debasis Mishra

We consider a revenue-maximizing seller with $m$ heterogeneous items and a single buyer whose valuation $v$ for the items may exhibit both substitutes (i.e., for some $S, T$, $v(S \cup T) < v(S) + v(T)$) and complements (i.e., for some $S,…

计算机科学与博弈论 · 计算机科学 2017-04-11 Alon Eden , Michal Feldman , Ophir Friedler , Inbal Talgam-Cohen , S. Matthew Weinberg

In multi-item screening, optimal selling mechanisms are challenging to characterize and implement, even with full knowledge of valuation distributions. In this paper, we aim to develop tractable, interpretable, and implementable mechanisms…

理论经济学 · 经济学 2025-10-20 Shixin Wang

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…

计算机科学与博弈论 · 计算机科学 2019-03-06 D. Thirumulanathan , Rajesh Sundaresan , Y Narahari

We study the regulation of a monopolistic firm using a robust-design approach. We solve for the policy that minimizes the regulator's worst-case regret, where the regret is the difference between his complete-information payoff minus his…

理论经济学 · 经济学 2019-10-11 Yingni Guo , Eran Shmaya

We study monopoly regulation under asymmetric information about costs when subsidies are infeasible. A monopolist with privately known marginal cost serves a single product market and sets a price. The regulator maximizes a weighted welfare…

理论经济学 · 经济学 2026-02-09 Jiaming Wei , Dihan Zou

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…

计算机科学与博弈论 · 计算机科学 2024-06-21 Moshe Babaioff , Amitai Frey , Noam Nisan

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…

计算机科学与博弈论 · 计算机科学 2016-07-06 Itai Ashlagi , Constantinos Daskalakis , Nima Haghpanah