English
Related papers

Related papers: Strongly Budget Balanced Auctions for Multi-Sided …

200 papers

A seminal theorem of Myerson and Satterthwaite (1983) proves that, in a game of bilateral trade between a single buyer and a single seller, no mechanism can be simultaneously individually-rational, budget-balanced, incentive-compatible and…

Computer Science and Game Theory · Computer Science 2017-11-23 Erel Segal-Halevi , Avinatan Hassidim

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…

Computer Science and Game Theory · Computer Science 2021-11-08 Yuan Deng , Jieming Mao , Balasubramanian Sivan , Kangning Wang

In a seminal paper, McAfee (1992) presented the first dominant strategy truthful mechanism for double auction. His mechanism attains nearly optimal gain-from-trade when the market is sufficiently large. However, his mechanism may leave…

Computer Science and Game Theory · Computer Science 2016-09-07 Erel Segal-Halevi , Avinatan Hassidim , Yonatan Aumann

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…

Computer Science and Game Theory · Computer Science 2024-02-20 Paul Dütting , Federico Fusco , Philip Lazos , Stefano Leonardi , Rebecca Reiffenhäuser

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…

Computer Science and Game Theory · Computer Science 2025-02-19 Yuan Deng , Jieming Mao , Balasubramanian Sivan , Kangning Wang , Jinzhao Wu

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…

Computer Science and Game Theory · Computer Science 2023-12-20 Yixuan Even Xu , Hanrui Zhang , Vincent Conitzer

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…

Computer Science and Game Theory · Computer Science 2018-02-23 Moshe Babaioff , Yang Cai , Yannai A. Gonczarowski , Mingfei Zhao

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

Computer Science and Game Theory · Computer Science 2019-12-24 Moshe Babaioff , Kira Goldner , Yannai A. Gonczarowski

Mechanism design for one-sided markets has been investigated for several decades in economics and in computer science. More recently, there has been an increased attention on mechanisms for two-sided markets, in which buyers and sellers act…

Computer Science and Game Theory · Computer Science 2021-03-09 Riccardo Colini-Baldeschi , Paul Goldberg , Bart de Keijzer , Stefano Leonardi , Tim Roughgarden , Stefano Turchetta

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…

Computer Science and Game Theory · Computer Science 2017-06-20 Johannes Brustle , Yang Cai , Fa Wu , Mingfei Zhao

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…

Computer Science and Game Theory · Computer Science 2017-12-20 Erel Segal-Halevi , Avinatan Hassidim , Yonatan Aumann

We study the problem of designing a two-sided market (double auction) to maximize the gains from trade (social welfare) under the constraints of (dominant-strategy) incentive compatibility and budget-balance. Our goal is to do so for an…

Computer Science and Game Theory · Computer Science 2024-06-21 Moshe Babaioff , Amitai Frey , Noam Nisan

We consider the problem of maximizing the gains from trade (GFT) in two-sided markets. The seminal impossibility result by Myerson and Satterthwaite shows that even for bilateral trade, there is no individually rational (IR), Bayesian…

Computer Science and Game Theory · Computer Science 2024-04-01 Yang Cai , Christopher Liaw , Aranyak Mehta , Mingfei Zhao

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…

Computer Science and Game Theory · Computer Science 2022-05-03 Yumou Fei

We study gains from trade in multi-dimensional two-sided markets. Specifically, we focus on a setting with $n$ heterogeneous items, where each item is owned by a different seller $i$, and there is a constrained-additive buyer with…

Computer Science and Game Theory · Computer Science 2022-03-15 Yang Cai , Kira Goldner , Steven Ma , Mingfei Zhao

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…

Computer Science and Game Theory · Computer Science 2024-09-16 Nick Gravin , Zhiqi Wang

We design novel mechanisms for welfare-maximization in two-sided markets. That is, there are buyers willing to purchase items and sellers holding items initially, both acting rationally and strategically in order to maximize utility. Our…

Computer Science and Game Theory · Computer Science 2021-06-01 Alexander Braun , Thomas Kesselheim

Motivated by applications such as stock exchanges and spectrum auctions, there is a growing interest in mechanisms for arranging trade in two-sided markets. Existing mechanisms are either not truthful, or do not guarantee an…

Computer Science and Game Theory · Computer Science 2018-05-02 Erel Segal-Halevi , Avinatan Hassidim , Yonatan Aumann

Multi-unit auctions are a paradigmatic model, where a seller brings multiple units of a good, while several buyers bring monetary endowments. It is well known that Walrasian equilibria do not always exist in this model, however compelling…

Computer Science and Game Theory · Computer Science 2017-10-10 Simina Brânzei , Aris Filos-Ratsikas , Peter Bro Miltersen , Yulong Zeng

We design a framework for truthful double multi-channel spectrum auctions where each seller (or buyer) can sell (or buy) multiple spectrum channels based on their individual needs. Open, market-based spectrum trading motivates existing…

Networking and Internet Architecture · Computer Science 2012-08-03 Zhili Chen , He Huang , Liusheng Huang
‹ Prev 1 2 3 10 Next ›