Abstract
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.
| Original language | English |
|---|---|
| Title of host publication | 31st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2020 |
| Editors | Shuchi Chawla |
| Publisher | Association for Computing Machinery |
| Pages | 2452-2471 |
| Number of pages | 20 |
| ISBN (Electronic) | 9781611975994 |
| State | Published - 2020 |
| Externally published | Yes |
| Event | 31st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2020 - Salt Lake City, United States Duration: 5 Jan 2020 → 8 Jan 2020 |
Publication series
| Name | Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms |
|---|---|
| Volume | 2020-January |
Conference
| Conference | 31st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2020 |
|---|---|
| Country/Territory | United States |
| City | Salt Lake City |
| Period | 5/01/20 → 8/01/20 |
Bibliographical note
Publisher Copyright:© 2020 Association for Computing Machinery. All rights reserved.
Fingerprint
Dive into the research topics of 'Bulow-klemperer-style results for welfare maximization in two-sided markets'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver