中文
相关论文

相关论文: Truthful Bilateral Trade is Impossible even with F…

200 篇论文

We study bilateral trade between two strategic agents. The celebrated result of Myerson and Satterthwaite states that in general, no incentive-compatible, individually rational and weakly budget balanced mechanism can be efficient. I.e., no…

计算机科学与博弈论 · 计算机科学 2021-11-08 Yuan Deng , Jieming Mao , Balasubramanian Sivan , Kangning Wang

Bilateral trade is one of the most natural and important forms of economic interaction: A seller has a single, indivisible item for sale, and a buyer is potentially interested. The two parties typically have different, privately known…

计算机科学与博弈论 · 计算机科学 2023-12-20 Yixuan Even Xu , Hanrui Zhang , Vincent Conitzer

In two-sided markets, Myerson and Satterthwaite's impossibility theorem states that one can not maximize the gain-from-trade while also satisfying truthfulness, individual-rationality and no deficit. Attempts have been made to circumvent…

计算机科学与博弈论 · 计算机科学 2019-12-10 Rica Gonen , Erel Segal-Halevi

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

Bilateral trade, a fundamental topic in economics, models the problem of intermediating between two strategic agents, a seller and a buyer, willing to trade a good for which they hold private valuations. Despite the simplicity of this…

机器学习 · 计算机科学 2024-02-20 Nicolò Cesa-Bianchi , Tommaso Cesari , Roberto Colomboni , Federico Fusco , Stefano Leonardi

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

The seminal impossibility result of Myerson and Satterthwaite (1983) states that for bilateral trade, there is no mechanism that is individually rational (IR), incentive compatible (IC), weakly budget balanced, and efficient. This has led…

计算机科学与博弈论 · 计算机科学 2018-02-23 Moshe Babaioff , Yang Cai , Yannai A. Gonczarowski , Mingfei Zhao

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 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

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

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

We design simple mechanisms to approximate the Gains from Trade (GFT) in two-sided markets with multiple unit-supply sellers and multiple unit-demand buyers. A classical impossibility result by Myerson and Satterthwaite showed that even…

计算机科学与博弈论 · 计算机科学 2017-06-20 Johannes Brustle , Yang Cai , Fa Wu , Mingfei Zhao

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

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

We consider the impact of fairness requirements on the social efficiency of truthful mechanisms for trade, focusing on Bayesian bilateral-trade settings. Unlike the full information case in which all gains-from-trade can be realized and…

计算机科学与博弈论 · 计算机科学 2025-02-27 Moshe Babaioff , Yiding Feng , Noam Manaker Morag

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

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

The celebrated Myerson--Satterthwaite theorem shows that in bilateral trade, no mechanism can be simultaneously fully efficient, Bayesian incentive compatible (BIC), and budget balanced (BB). This naturally raises the question of how…

机器学习 · 计算机科学 2026-03-10 Yang Cai , Vineet Gupta , Zun Li , Aranyak Mehta

A celebrated impossibility result by Myerson and Satterthwaite (1983) shows that any truthful mechanism for two-sided markets that maximizes social welfare must run a deficit, resulting in a necessity to relax welfare efficiency and the use…

计算机科学与博弈论 · 计算机科学 2024-02-20 Paul Dütting , Federico Fusco , Philip Lazos , Stefano Leonardi , Rebecca Reiffenhäuser

This paper reexamines the classic problem of revenue maximization in single-item auctions with $n$ buyers under the lens of the robust optimization framework. The celebrated Myerson's mechanism is the format that maximizes the seller's…

计算机科学与博弈论 · 计算机科学 2024-09-16 Nick Gravin , Zhiqi Wang
‹ 上一页 1 2 3 10 下一页 ›