English
Related papers

Related papers: The Root of Revenue Continuity

200 papers

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…

Computer Science and Game Theory · Computer Science 2018-07-05 Aviad Rubinstein , S. Matthew Weinberg

We obtain revenue guarantees for the simple pricing mechanism of a single posted price, in terms of a natural parameter of the distribution of buyers' valuations. Our revenue guarantee applies to the single item n buyers setting, with…

Computer Science and Game Theory · Computer Science 2015-06-02 Balasubramanian Sivan , Vasilis Syrgkanis , Omer Tamuz

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

Computer Science and Game Theory · Computer Science 2015-07-23 MohammadHossein Bateni , Sina Dehghani , MohammadTaghi Hajiaghayi , Saeed Seddighin

Consider a monopolist selling $n$ items to an additive buyer whose item values are drawn from independent distributions $F_1,F_2,\ldots,F_n$ possibly having unbounded support. Unlike in the single-item case, it is well known that the…

Computer Science and Game Theory · Computer Science 2021-04-13 Moshe Babaioff , Yannai A. Gonczarowski , Noam Nisan

Along with substantial progress made recently in designing near-optimal mechanisms for multi-item auctions, interesting structural questions have also been raised and studied. In particular, is it true that the seller can always extract…

Computer Science and Game Theory · Computer Science 2017-09-12 Andrew Chi-Chih Yao

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…

Computer Science and Game Theory · Computer Science 2022-09-23 Sergiu Hart , Noam Nisan

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…

Computer Science and Game Theory · Computer Science 2022-09-22 Sergiu Hart , Noam Nisan

We provide an elementary proof that revenue-maximizing mechanisms exist in multi-parameter settings whenever the distribution of valuations has finite expectation.

Computer Science and Game Theory · Computer Science 2026-01-07 Sergiu Hart , Noam Nisan

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…

Computer Science and Game Theory · Computer Science 2018-01-10 Michal Feldman , Ophir Friedler , Aviad Rubinstein

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…

Computer Science and Game Theory · Computer Science 2020-08-03 Moshe Babaioff , Nicole Immorlica , Brendan Lucier , S. Matthew Weinberg

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…

Computer Science and Game Theory · Computer Science 2017-12-12 Ron Kupfer

We study the problem of multi-dimensional revenue maximization when selling $m$ items to a buyer that has additive valuations for them, drawn from a (possibly correlated) prior distribution. Unlike traditional Bayesian auction design, we…

Computer Science and Game Theory · Computer Science 2022-04-29 Yiannis Giannakopoulos , Diogo Poças , Alexandros Tsigonias-Dimitriadis

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…

Computer Science and Game Theory · Computer Science 2017-07-20 Hu Fu , Chris Liaw , Pinyan Lu , Zhihao Gavin Tang

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…

Computer Science and Game Theory · Computer Science 2015-10-14 Yiannis Giannakopoulos

Wasserstein distances are metrics on probability distributions inspired by the problem of optimal mass transportation. Roughly speaking, they measure the minimal effort required to reconfigure the probability mass of one distribution in…

Methodology · Statistics 2019-04-10 Victor M. Panaretos , Yoav Zemel

This paper considers the problem of regression over distributions, which is becoming increasingly important in machine learning. Existing approaches often ignore the geometry of the probability space or are computationally expensive. To…

Machine Learning · Computer Science 2025-10-31 Maksim Maslov , Alexander Kugaevskikh , Matthew Ivanov

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…

Computer Science and Game Theory · Computer Science 2026-03-30 Tim S. G. van Eck , Pieter Kleer , Johan S. H. van Leeuwaarden

What fraction of the potential social surplus in an environment can be extracted by a revenue-maximizing monopolist? We investigate this problem in Bayesian single-parameter environments with independent private values. The precise answer…

Computer Science and Game Theory · Computer Science 2013-05-03 Robert Kleinberg , Yang Yuan

Suppose we are given two metric spaces and a family of continuous transformations from one to the other. Given a probability distribution on each of these two spaces - namely the source and the target measures - the Wasserstein alignment…

Probability · Mathematics 2025-03-11 Soumik Pal , Bodhisattva Sen , Ting-Kam Leonard Wong

This paper expands the work on distributionally robust newsvendor to incorporate moment constraints. The use of Wasserstein distance as the ambiguity measure is preserved. The infinite dimensional primal problem is formulated; problem of…

Mathematical Finance · Quantitative Finance 2020-11-02 Derek Singh , Shuzhong Zhang
‹ Prev 1 2 3 10 Next ›