中文
相关论文

相关论文: Bulow-Klemperer-Style Results for Welfare Maximiza…

200 篇论文

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…

计算机科学与博弈论 · 计算机科学 2024-04-01 Yang Cai , Christopher Liaw , Aranyak Mehta , Mingfei Zhao

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

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

计算机科学与博弈论 · 计算机科学 2021-06-01 Alexander Braun , Thomas Kesselheim

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…

计算机科学与博弈论 · 计算机科学 2024-06-21 Moshe Babaioff , Amitai Frey , Noam Nisan

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

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

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

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

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

We study the problem of designing revenue-maximizing mechanisms for a selfish mediator who facilitates trade between a buyer and a seller. We consider a setting where the mediator does not have information advantage and the buyer's…

计算机科学与博弈论 · 计算机科学 2026-03-10 Zhikang Fan , Weiran Shen , Shaojie Tang , Yao Wang

We study the power of item-pricing as a tool for approximately optimizing social welfare in a combinatorial market. We consider markets with $m$ indivisible items and $n$ buyers. The goal is to set prices to the items so that, when agents…

计算机科学与博弈论 · 计算机科学 2015-11-10 Michal Feldman , Nick Gravin , Brendan Lucier

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

We provide a reduction from revenue maximization to welfare maximization in multi-dimensional Bayesian auctions with arbitrary (possibly combinatorial) feasibility constraints and independent bidders with arbitrary (possibly combinatorial)…

计算机科学与博弈论 · 计算机科学 2012-07-25 Yang Cai , Constantinos Daskalakis , S. Matthew Weinberg

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…

计算机科学与博弈论 · 计算机科学 2021-03-09 Riccardo Colini-Baldeschi , Paul Goldberg , Bart de Keijzer , Stefano Leonardi , Tim Roughgarden , Stefano Turchetta

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

We study online combinatorial auctions with production costs proposed by Blum et al. using the online primal dual framework. In this model, buyers arrive online, and the seller can produce multiple copies of each item subject to a…

数据结构与算法 · 计算机科学 2014-11-18 Zhiyi Huang , Anthony Kim
‹ 上一页 1 2 3 10 下一页 ›