中文
相关论文

相关论文: Tight Revenue Gaps among Multi-Unit Mechanisms

200 篇论文

One of the most celebrated results in mechanism design is Myerson's characterization of the revenue optimal auction for selling a single item. However, this result relies heavily on the assumption that buyers are indifferent to risk. In…

计算机科学与博弈论 · 计算机科学 2018-10-08 Evdokia Nikolova , Emmanouil Pountourakis , Ger Yang

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

In the quest for market mechanisms that are easy to implement, yet close to optimal, few seem as viable as posted pricing. Despite the growing body of impressive results, the performance of most posted price mechanisms however, rely…

计算机科学与博弈论 · 计算机科学 2016-09-23 Shreyas Sekar

We propose a new architecture to approximately learn incentive compatible, revenue-maximizing auctions from sampled valuations. Our architecture uses the Sinkhorn algorithm to perform a differentiable bipartite matching which allows the…

计算机科学与博弈论 · 计算机科学 2021-06-16 Michael J. Curry , Uro Lyi , Tom Goldstein , John Dickerson

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

Consider Myerson's optimal auction with respect to an inaccurate prior, e.g., estimated from data, which is an underestimation of the true value distribution. Can the auctioneer expect getting at least the optimal revenue w.r.t. the…

计算机科学与博弈论 · 计算机科学 2022-11-10 Ziyun Chen , Zhiyi Huang , Dorsa Majdi , Zipeng Yan

Assortment optimization concerns the problem of selling items with fixed prices to a buyer who will purchase at most one. Typically, retailers select a subset of items, corresponding to an "assortment" of brands to carry, and make each…

计算机科学与博弈论 · 计算机科学 2022-05-23 Will Ma

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

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

A monopolistic seller aims to sell an indivisible item to multiple potential buyers. Each buyer's valuation depends on their private type and the item's quality. The seller can observe the quality but it is unknown to buyers. This quality…

计算机科学与博弈论 · 计算机科学 2024-11-13 Zhikang Fan , Weiran Shen

Myerson's seminal characterization of the revenue-optimal auction for a single item \cite{myerson1981optimal} remains a cornerstone of mechanism design. However, generalizing this framework to multi-item settings has proven exceptionally…

计算机科学与博弈论 · 计算机科学 2025-10-08 Marios Mertzanidis , Athina Terzoglou

Situations where a group of agents come together to jointly buy a resource that they individually cannot afford to buy are commonly observed in markets. For example in the US market for radio spectrum, a recent proposal invited small firms…

计算机科学与博弈论 · 计算机科学 2015-03-09 Vijay Kamble , Jean Walrand

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

We consider a revenue-maximizing single seller with $m$ items for sale to a single buyer whose value $v(\cdot)$ for the items is drawn from a known distribution $D$ of support $k$. A series of works by Cai et al. establishes that when each…

计算机科学与博弈论 · 计算机科学 2020-07-13 Natalie Collina , S. Matthew Weinberg

We study revenue maximization by deterministic mechanisms for the simplest case for which Myerson's characterization does not hold: a single seller selling two items, with independently distributed values, to a single additive buyer. We…

计算机科学与博弈论 · 计算机科学 2018-04-20 Moshe Babaioff , Noam Nisan , Aviad Rubinstein

We study dynamic mechanisms for optimizing revenue in repeated auctions, that are robust to heterogeneous forward-looking and learning behavior of the buyers. Typically it is assumed that the buyers are either all myopic or are all infinite…

计算机科学与博弈论 · 计算机科学 2019-06-11 Shipra Agrawal , Eric Balkanski , Vahab Mirrokni , Balasubramanian Sivan

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 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 consider a model of bilateral trade with private values. The value of the buyer and the cost of the seller are jointly distributed. The true joint distribution is unknown to the designer, however, the marginal distributions of the value…

理论经济学 · 经济学 2023-01-02 Komal Malik

Diffusion auction design is a new trend in mechanism design for which the main goal is to incentivize existing buyers to invite new buyers, who are their neighbors on a social network, to join an auction even though they are competitors.…

计算机科学与博弈论 · 计算机科学 2024-08-26 Yao Zhang , Shanshan Zheng , Dengji Zhao