中文
相关论文

相关论文: A Tale of Two Monopolies

200 篇论文

We study the problem of selling information to a data-buyer who faces a decision problem under uncertainty. We consider the classic Bayesian decision-theoretic model pioneered by [Blackwell, 1951, 1953]. Initially, the data buyer has only…

计算机科学与博弈论 · 计算机科学 2022-02-21 Dirk Bergemann , Yang Cai , Grigoris Velegkas , Mingfei Zhao

We study economies where consumers interact independently with many monopolists. When consumer valuations over goods are correlated, correlation can distort the induced distribution of consumer surplus (information rents). We identify which…

理论经济学 · 经济学 2026-05-29 Eric Gao , Daniel Luo

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…

计算机科学与博弈论 · 计算机科学 2019-03-05 Yingkai Li , Pinyan Lu , Haoran Ye

We study how to maximize the broker's (expected) profit in a two-sided market, where she buys items from a set of sellers and resells them to a set of buyers. Each seller has a single item to sell and holds a private value on her item, and…

计算机科学与博弈论 · 计算机科学 2019-05-24 Jing Chen , Bo Li , Yingkai Li

A single unit of a good is sold to one of two bidders. Each bidder has either a high prior valuation or a low prior valuation for the good. Their prior valuations are independently and identically distributed. Each bidder may observe an…

理论经济学 · 经济学 2022-05-10 Wanchang Zhang

We study in this paper optimal mass transport over a strongly connected, directed graph on a given discrete time interval. Differently from previous literature, we do not assume full knowledge of the initial and final goods distribution…

概率论 · 数学 2024-07-16 Aayan Masood Pathan , Michele Pavon

There has been much recent work on the revenue-raising properties of truthful mechanisms for selling goods to selfish bidders. Typically the revenue of a mechanism is compared against a benchmark (such as, the maximum revenue obtainable by…

计算机科学与博弈论 · 计算机科学 2013-01-14 Paul W. Goldberg , Carmine Ventre

A seminal result of Bulow and Klemperer [1989] demonstrates the power of competition for extracting revenue: when selling a single item to $n$ bidders whose values are drawn i.i.d. from a regular distribution, the simple welfare-maximizing…

计算机科学与博弈论 · 计算机科学 2016-12-30 Alon Eden , Michal Feldman , Ophir Friedler , Inbal Talgam-Cohen , 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…

计算机科学与博弈论 · 计算机科学 2015-06-02 Balasubramanian Sivan , Vasilis Syrgkanis , Omer Tamuz

We study deterministic monopoly pricing under partial knowledge of the market, where the seller has access only to summary statistics of the valuation distribution, such as the mean, dispersion, and maximum value. Using tools from…

最优化与控制 · 数学 2025-09-09 Tim S. G. van Eck , Pieter Kleer , Johan S. H. van Leeuwaarden

We consider the problem of finding consistent upper price bounds and super replication strategies for exotic options, given the observation of call prices in the market. This field of research is called model-independent finance and has…

最优化与控制 · 数学 2020-01-31 Nicole Bäuerle , Daniel Schmithals

We study the problem of designing optimal auctions under restrictions on the set of permissible allocations. In addition to allowing us to restrict to deterministic mechanisms, we can also indirectly model non-additive valuations. We prove…

计算机科学与博弈论 · 计算机科学 2016-06-07 Ian Kash , Rafael Frongillo

We establish a rigorous duality theory, under No Unbounded Profit with Bounded Risk, for an infinite horizon problem of optimal consumption in the presence of an income stream that can terminate randomly at an exponentially distributed…

数理金融 · 定量金融 2021-11-30 Ashley Davey , Michael Monoyios , Harry Zheng

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

The existing literature on optimal auctions focuses on optimizing the expected revenue of the seller, and is appropriate for risk-neutral sellers. In this paper, we identify good mechanisms for risk-averse sellers. As is standard in the…

计算机科学与博弈论 · 计算机科学 2010-04-02 Mukund Sundararajan , Qiqi Yan

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…

数据结构与算法 · 计算机科学 2019-02-22 Gerardo Berbeglia , Gwenaël Joret

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…

计算机科学与博弈论 · 计算机科学 2025-08-26 Ioannis Caragiannis , Georgios Kalantzis

In a seminal paper, McAfee (1992) presented a truthful mechanism for double auctions, attaining asymptotically-optimal gain-from-trade without any prior information on the valuations of the traders. McAfee's mechanism handles…

计算机科学与博弈论 · 计算机科学 2017-12-20 Erel Segal-Halevi , Avinatan Hassidim , Yonatan Aumann

Adverse selection is a version of the principal-agent problem that includes monopolist nonlinear pricing, where a monopolist with known costs seeks a profit-maximizing price menu facing a population of potential consumers whose preferences…

最优化与控制 · 数学 2023-11-27 Robert J. McCann , Kelvin Shuangjian Zhang

We consider a network of sellers, each selling a single product, where the graph structure represents pair-wise complementarities between products. We study how the network structure affects revenue and social welfare of equilibria of the…

计算机科学与博弈论 · 计算机科学 2016-05-03 Moshe Babaioff , Liad Blumrosen , Noam Nisan