Bulow-Klemperer-Style Results for Welfare Maximization in Two-Sided Markets

被引:0
作者
Babaioff, Moshe [1 ]
Goldner, Kira [2 ,3 ]
Gonczarowski, Yannai A. [2 ,4 ,5 ]
机构
[1] Microsoft Res, Redmond, WA 98052 USA
[2] Columbia Univ, New York, NY 10027 USA
[3] Univ Washington, Seattle, WA 98195 USA
[4] Hebrew Univ Jerusalem, Jerusalem, Israel
[5] Tel Aviv Univ, Tel Aviv, Israel
来源
PROCEEDINGS OF THE THIRTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA'20) | 2020年
基金
欧洲研究理事会; 美国国家科学基金会;
关键词
MECHANISMS; AUCTIONS; CONVERGENCE; EFFICIENCY;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We consider the problem of welfare (and gains-from-trade) maximization in two-sided markets using simple mechanisms that are prior-independent. The seminal impossibility result of Myerson and Satterthwaite [1983] shows that even for bilateral trade, there is no feasible (individually rational, truthful, and budget balanced) mechanism that has welfare as high as the optimal-yet-infeasible VCG mechanism, which attains maximal welfare but runs a deficit. On the other hand, the optimal feasible mechanism needs to be carefully tailored to the Bayesian prior, and even worse, it is known to be extremely complex, eluding a precise description. In this paper we present Bulow-Klemperer-style results to circumvent these hurdles in double-auction market settings. We suggest using the Buyer Trade Reduction (BTR) mechanism, a variant of McAfee's mechanism, which is feasible and simple (in particular, it is deterministic, truthful, prior-independent, and anonymous). First, in the setting in which the values of the buyers and of the sellers are sampled independently and identically from the same distribution, we show that for any such market of any size, BTR with one additional buyer whose value is sampled from the same distribution has expected welfare at least as high as the optimal-yet-infeasible VCG mechanism in the original market. We then move to a more general setting in which the values of the buyers are sampled from one distribution, and those of the sellers from another, focusing on the case where the buyers' distribution first-order stochastically dominates the sellers' distribution. We present both upper bounds and lower bounds on the number of buyers that, when added, guarantees that BTR in the augmented market achieve welfare at least as high as the optimal in the original market. Our lower bounds extend to a large class of mechanisms, and all of our positive and negative results extend to adding sellers instead of buyers. In addition, we present positive results about the usefulness of pricing at a sample for welfare maximization (and more precisely, for gains-from-trade approximation) in two-sided markets under the above two settings, which to the best of our knowledge are the first sampling results in this context.
引用
收藏
页码:2452 / 2471
页数:20
相关论文
共 56 条
[1]  
Alon N., 2017, NIPS, P1656
[2]  
[Anonymous], 2018, ACM EC18 P 2018 ACM, DOI DOI 10.1145/3219166.3219202
[3]  
[Anonymous], 2015, ACM EC
[4]  
[Anonymous], 2015, ACM EC
[5]  
[Anonymous], 2005, P 21 C UNC ART INT U
[6]  
Azar P.D., 2014, P 25 ANN ACM SIAM S, P1358, DOI DOI 10.1137/1.9781611973402.100
[7]  
Azar P. D., 2013, INNOVATIONS THEORETI, P231
[8]  
Azar P, 2013, PROCEEDINGS OF THE TWENTY-FOURTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA 2013), P596
[9]   Incentive-compatible, budget-balanced, yet highly efficient auctions for supply chain formation [J].
Babaioff, M ;
Walsh, WE .
DECISION SUPPORT SYSTEMS, 2005, 39 (01) :123-149
[10]   Concurrent auctions across the supply chain [J].
Babaioff, M ;
Nisan, N .
JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2004, 21 :595-629