Abstract
A core tension in the operations of online marketplaces is between segmentation (wherein platforms can increase revenue by segmenting the market into ever smaller sub-markets) and thickness (wherein the size of the sub-market affects the utility experienced by an agent). An important example of this is in dynamic online marketplaces, where buyers and sellers, in addition to preferences for different matches, also have finite patience (or deadlines) for being matched. We formalize this trade-off via a novel optimization problem that we term as 'Two-sided Facility Location': we consider a market wherein agents arrive at nodes embedded in an underlying metric space, where the distance between a buyer and seller captures the quality of the corresponding match. The platform posts prices and wages at the nodes, and opens a set of virtual clearinghouses where agents are routed for matching. To ensure high match-quality, the platform imposes a distance constraint between an agent and its clearinghouse; to ensure thickness, the platform requires the flow to any clearinghouse be at least a pre-specified lower bound. Subject to these constraints, the goal of the platform is to maximize the social surplus subject to weak budget balance, i.e., profit being non-negative. Our work characterizes the complexity of this problem by providing both hardness results as well as algorithms for this setting; in particular, we present an algorithm that for any constant ε > 0 yields a (1 + ε ) approximation for the gains from trade, while relaxing the match quality (i.e., maximum distance of any match) by a constant factor.
- Uber is experimenting with letting riders wait longer in exchange for cheaper fares. Quartz Magazine, June 2018.Google Scholar
- Ivo Adan, Ana Busic, Jean Mairesse, and Gideon Weiss. Reversibility and further properties of fcfs infinite bipartite matching. arXiv preprint arXiv:1507.05939, 2015.Google Scholar
- Ivo Adan and Gideon Weiss. Exact FCFS matching rates for two infinite multitype sequences. Operations research, 60(2):475--489, 2012. Google Scholar
Digital Library
- Mohammad Akbarpour, Shengwu Li, and Shayan Oveis Gharan. Dynamic matching market design. In ACM Conference on Economics and Computation, EC '14, Stanford , CA, USA, June 8--12, 2014, page 355, 2014. Google Scholar
Digital Library
- Noga Alon, Uriel Feige, Avi Wigderson, and David Zuckerman. Derandomized graph products. Comput. Complex., 5(1):60--75, January 1995. Google Scholar
Digital Library
- Mark Armstrong. Competition in two-sided markets. The RAND Journal of Economics, 37(3):668--691, 2006.Google Scholar
Cross Ref
- Yossi Azar, Ashish Chiplunkar, and Haim Kaplan. Polylogarithmic bounds on the competitiveness of min-cost perfect matching with delays. In Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16--19, pages 1051--1061, 2017. Google Scholar
Digital Library
- Siddhartha Banerjee, Sreenivas Gollapudi, Kostas Kollias, and Kamesh Munagala. Segmenting two-sided markets. In Proceedings of the 26th International Conference on World Wide Web, WWW 2017, Perth, Australia, April 3--7, 2017, pages 63--72, 2017. Google Scholar
Digital Library
- Siddhartha Banerjee, Ramesh Johari, and Carlos Riquelme. Pricing in ride-sharing platforms: A queueing-theoretic approach. In Proceedings of the Sixteenth ACM Conference on Economics and Computation, EC '15, pages 639--639, 2015. Google Scholar
Digital Library
- Liad Blumrosen and Yehonatan Mizrahi. Approximating gains-from-trade in bilateral trading. In Proceedings of the 12th International Conference on Web and Internet Economics, WINE 2016, pages 400--413, 2016. Google Scholar
Digital Library
- Nam Kyoo Boots and Henk Tijms. A multiserver queueing system with impatient customers. Management Science, 45(3):444--448, 1999.Google Scholar
Digital Library
- Johannes Brustle, Yang Cai, Fa Wu, and Mingfei Zhao. Approximating gains from trade in two-sided markets via simple mechanisms. CoRR, abs/1706.04637, 2017.Google Scholar
- René Caldentey, Edward H Kaplan, and Gideon Weiss. Fcfs infinite bipartite matching of servers and customers. Advances in Applied Probability, 41(3):695--730, 2009.Google Scholar
Cross Ref
- Shuchi Chawla, Nikhil R. Devanur, Alexander E. Holroyd, Anna R. Karlin, James Martin, and Balasubramanian Sivan. Stability of service under time-of-use pricing. In ACM STOC, 2017. Google Scholar
Digital Library
- Shuchi Chawla, Nikhil R. Devanur, Janardhan Kulkarni, and Rad Niazadeh. Truth and regret in online scheduling. In ACM EC, 2017. Google Scholar
Digital Library
- Riccardo Colini-Baldeschi, Bart de Keijzer, Stefano Leonardi, and Stefano Turchetta. Approximately efficient double auctions with strong budget balance. In Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10--12, 2016, pages 1424--1443, 2016. Google Scholar
Digital Library
- Riccardo Colini-Baldeschi, Paul W. Goldberg, Bart de Keijzer, Stefano Leonardi, Tim Roughgarden, and Stefano Turchetta. Approximately efficient two-sided combinatorial auctions. In Proceedings of the 2017 ACM Conference on Economics and Computation, EC '17, pages 591--608, 2017. Google Scholar
Digital Library
- Brian C. Dean, Michel X. Goemans, and Jan Vondák. Approximating the stochastic knapsack problem: The benefit of adaptivity. Mathematics of Operations Research, 33(4):945--964, 2008.Google Scholar
Cross Ref
- Yuval Emek, Shay Kutten, and Roger Wattenhofer. Online matching: haste makes waste! In Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, Cambridge, MA, USA, June 18--21, 2016, pages 333--344, 2016. Google Scholar
Digital Library
- Zachary Friggstad, Mohsen Rezapour, and Mohammad R. Salavatipour. Approximating connected facility location with lower and upper bounds via LP rounding. In 15th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2016, June 22--24, 2016, Reykjavik, Iceland, pages 1:1--1:14, 2016.Google Scholar
- Sudipto Guha, Adam Meyerson, and Kamesh Munagala. Hierarchical placement and network design problems. In 41st Annual Symposium on Foundations of Computer Science, FOCS 2000, 12--14 November 2000, Redondo Beach, California, USA, pages 603--612, 2000. Google Scholar
Digital Library
- Itai Gurvich, Amy Ward, et al. On the dynamic control of matching queues. Stochastic Systems, 4(2):479--523, 2014.Google Scholar
Cross Ref
- Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Mohammad Mahdian, and David C. Parkes. Online auctions with re-usable goods. In Proceedings 6th ACM Conference on Electronic Commerce (EC-2005), Vancouver, BC, Canada, June 5--8, 2005, pages 165--174, 2005. Google Scholar
Digital Library
- Elad Hazan, Shmuel Safra, and Oded Schwartz. On the complexity of approximating k-set packing. Comput. Complex., 15(1):20--39, May 2006. Google Scholar
Digital Library
- David R. Karger and Maria Minkoff. Building steiner trees with incomplete global knowledge. In 41st Annual Symposium on Foundations of Computer Science, FOCS 2000, 12--14 November 2000, Redondo Beach, California, USA, pages 613--623, 2000. Google Scholar
Digital Library
- Samir Khuller, Anna Moss, and Joseph (Seffi) Naor. The budgeted maximum coverage problem. Information Processing Letters, 70(1):39 -- 45, 1999. Google Scholar
Digital Library
- Aukasz Kruk, John Lehoczky, Kavita Ramanan, and Steven Shreve. Heavy traffic analysis for EDF queues with reneging. Ann. Appl. Probab., 21(2):484--545, 2011.Google Scholar
Cross Ref
- R Preston McAfee. The gains from trade under fixed price mechanisms. Applied Economics Research Bulletin, 1(1):1--10, 2008.Google Scholar
- Adam Meyerson. Profit-earning facility location. In Proceedings of the Thirty-third Annual ACM Symposium on Theory of Computing, STOC '01, pages 30--36, 2001. Google Scholar
Digital Library
- Roger B Myerson and Mark A Satterthwaite. Efficient mechanisms for bilateral trading. Journal of Economic Theory, 29(2):265 -- 281, 1983.Google Scholar
Cross Ref
- Jean-Charles Rochet and Jean Tirole. Platform Competition in Two-Sided Markets. Journal of the European Economic Association, 1(4):990--1029, 2003.Google Scholar
Cross Ref
- Zoya Svitkina. Lower-bounded facility location. In Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20--22, 2008, pages 1154--1163, 2008. Google Scholar
Digital Library
- Amy R. Ward and Peter W. Glynn. A diffusion approximation for a markovian queue with reneging. Queueing Systems, 43(1):103--128, 2003. Google Scholar
Digital Library
- E. Glen Weyl. A price theory of multi-sided platforms. American Economic Review, 100(4):1642--72, September 2010.Google Scholar
Cross Ref
- David P Williamson and David B Shmoys. The design of approximation algorithms. Cambridge university press, 2011. Google Scholar
Digital Library
Index Terms
The Segmentation-Thickness Tradeoff in Online Marketplaces
Recommendations
The Segmentation-Thickness Tradeoff in Online Marketplaces
SIGMETRICS '19: Abstracts of the 2019 SIGMETRICS/Performance Joint International Conference on Measurement and Modeling of Computer SystemsA core tension in the operations of online marketplaces is between segmentation (wherein platforms can increase revenue by segmenting the market into ever smaller sub-markets) and thickness (wherein the size of the sub-market affects the utility ...
Approximately Efficient Two-Sided Combinatorial Auctions
EC '17: Proceedings of the 2017 ACM Conference on Economics and ComputationWe develop and extend a line of recent work on the design of mechanisms for two-sided markets. The markets we consider consist of buyers and sellers of a number of items, and the aim of a mechanism is to improve the social welfare by arranging purchases ...
Approximating Gains from Trade in Two-sided Markets via Simple Mechanisms
EC '17: Proceedings of the 2017 ACM Conference on Economics and ComputationWe 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 with only one ...






Comments