中文
相关论文

相关论文: A Tale of Two Monopolies

200 篇论文

We characterize optimal mechanisms for the multiple-good monopoly problem and provide a framework to find them. We show that a mechanism is optimal if and only if a measure $\mu$ derived from the buyer's type distribution satisfies certain…

计算机科学与博弈论 · 计算机科学 2017-09-07 Constantinos Daskalakis , Alan Deckelbaum , Christos Tzamos

Using duality theory techniques we derive simple, closed-form formulas for bounding the optimal revenue of a monopolist selling many heterogeneous goods, in the case where the buyer's valuations for the items come i.i.d. from a uniform…

计算机科学与博弈论 · 计算机科学 2015-10-14 Yiannis Giannakopoulos

This paper studies a monopolist selling multiple goods to a consumer with one-dimensional private types. I provide a sufficient condition under which the monopolist's problem is equivalent to finding the upper envelope of the marginal…

理论经济学 · 经济学 2025-10-28 Zhiming Feng

We consider a multiproduct monopoly pricing model. We provide sufficient conditions under which the optimal mechanism can be implemented via upgrade pricing -- a menu of product bundles that are nested in the strong set order. Our approach…

计算机科学与博弈论 · 计算机科学 2021-12-03 Dirk Bergemann , Alessandro Bonatti , Andreas Haupt , Alex Smolin

We provide sufficient conditions for revenue maximization in a two-good monopoly where the buyer's values for the items come from independent (but not necessarily identical) distributions over bounded intervals. Under certain distributional…

计算机科学与博弈论 · 计算机科学 2015-11-24 Yiannis Giannakopoulos , Elias Koutsoupias

This paper studies optimal bundling of products with non-additive values. Under monotonic preferences and single-peaked profits, I show a monopolist finds pure bundling optimal if and only if the optimal sales volume for the grand bundle is…

综合经济学 · 经济学 2022-04-22 Soheil Ghili

We consider optimal mechanism design for the case with one buyer and two items. The buyer's valuations towards the two items are independent and additive. In this setting, optimal mechanism is unknown for general valuation distributions. We…

计算机科学与博弈论 · 计算机科学 2014-04-30 Zihe Wang , Pingzhong Tang

Maximizing the revenue from selling _more than one_ good (or item) to a single buyer is a notoriously difficult problem, in stark contrast to the one-good case. For two goods, we show that simple "one-dimensional" mechanisms, such as…

计算机科学与博弈论 · 计算机科学 2022-09-22 Sergiu Hart , Noam Nisan

We study the revenue maximization problem of a seller with n heterogeneous items for sale to a single buyer whose valuation function for sets of items is unknown and drawn from some distribution D. We show that if D is a distribution over…

计算机科学与博弈论 · 计算机科学 2018-07-05 Aviad Rubinstein , S. Matthew Weinberg

Maximizing the revenue from selling two or more goods has been shown to require the use of $nonmonotonic$ mechanisms, where a higher-valuation buyer may pay less than a lower-valuation one. Here we show that the restriction to $monotonic$…

计算机科学与博弈论 · 计算机科学 2024-06-13 Ran Ben-Moshe , Sergiu Hart , Noam Nisan

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 --…

理论经济学 · 经济学 2025-09-03 Mira Frick , Ryota Iijima , Yuhta Ishii

Optimal mechanisms have been provided in quite general multi-item settings, as long as each bidder's type distribution is given explicitly by listing every type in the support along with its associated probability. In the implicit setting,…

计算机科学与博弈论 · 计算机科学 2015-03-09 Constantinos Daskalakis , Alan Deckelbaum , Christos Tzamos

We study revenue maximization by deterministic mechanisms for the simplest case for which Myerson's characterization does not hold: a single seller selling two items, with independently distributed values, to a single additive buyer. We…

计算机科学与博弈论 · 计算机科学 2018-04-20 Moshe Babaioff , Noam Nisan , Aviad Rubinstein

We consider a monopolist seller facing a single buyer with additive valuations over n heterogeneous, independent items. It is known that in this important setting optimal mechanisms may require randomization [HR12], use menus of infinite…

计算机科学与博弈论 · 计算机科学 2015-11-17 Aviad Rubinstein

When selling many goods with independent valuations, we develop a distributionally robust framework, consisting of a two-player game between seller and nature. The seller has only limited knowledge about the value distribution. The seller…

计算机科学与博弈论 · 计算机科学 2026-03-30 Tim S. G. van Eck , Pieter Kleer , Johan S. H. van Leeuwaarden

We study a classic Bayesian mechanism design setting of monopoly problem for an additive buyer in the presence of budgets. In this setting a monopolist seller with $m$ heterogeneous items faces a single buyer and seeks to maximize her…

计算机科学与博弈论 · 计算机科学 2018-10-09 Yu Cheng , Nick Gravin , Kamesh Munagala , Kangning Wang

We consider the design of a revenue-optimal mechanism when two items are available to be sold to a single buyer whose valuation is uniformly distributed over an arbitrary rectangle $[c_1,c_1+b_1]\times[c_2,c_2+b_2]$ in the positive…

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

The intuition that profit is optimized by maximizing marginal revenue is a guiding principle in microeconomics. In the classical auction theory for agents with linear utility and single-dimensional preferences, Bulow and Roberts (1989) show…

计算机科学与博弈论 · 计算机科学 2014-06-06 Saeed Alaei , Hu Fu , Nima Haghpanah , Jason Hartline

We study robustly optimal mechanisms for selling multiple items. The seller maximizes revenue against a worst-case distribution of a buyer's valuations within a set of distributions, called an "ambiguity" set. We identify the exact forms of…

理论经济学 · 经济学 2024-08-26 Yeon-Koo Che , Weijie Zhong

We consider a monopolist seller with $n$ heterogeneous items, facing a single buyer. The buyer has a value for each item drawn independently according to (non-identical) distributions, and her value for a set of items is additive. The…

计算机科学与博弈论 · 计算机科学 2020-08-03 Moshe Babaioff , Nicole Immorlica , Brendan Lucier , S. Matthew Weinberg
‹ 上一页 1 2 3 10 下一页 ›