English
Related papers

Related papers: The Root of Revenue Continuity

200 papers

We study the stability of entropically regularized optimal transport with respect to the marginals. Lipschitz continuity of the value and H\"older continuity of the optimal coupling in $p$-Wasserstein distance are obtained under general…

Optimization and Control · Mathematics 2022-07-06 Stephan Eckstein , Marcel Nutz

We study the problem of selling $n$ heterogeneous items to a single buyer, whose values for different items are dependent. Under arbitrary dependence, Hart and Nisan show that no simple mechanism can achieve a non-negligible fraction of the…

Computer Science and Game Theory · Computer Science 2021-06-28 Yang Cai , Argyris Oikonomou

We consider the fundamental scenario where a single item is to be sold to one of two agents. Both agents draw their valuation for the item from the same probability distribution. However, only one of them submits a bid to the mechanism. The…

Computer Science and Game Theory · Computer Science 2025-08-26 Ioannis Caragiannis , Georgios Kalantzis

Consider a seller with m heterogeneous items for sale to a single additive buyer whose values for the items are arbitrarily correlated. It was previously shown that, in such settings, distributions exist for which the seller's optimal…

Computer Science and Game Theory · Computer Science 2018-12-03 Christos-Alexandros Psomas , Ariel Schvartzman , S. Matthew Weinberg

This paper expands the notion of robust profit opportunities in financial markets to incorporate distributional uncertainty using Wasserstein distance as the ambiguity measure. Financial markets with risky and risk-free assets are…

Portfolio Management · Quantitative Finance 2020-06-23 Derek Singh , Shuzhong Zhang

We consider an economic environment where a seller wants to sell an indivisible unit of good to a buyer. We show that revenue from any strategy-proof and individually rational mechanism defined on closed intervals of rich single crossing…

Computer Science and Game Theory · Computer Science 2024-12-12 Mridu Prabal Goswami

We extend the celebrated Stone's theorem to the framework of distributional regression. More precisely, we prove that weighted empirical distribution with local probability weights satisfying the conditions of Stone's theorem provide…

Statistics Theory · Mathematics 2023-02-03 Clément Dombry , Thibault Modeste , Romain Pic

The valuation process that economic agents undergo for investments with uncertain payoff typically depends on their statistical views on possible future outcomes, their attitudes toward risk, and, of course, the payoff structure itself.…

Pricing of Securities · Quantitative Finance 2010-01-11 Constantinos Kardaras

The assortment problem in revenue management is the problem of deciding which subset of products to offer to consumers in order to maximise revenue. A simple and natural strategy is to select the best assortment out of all those that are…

Data Structures and Algorithms · Computer Science 2019-02-22 Gerardo Berbeglia , Gwenaël Joret

This paper provides a simple procedure to fit generative networks to target distributions, with the goal of a small Wasserstein distance (or other optimal transport costs). The approach is based on two principles: (a) if the source…

Machine Learning · Computer Science 2019-06-12 Yucheng Chen , Matus Telgarsky , Chao Zhang , Bolton Bailey , Daniel Hsu , Jian Peng

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…

Computer Science and Game Theory · Computer Science 2019-03-12 Nikhil R. Devanur , Yuval Peres , Balasubramanian Sivan

An influential theory of increasing returns has been proposed by the economist W. B. Arthur in the '80s to explain the lock-in phenomenon between two competing commercial products. In the most simplified situation there are two competing…

Probability · Mathematics 2025-07-09 Simone Franchini , Riccardo Balzan

In the design and analysis of revenue-maximizing auctions, auction performance is typically measured with respect to a prior distribution over inputs. The most obvious source for such a distribution is past data. The goal is to understand…

Computer Science and Game Theory · Computer Science 2015-11-30 Richard Cole , Tim Roughgarden

We study the problem of minimizing the Wasserstein distance between a probability distribution and an algebraic variety. We consider the setting of finite state spaces and describe the solution depending on the choice of the ground metric…

Optimization and Control · Mathematics 2020-01-15 T. Ö. Çelik , A. Jamneshan , G. Montúfar , B. Sturmfels , L. Venturello

Wasserstein distributionally robust optimization (DRO) has recently achieved empirical success for various applications in operations research and machine learning, owing partly to its regularization effect. Although connection between…

Machine Learning · Computer Science 2020-11-02 Rui Gao , Xi Chen , Anton J. Kleywegt

We study the revenue maximization problem with an imprecisely estimated distribution of a single buyer or several independent and identically distributed buyers given that this estimation is not far away from the true distribution. We use…

Computer Science and Game Theory · Computer Science 2019-03-05 Yingkai Li , Pinyan Lu , Haoran Ye

We describe an application of Wasserstein distance to Reinforcement Learning. The Wasserstein distance in question is between the distribution of mappings of trajectories of a policy into some metric space, and some other fixed distribution…

Machine Learning · Computer Science 2019-08-01 Mohammed Amin Abdullah , Aldo Pacchiano , Moez Draief

We study the multi-item mechanism design problem where a monopolist sells $n$ heterogeneous items to a single buyer. We focus on buy-many mechanisms, a natural class of mechanisms frequently used in practice. The buy-many property allows…

Computer Science and Game Theory · Computer Science 2020-03-25 Shuchi Chawla , Yifeng Teng , Christos Tzamos

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

Computer Science and Game Theory · Computer Science 2024-06-13 Ran Ben-Moshe , Sergiu Hart , Noam Nisan

We study the problem of learning revenue-optimal multi-bidder auctions from samples when the samples of bidders' valuations can be adversarially corrupted or drawn from distributions that are adversarially perturbed. First, we prove tight…

Computer Science and Game Theory · Computer Science 2021-07-14 Wenshuo Guo , Michael I. Jordan , Manolis Zampetakis