中文
相关论文

相关论文: Improved Approximation Ratios of Fixed-Price Mecha…

200 篇论文

We study the problem of social welfare maximization in bilateral trade, where two agents, a buyer and a seller, trade an indivisible item. We consider arguably the simplest form of mechanisms -- the fixed-price mechanisms, where the…

计算机科学与博弈论 · 计算机科学 2023-06-21 Yang Cai , Jinzhao Wu

We consider the bilateral trade problem, in which two agents trade a single indivisible item. It is known that the only dominant-strategy truthful mechanism is the fixed-price mechanism: given commonly known distributions of the buyer's…

计算机科学与博弈论 · 计算机科学 2021-12-21 Zi Yang Kang , Francisco Pernice , Jan Vondrák

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 study the bilateral trade problem where a seller owns a single indivisible item, and a potential buyer seeks to purchase it. Previous mechanisms for this problem only considered the case where the values of the buyer and the seller are…

计算机科学与博弈论 · 计算机科学 2024-04-17 Shahar Dobzinski , Ariel Shaulker

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

Consider a trade market with one seller and multiple buyers. The seller aims to sell an indivisible item and maximize their revenue. This paper focuses on a simple and popular mechanism--the fixed-price mechanism. Unlike the standard…

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

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 consider a fixed-price mechanism design setting where a seller sells one item via a social network, but the seller can only directly communicate with her neighbours initially. Each other node in the network is a potential buyer with a…

计算机科学与博弈论 · 计算机科学 2019-05-15 Tianyi Zhang , Dengji Zhao , Wen Zhang , Xuming He

We study a seller who sells a single good to multiple bidders with uncertainty over the joint distribution of bidders' valuations, as well as bidders' higher-order beliefs about their opponents. The seller only knows the (possibly…

理论经济学 · 经济学 2022-02-16 Ethan Che

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

We study the classic bilateral trade setting. Myerson and Satterthwaite show that there is no Bayesian incentive compatible and budget-balanced mechanism that obtains the gains from trade of the first-best mechanism. Consider the…

计算机科学与博弈论 · 计算机科学 2021-11-16 Moshe Babaioff , Shahar Dobzinski , Ron Kupfer

Posted price mechanisms are prevalent in allocating goods within online marketplaces due to their simplicity and practical efficiency. We explore a fundamental scenario where buyers' valuations are independent and identically distributed,…

计算机科学与博弈论 · 计算机科学 2025-05-26 José Correa , Vasilis Livanos , Dana Pizarro , Victor Verdugo

We study the performance of anonymous posted-price selling mechanisms for a standard Bayesian auction setting, where $n$ bidders have i.i.d. valuations for a single item. We show that for the natural class of Monotone Hazard Rate (MHR)…

计算机科学与博弈论 · 计算机科学 2019-11-01 Yiannis Giannakopoulos , Diogo Poças , Keyu Zhu

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

We study revenue maximization in a buyer-seller setting where the seller has a single object and the buyer has both a private valuation and a private budget. Private budgets complicate the classic single-product monopoly problem, making…

计算机科学与博弈论 · 计算机科学 2026-04-30 Juan Carlos Carbajal , Ahuva Mualem

We study prior-independent pricing for selling a single item to a single buyer when the seller observes only a single sample from the valuation distribution, while the buyer knows the distribution. Classical robust pricing approaches either…

计算机科学与博弈论 · 计算机科学 2026-02-23 Zhihao Gavin Tang , Yixin Tao , Shixin Wang

We consider two canonical Bayesian mechanism design settings. In the single-item setting, we prove tight approximation ratio for anonymous pricing: compared with Myerson Auction, it extracts at least $\frac{1}{2.62}$-fraction of revenue;…

计算机科学与博弈论 · 计算机科学 2018-11-05 Yaonan Jin , Pinyan Lu , Qi Qi , Zhihao Gavin Tang , Tao Xiao

We study revenue maximization through sequential posted-price (SPP) mechanisms in single-dimensional settings with $n$ buyers and independent but not necessarily identical value distributions. We construct the SPP mechanisms by considering…

计算机科学与博弈论 · 计算机科学 2021-01-11 Hedyeh Beyhaghi , Negin Golrezaei , Renato Paes Leme , Martin Pal , Balasubramanian Sivan

We study the bilateral trade problem: one seller, one buyer and a single, indivisible item for sale. It is well known that there is no fully-efficient and incentive compatible mechanism for this problem that maintains a balanced budget. We…

计算机科学与博弈论 · 计算机科学 2018-11-20 Liad Blumrosen , Shahar Dobzinski

We efficiently solve the optimal multi-dimensional mechanism design problem for independent bidders with arbitrary demand constraints when either the number of bidders is a constant or the number of items is a constant. In the first…

计算机科学与博弈论 · 计算机科学 2011-12-20 Constantinos Daskalakis , S. Matthew Weinberg
‹ 上一页 1 2 3 10 下一页 ›