中文
相关论文

相关论文: A Note on the Ratio of Revenues Between Selling in…

200 篇论文

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 consider the problem of maximizing revenue when selling 2 items to a single buyer with known valuation distributions. Hart and Nisan showed that selling each item separately using the optimal Myerson's price, gains at least half of the…

计算机科学与博弈论 · 计算机科学 2017-12-12 Ron Kupfer

We study the problem of characterizing revenue optimal auctions for single-minded buyers. Each buyer is interested only in a specific bundle of items and has a value for the same. Both his bundle and its value are his private information.…

计算机科学与博弈论 · 计算机科学 2010-09-14 Vineet Abhishek , Bruce Hajek

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

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

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

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

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

A retailer is purchasing goods in bundles from suppliers and then selling these goods in bundles to customers; her goal is to maximize profit, which is the revenue obtained from selling goods minus the cost of purchasing those goods. In…

数据结构与算法 · 计算机科学 2025-08-01 Yossi Azar , Niv Buchbinder , Roie Levin , Or Vardi

We study the problem of selling $n$ items to a single buyer with an additive valuation function. We consider the valuation of the items to be correlated, i.e., desirabilities of the buyer for the items are not drawn independently. Ideally,…

计算机科学与博弈论 · 计算机科学 2015-07-23 MohammadHossein Bateni , Sina Dehghani , MohammadTaghi Hajiaghayi , Saeed Seddighin

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

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

Separate selling of two independent goods is shown to yield at least 62% of the optimal revenue, and at least 73% when the goods satisfy the Myerson regularity condition. This improves the 50% result of Hart and Nisan (2017, originally…

计算机科学与博弈论 · 计算机科学 2022-09-23 Sergiu Hart , Philip J. Reny

We study the mechanism design problem of selling $k$ items to unit-demand buyers with private valuations for the items. A buyer either participates directly in the auction or is represented by an intermediary, who represents a subset of…

计算机科学与博弈论 · 计算机科学 2021-11-23 Gagan Aggarwal , Kshipra Bhawalkar , Guru Guruganesh , Andres Perlroth

We consider an auction of identical digital goods to customers whose valuations are drawn independently from known distributions. Myerson's classic result identifies the truthful mechanism that maximizes the seller's expected profit. Under…

计算机科学与博弈论 · 计算机科学 2012-04-05 Elchanan Mossel , Omer Tamuz

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 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 a revenue optimizing seller selling a single item to a buyer, on whose private value the seller has a noisy signal. We show that, when the signal is kept private, arbitrarily more revenue could potentially be extracted than if…

计算机科学与博弈论 · 计算机科学 2017-07-20 Hu Fu , Chris Liaw , Pinyan Lu , Zhihao Gavin Tang

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

Very few exact solutions are known for the monopolist's $k$-item $n$-buyer maximum revenue problem with additive valuation in which $k, n >1$ and the buyers $i$ have independent private distributions $F^j_i$ on items $j$. In this paper we…

计算机科学与博弈论 · 计算机科学 2016-07-14 Andrew Chi-Chih Yao
‹ 上一页 1 2 3 10 下一页 ›