Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2406.07385 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914831769010176 |
|---|---|
| author | D'Amico-Wong, Luca Gonczarowski, Yannai A. Ma, Gary Qiurui Parkes, David C. |
| author_facet | D'Amico-Wong, Luca Gonczarowski, Yannai A. Ma, Gary Qiurui Parkes, David C. |
| contents | We model the role of an online platform disrupting a market with unit-demand buyers and unit-supply sellers. Each seller can transact with a subset of the buyers whom she already knows, as well as with any additional buyers to whom she is introduced by the platform. Given these constraints on trade, prices and transactions are induced by a competitive equilibrium. The platform's revenue is proportional to the total price of all trades between platform-introduced buyers and sellers.
In general, we show that the platform's revenue-maximization problem is computationally intractable. We provide structural results for revenue-optimal matchings and isolate special cases in which the platform can efficiently compute them. Furthermore, in a market where the maximum increase in social welfare that the platform can create is $ΔW$, we prove that the platform can attain revenue $Ω(ΔW/\log(\min\{n,m\}))$, where $n$ and $m$ are the numbers of buyers and sellers, respectively. When $ΔW$ is large compared to welfare without the platform, this gives a polynomial-time algorithm that guarantees a logarithmic approximation of the optimal welfare as revenue. We also show that even when the platform optimizes for revenue, the social welfare is at least an $O(\log(\min\{n,m\}))$-approximation to the optimal welfare. Finally, we prove significantly stronger bounds for revenue and social welfare in homogeneous-goods markets. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2406_07385 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Disrupting Bipartite Trading Networks: Matching for Revenue Maximization D'Amico-Wong, Luca Gonczarowski, Yannai A. Ma, Gary Qiurui Parkes, David C. Computer Science and Game Theory Computational Complexity We model the role of an online platform disrupting a market with unit-demand buyers and unit-supply sellers. Each seller can transact with a subset of the buyers whom she already knows, as well as with any additional buyers to whom she is introduced by the platform. Given these constraints on trade, prices and transactions are induced by a competitive equilibrium. The platform's revenue is proportional to the total price of all trades between platform-introduced buyers and sellers. In general, we show that the platform's revenue-maximization problem is computationally intractable. We provide structural results for revenue-optimal matchings and isolate special cases in which the platform can efficiently compute them. Furthermore, in a market where the maximum increase in social welfare that the platform can create is $ΔW$, we prove that the platform can attain revenue $Ω(ΔW/\log(\min\{n,m\}))$, where $n$ and $m$ are the numbers of buyers and sellers, respectively. When $ΔW$ is large compared to welfare without the platform, this gives a polynomial-time algorithm that guarantees a logarithmic approximation of the optimal welfare as revenue. We also show that even when the platform optimizes for revenue, the social welfare is at least an $O(\log(\min\{n,m\}))$-approximation to the optimal welfare. Finally, we prove significantly stronger bounds for revenue and social welfare in homogeneous-goods markets. |
| title | Disrupting Bipartite Trading Networks: Matching for Revenue Maximization |
| topic | Computer Science and Game Theory Computational Complexity |
| url | https://arxiv.org/abs/2406.07385 |