6

[2307.03844] The Power of Two-sided Recruitment in Two-sided Markets

 1 month ago
source link: https://arxiv.org/abs/2307.03844
Go to the source link to view the article. You can view the picture content, updated content and better typesetting reading experience. If the link is broken, please click the button below to view the snapshot at that time.

Computer Science > Computer Science and Game Theory

[Submitted on 7 Jul 2023]

The Power of Two-sided Recruitment in Two-sided Markets

View PDF

We consider the problem of maximizing the gains from trade (GFT) in two-sided markets. The seminal impossibility result by Myerson shows that even for bilateral trade, there is no individually rational (IR), Bayesian incentive compatible (BIC) and budget balanced (BB) mechanism that can achieve the full GFT. Moreover, the optimal BIC, IR and BB mechanism that maximizes the GFT is known to be complex and heavily depends on the prior. In this paper, we pursue a Bulow-Klemperer-style question, i.e. does augmentation allow for prior-independent mechanisms to beat the optimal mechanism? Our main result shows that in the double auction setting with m i.i.d. buyers and n i.i.d. sellers, by augmenting O(1) buyers and sellers to the market, the GFT of a simple, dominant strategy incentive compatible (DSIC), and prior-independent mechanism in the augmented market is least the optimal in the original market, when the buyers' distribution first-order stochastically dominates the sellers' distribution. Furthermore, we consider general distributions without the stochastic dominance assumption. Existing hardness result by Babaioff et al. shows that no fixed finite number of agents is sufficient for all distributions. In the paper we provide a parameterized result, showing that O(log(m/rn)/r) agents suffice, where r is the probability that the buyer's value for the item exceeds the seller's value.
Subjects: Computer Science and Game Theory (cs.GT)
Cite as: arXiv:2307.03844 [cs.GT]
  (or arXiv:2307.03844v1 [cs.GT] for this version)
  https://doi.org/10.48550/arXiv.2307.03844

Submission history

From: Mingfei Zhao [view email]
[v1] Fri, 7 Jul 2023 21:31:17 UTC (78 KB)

About Joyk


Aggregate valuable and interesting links.
Joyk means Joy of geeK