中文
相关论文

相关论文: A Note on Selling Optimally Two Uniformly Distribu…

200 篇论文

Multi-item revenue-optimal mechanisms are known to be extremely complex, often offering buyers randomized lotteries of goods. In the standard buy-one model, it is known that optimal mechanisms can yield revenue infinitely higher than that…

计算机科学与博弈论 · 计算机科学 2022-11-22 Sepehr Assadi , Vikram Kher , George Li , Ariel Schvartzman

We study the revenue performance of sequential posted price mechanisms and some natural extensions, for a general setting where the valuations of the buyers are drawn from a correlated distribution. Sequential posted price mechanisms are…

计算机科学与博弈论 · 计算机科学 2015-10-02 Marek Adamczyk , Allan Borodin , Diodato Ferraioli , Bart de Keijzer , Stefano Leonardi

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

Classical Bayesian mechanism design relies on the common prior assumption, but such prior is often not available in practice. We study the design of prior-independent mechanisms that relax this assumption: the seller is selling an…

理论经济学 · 经济学 2024-12-12 Jerry Anunrojwong , Santiago R. Balseiro , Omar Besbes

We study revenue optimization in a repeated auction between a single seller and a single buyer. Traditionally, the design of repeated auctions requires strong modeling assumptions about the bidder behavior, such as it being myopic, infinite…

计算机科学与博弈论 · 计算机科学 2019-03-12 Shipra Agrawal , Constantinos Daskalakis , Vahab Mirrokni , Balasubramanian Sivan

Robust and distributionally robust optimization are modeling paradigms for decision-making under uncertainty where the uncertain parameters are only known to reside in an uncertainty set or are governed by any probability distribution from…

最优化与控制 · 数学 2023-07-21 Jianzhe Zhen , Daniel Kuhn , Wolfram Wiesemann

We investigate a seller's revenue-maximizing mechanism in a setting where a desirable good is sold together with an undesirable bad (e.g., advertisements) that generates third-party revenue. The buyer's private information is…

理论经济学 · 经济学 2026-02-02 Kolagani Paramahamsa

It was recently shown in [http://arxiv.org/abs/1207.5518] that revenue optimization can be computationally efficiently reduced to welfare optimization in all multi-dimensional Bayesian auction problems with arbitrary (possibly…

计算机科学与博弈论 · 计算机科学 2013-05-20 Yang Cai , Constantinos Daskalakis , S. Matthew Weinberg

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

This study introduces an optimal mechanism in a dynamic stochastic knapsack environment. The model features a single seller who has a fixed quantity of a perfectly divisible item. Impatient buyers with a piece-wise linear utility function…

计算机科学与博弈论 · 计算机科学 2024-02-23 Jihyeok Jung , Chan-Oi Song , Deok-Joo Lee , Kiho Yoon

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

Suppose that $c(x,y)$ is the cost of transporting a unit of mass from $x\in X$ to $y\in Y$ and suppose that a mass distribution $\mu$ on $X$ is transported optimally (so that the total cost of transportation is minimal) to the mass…

泛函分析 · 数学 2014-05-20 Sedi Bartz , Simeon Reich

We study a repeated trading problem in which a mechanism designer facilitates trade between a single seller and multiple buyers. Our model generalizes the classic bilateral trade setting to a multi-buyer environment. Specifically, the…

计算机科学与博弈论 · 计算机科学 2025-03-04 Anna Lunghi , Matteo Castiglioni , Alberto Marchesi

The intuition that profit is optimized by maximizing marginal revenue is a guiding principle in microeconomics. In the classical auction theory for agents with linear utility and single-dimensional preferences, Bulow and Roberts (1989) show…

计算机科学与博弈论 · 计算机科学 2014-06-06 Saeed Alaei , Hu Fu , Nima Haghpanah , Jason Hartline

The question of the minimum menu-size for approximate (i.e., up-to-$\varepsilon$) Bayesian revenue maximization when selling two goods to an additive risk-neutral quasilinear buyer was introduced by Hart and Nisan (2013), who give an upper…

计算机科学与博弈论 · 计算机科学 2018-07-12 Yannai A. Gonczarowski

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 revenue-optimal mechanism design in the interdimensional setting, where one dimension is the 'value' of the buyer, and one is a 'type' that captures some auxiliary information. One setting is the FedEx Problem, for which FGKK…

计算机科学与博弈论 · 计算机科学 2020-02-18 Nikhil Devanur , Kira Goldner , Raghuvansh Saxena , Ariel Schvartzman , S. Matthew Weinberg

The revenue optimal mechanism for selling a single item to agents with independent but non-identically distributed values is complex for agents with linear utility (Myerson,1981) and has no closed-form characterization for agents with…

计算机科学与博弈论 · 计算机科学 2020-11-24 Yiding Feng , Jason D. Hartline , Yingkai Li

We present a unified duality approach to Bayesian persuasion. The optimal dual variable, interpreted as a price function on the state space, is shown to be a supergradient of the concave closure of the objective function at the prior…

理论经济学 · 经济学 2024-06-05 Piotr Dworczak , Anton Kolotilin

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…

计算机科学与博弈论 · 计算机科学 2021-07-14 Wenshuo Guo , Michael I. Jordan , Manolis Zampetakis