中文
相关论文

相关论文: The Better Half of Selling Separately

200 篇论文

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

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 k items to a single buyer with known valuation distributions. We show that for a single, additive buyer whose valuations for for the items are distributed according to i.i.d.…

计算机科学与博弈论 · 计算机科学 2016-11-30 Ron Kupfer

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 reexamines the classic problem of revenue maximization in single-item auctions with $n$ buyers under the lens of the robust optimization framework. The celebrated Myerson's mechanism is the format that maximizes the seller's…

计算机科学与博弈论 · 计算机科学 2024-09-16 Nick Gravin , Zhiqi 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 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

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…

计算机科学与博弈论 · 计算机科学 2019-03-12 Nikhil R. Devanur , Yuval Peres , Balasubramanian Sivan

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

We consider the well known, and notoriously difficult, problem of a single revenue-maximizing seller selling two or more heterogeneous goods to a single buyer whose private values for the goods are drawn from a (possibly correlated) known…

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

We consider a price competition between two sellers of perfect-complement goods. Each seller posts a price for the good it sells, but the demand is determined according to the sum of prices. This is a classic model by Cournot (1838), who…

计算机科学与博弈论 · 计算机科学 2017-06-02 Moshe Babaioff , Liad Blumrosen , Noam Nisan

Bilateral trade is one of the most natural and important forms of economic interaction: A seller has a single, indivisible item for sale, and a buyer is potentially interested. The two parties typically have different, privately known…

计算机科学与博弈论 · 计算机科学 2023-12-20 Yixuan Even Xu , Hanrui Zhang , Vincent Conitzer

We provide a new, much simplified and straightforward proof to a result of Pavlov [2011] regarding the revenue maximizing mechanism for selling two goods with uniformly i.i.d. valuations over intervals $[c,c+1]$, to an additive buyer. This…

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

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

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 seminal theorem of Myerson and Satterthwaite (1983) proves that, in a game of bilateral trade between a single buyer and a single seller, no mechanism can be simultaneously individually-rational, budget-balanced, incentive-compatible and…

计算机科学与博弈论 · 计算机科学 2017-11-23 Erel Segal-Halevi , Avinatan Hassidim

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

I study the optimal allocation of positional goods in the presence of externalities arising from consumers' concerns about relative consumption. Applications include luxury goods, priority services, education, and organizational…

理论经济学 · 经济学 2025-10-10 Peiran Xiao

We study the two-agent single-item bilateral trade. Ideally, the trade should happen whenever the buyer's value for the item exceeds the seller's cost. However, the classical result of Myerson and Satterthwaite showed that no mechanism can…

计算机科学与博弈论 · 计算机科学 2022-05-03 Yumou Fei
‹ 上一页 1 2 3 10 下一页 ›