中文
相关论文

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

200 篇论文

We develop a general duality-theory framework for revenue maximization in additive Bayesian auctions. The framework extends linear programming duality and complementarity to constraints with partial derivatives. The dual system reveals the…

计算机科学与博弈论 · 计算机科学 2018-01-16 Yiannis Giannakopoulos , Elias Koutsoupias

A fundamental assumption in classical mechanism design is that buyers are perfect optimizers. However, in practice, buyers may be limited by their computational capabilities or a lack of information, and may not be able to perfectly…

理论经济学 · 经济学 2022-03-28 Santiago Balseiro , Omar Besbes , Francisco Castro

In the standard formulation of mechanism design, a key assumption is that the designer has reliable information and technology to determine a prior distribution on types of the agents. In the meanwhile, as pointed out by the Wilson's…

计算机科学与博弈论 · 计算机科学 2016-07-20 Pingzhong Tang , Yulong Zeng

Signaling is an important topic in the study of asymmetric information in economic settings. In particular, the transparency of information available to a seller in an auction setting is a question of major interest. We introduce the study…

计算机科学与博弈论 · 计算机科学 2012-04-26 Yuval Emek , Michal Feldman , Iftah Gamzu , Renato Paes Leme , Moshe Tennenholtz

Selling a single item to $n$ self-interested buyers is a fundamental problem in economics, where the two objectives typically considered are welfare maximization and revenue maximization. Since the optimal mechanisms are often impractical…

计算机科学与博弈论 · 计算机科学 2024-11-06 Billy Jin , Thomas Kesselheim , Will Ma , Sahil Singla

We study the power of price discrimination via an intermediary in bilateral trade, when there is a revenue-maximizing seller selling an item to a buyer with a private value drawn from a prior. Between the seller and the buyer, there is an…

计算机科学与博弈论 · 计算机科学 2023-04-28 Shao-Heng Ko , Kamesh Munagala

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 the design of a revenue-optimal mechanism when two items are available to be sold to a single buyer whose valuation is uniformly distributed over an arbitrary rectangle $[c_1,c_1+b_1]\times[c_2,c_2+b_2]$ in the positive…

计算机科学与博弈论 · 计算机科学 2019-03-06 D. Thirumulanathan , Rajesh Sundaresan , Y Narahari

Bilateral trade is a fundamental economic scenario comprising a strategically acting buyer and seller, each holding valuations for the item, drawn from publicly known distributions. A mechanism is supposed to facilitate trade between these…

计算机科学与博弈论 · 计算机科学 2017-10-24 Riccardo Colini-Baldeschi , Paul Goldberg , Bart de Keijzer , Stefano Leonardi , Stefano Turchetta

We consider the problem of welfare maximization in two-sided markets using simple mechanisms that are prior-independent. The Myerson-Satterthwaite impossibility theorem shows that even for bilateral trade, there is no feasible (IR,…

计算机科学与博弈论 · 计算机科学 2019-12-24 Moshe Babaioff , Kira Goldner , Yannai A. Gonczarowski

Designing an incentive compatible auction that maximizes expected revenue is an intricate task. The single-item case was resolved in a seminal piece of work by Myerson in 1981, but more than 40 years later a full analytical understanding of…

计算机科学与博弈论 · 计算机科学 2022-10-17 Paul Dütting , Zhe Feng , Harikrishna Narasimhan , David C. Parkes , Sai Srivatsa Ravindranath

We consider the problem of a single seller repeatedly selling a single item to a single buyer (specifically, the buyer has a value drawn fresh from known distribution $D$ in every round). Prior work assumes that the buyer is fully rational…

计算机科学与博弈论 · 计算机科学 2017-11-28 Mark Braverman , Jieming Mao , Jon Schneider , S. Matthew Weinberg

We study robustly optimal mechanisms for selling multiple items. The seller maximizes revenue against a worst-case distribution of a buyer's valuations within a set of distributions, called an "ambiguity" set. We identify the exact forms of…

理论经济学 · 经济学 2024-08-26 Yeon-Koo Che , Weijie Zhong

We study the social efficiency of bilateral trade between a seller and a buyer. In the classical Bayesian setting, the celebrated Myerson-Satterthwaite impossibility theorem states that no Bayesian incentive-compatible, individually…

计算机科学与博弈论 · 计算机科学 2025-02-19 Yuan Deng , Jieming Mao , Balasubramanian Sivan , Kangning Wang , Jinzhao Wu

We show that computing the revenue-optimal deterministic auction in unit-demand single-buyer Bayesian settings, i.e. the optimal item-pricing, is computationally hard even in single-item settings where the buyer's value distribution is a…

计算机科学与博弈论 · 计算机科学 2015-03-10 Constantinos Daskalakis , Alan Deckelbaum , Christos Tzamos

We study a setting where agents use no-regret learning algorithms to participate in repeated auctions. \citet{kolumbus2022auctions} showed, rather surprisingly, that when bidders participate in second-price auctions using no-regret bidding…

计算机科学与博弈论 · 计算机科学 2024-11-15 Gagan Aggarwal , Anupam Gupta , Andres Perlroth , Grigoris Velegkas

This paper examines knapsack auctions as a method to solve the knapsack problem with incomplete information, where object values are private and sizes are public. We analyze three auction types-uniform price (UP), discriminatory price (DP),…

计算机科学与博弈论 · 计算机科学 2024-05-02 Peyman Khezr , Vijay Mohan , Lionel Page

We initiate the study of how auction design affects the division of surplus among buyers. We propose a parsimonious measure for equity and apply it to the family of standard auctions for homogeneous goods. Our surplus-equitable mechanism is…

理论经济学 · 经济学 2024-11-14 Simon Finster , Patrick Loiseau , Simon Mauras , Mathieu Molina , Bary Pradelski

Bilateral trade models the task of intermediating between two strategic agents, a seller and a buyer, willing to trade a good for which they hold private valuations. We study this problem from the perspective of a broker, in a regret…

计算机科学与博弈论 · 计算机科学 2025-09-29 Simone Di Gregorio , Paul Dütting , Federico Fusco , Chris Schwiegelshohn

A seller wants to sell an item to $n$ buyers. Buyer valuations are drawn i.i.d. from a distribution unknown to the seller; the seller only knows that the support is included in $[a, b]$. To be robust, the seller chooses a DSIC mechanism…

理论经济学 · 经济学 2025-01-03 Jerry Anunrojwong , Santiago R. Balseiro , Omar Besbes