{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,12]],"date-time":"2026-10-12T11:54:23Z","timestamp":1791806063036,"version":"4.3.4"},"publisher-location":"New York, NY, USA","reference-count":46,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,5,13]],"date-time":"2024-05-13T00:00:00Z","timestamp":1715558400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100006374","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["1948157"],"award-info":[{"award-number":["1948157"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,5,13]]},"DOI":"10.1145\/3589334.3645335","type":"proceedings-article","created":{"date-parts":[[2024,5,8]],"date-time":"2024-05-08T07:08:13Z","timestamp":1715152093000},"page":"5-13","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Tight Competitive and Variance Analyses of Matching Policies in Gig Platforms"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6362-6727","authenticated-orcid":false,"given":"Pan","family":"Xu","sequence":"first","affiliation":[{"name":"Department of Computer Science, New Jersey Institute of Technology, Newark, NJ, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,5,13]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48350-3_1"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/120878422"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2229012.2229018"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2872427.2883032"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3033274.3085099"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2994501.2994505"},{"key":"e_1_3_2_2_7_1","volume-title":"Spatial pricing in ride-sharing networks. Operations Research","author":"Bimpikis Kostas","year":"2019","unstructured":"Kostas Bimpikis, Ozan Candogan, and Daniela Saban. 2019. Spatial pricing in ride-sharing networks. Operations Research (2019)."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-019-00603-7"},{"key":"e_1_3_2_2_9_1","volume-title":"Aravind Srinivasan, and Pan Xu.","author":"Brubach Brian","year":"2020","unstructured":"Brian Brubach, Karthik Abinav Sankararaman, Aravind Srinivasan, and Pan Xu. 2020b. Online stochastic matching: New algorithms and bounds. Algorithmica (2020)."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2019.00016"},{"key":"e_1_3_2_2_11_1","volume-title":"Inventory balancing with online learning. arXiv preprint arXiv:1810.05640","author":"Cheung Wang Chi","year":"2018","unstructured":"Wang Chi Cheung, Will Ma, David Simchi-Levi, and Xinshang Wang. 2018. Inventory balancing with online learning. arXiv preprint arXiv:1810.05640 (2018)."},{"key":"e_1_3_2_2_12_1","volume-title":"International Conference on Autonomous Agents and Multiagent Systems (AAMAS).","author":"Dickerson John","year":"2019","unstructured":"John Dickerson, Karthik Sankararaman, Kanthi Sarpatwar, Aravind Srinivasan, Kung-Lu Wu, and Pan Xu. 2019a. Online resource allocation with matching constraints. In International Conference on Autonomous Agents and Multiagent Systems (AAMAS)."},{"key":"e_1_3_2_2_13_1","volume-title":"Allocation problems in ride-sharing platforms: Online matching with offline reusable resources. ACM Transactions on Economics and Computation","author":"Dickerson John","year":"2020","unstructured":"John Dickerson, Karthik Sankararaman, Aravind Srinivasan, and Pan Xu. 2020. Allocation problems in ride-sharing platforms: Online matching with offline reusable resources. ACM Transactions on Economics and Computation (2020)."},{"key":"e_1_3_2_2_14_1","volume-title":"Online Resource Allocation with Matching Constraints. In AAMAS'19","author":"Dickerson John P","year":"2019","unstructured":"John P Dickerson, Karthik Abinav Sankararaman, Kanthi Kiran Sarpatwar, Aravind Srinivasan, Kun-Lung Wu, and Pan Xu. 2019b. Online Resource Allocation with Matching Constraints. In AAMAS'19. 1681--1689."},{"key":"e_1_3_2_2_15_1","volume-title":"AAMAS '18","author":"Dickerson John P.","year":"2018","unstructured":"John P. Dickerson, Karthik Abinav Sankararaman, Aravind Srinivasan, and Pan Xu. 2018. Assigning Tasks to Workers based on Historical Data: Online Task Assignment with Two-sided Arrivals. In AAMAS '18. 318--326."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977912.147"},{"key":"e_1_3_2_2_17_1","series-title":"BRICS Report Series","volume-title":"Balls and bins: A study in negative dependence","author":"Dubhashi Devdatt P","year":"1996","unstructured":"Devdatt P Dubhashi and Desh Ranjan. 1996. Balls and bins: A study in negative dependence. BRICS Report Series, Vol. 3, 25 (1996)."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i5.25698"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052564"},{"key":"e_1_3_2_2_20_1","volume-title":"Multi-stage and multi-customer assortment optimization with inventory constraints. Available at SSRN 3443109","author":"Fata Elaheh","year":"2019","unstructured":"Elaheh Fata, Will Ma, and David Simchi-Levi. 2019. Multi-stage and multi-customer assortment optimization with inventory constraints. Available at SSRN 3443109 (2019)."},{"key":"e_1_3_2_2_21_1","volume-title":"Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms. SIAM, 123--135","author":"Feldman Michal","year":"2014","unstructured":"Michal Feldman, Nick Gravin, and Brendan Lucier. 2014. Combinatorial auctions via posted prices. In Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms. SIAM, 123--135."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.23919\/ACC50511.2021.9483145"},{"key":"e_1_3_2_2_23_1","volume-title":"Linear programming based online policies for real-time assortment of reusable resources. Available at SSRN 3421227","author":"Feng Yiding","year":"2019","unstructured":"Yiding Feng, Rad Niazadeh, and Amin Saberi. 2019. Linear programming based online policies for real-time assortment of reusable resources. Available at SSRN 3421227 (2019)."},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2022.2345"},{"key":"e_1_3_2_2_25_1","volume-title":"Online Matching with Stochastic Rewards: Advanced Analyses Using Configuration Linear Programs. In International Conference on Web and Internet Economics. Springer, 384--401","author":"Huang Zhiyi","year":"2023","unstructured":"Zhiyi Huang, Hanrui Jiang, Aocheng Shen, Junkai Song, Zhiang Wu, and Qiankun Zhang. 2023. Online Matching with Stochastic Rewards: Advanced Analyses Using Configuration Linear Programs. In International Conference on Web and Internet Economics. Springer, 384--401."},{"key":"e_1_3_2_2_26_1","volume-title":"Negative association of random variables with applications. The Annals of Statistics","author":"Joag-Dev Kumar","year":"1983","unstructured":"Kumar Joag-Dev and Frank Proschan. 1983. Negative association of random variables with applications. The Annals of Statistics (1983), 286--295."},{"key":"e_1_3_2_2_27_1","volume-title":"Near Optimal Control of a Ride-Hailing Platform via Mirror Backpressure. arXiv preprint arXiv:1903.02764","author":"Kanoria Yash","year":"2019","unstructured":"Yash Kanoria and Pengyu Qian. 2019. Near Optimal Control of a Ride-Hailing Platform via Mirror Backpressure. arXiv preprint arXiv:1903.02764 (2019)."},{"key":"e_1_3_2_2_28_1","unstructured":"Nixie S Lesmana Xuan Zhang and Xiaohui Bei. 2019. Balancing efficiency and fairness in on-demand ridesourcing. In Advances in Neural Information Processing Systems. 5310--5320."},{"key":"e_1_3_2_2_29_1","volume-title":"Efficient Ridesharing Order Dispatching with Mean Field Multi-Agent Reinforcement Learning. In The World Wide Web Conference, WWW 2019","author":"Li Minne","year":"2019","unstructured":"Minne Li, Zhiwei (Tony) Qin, Yan Jiao, Yaodong Yang, Jun Wang, Chenxi Wang, Guobin Wu, and Jieping Ye. 2019. Efficient Ridesharing Order Dispatching with Mean Field Multi-Agent Reinforcement Learning. In The World Wide Web Conference, WWW 2019, San Francisco, CA, USA, May 13--17, 2019. ACM, 983--994."},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2018.04.005"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3328526.3329556"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2017.0884"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3410048.3410109"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2012.65"},{"key":"e_1_3_2_2_35_1","volume-title":"Equilibrium Inverse Reinforcement Learning for Ride-hailing Vehicle Network. In WWW '21: The Web Conference 2021","author":"Oda Takuma","year":"2021","unstructured":"Takuma Oda. 2021. Equilibrium Inverse Reinforcement Learning for Ride-hailing Vehicle Network. In WWW '21: The Web Conference 2021, Virtual Event \/ Ljubljana, Slovenia, April 19--23, 2021. ACM \/ IW3C2, 2281--2290."},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1287\/stsy.2019.0037"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1609\/icaps.v32i1.19836"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007849609234"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467085"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449967"},{"key":"e_1_3_2_2_41_1","volume-title":"Optimizing Rankings for Recommendation in Matching Markets. In WWW '22: The ACM Web Conference 2022","author":"Su Yi","year":"2022","unstructured":"Yi Su, Magd Bayoumi, and Thorsten Joachims. 2022. Optimizing Rankings for Recommendation in Matching Markets. In WWW '22: The ACM Web Conference 2022, Virtual Event, Lyon, France, April 25 - 29, 2022. ACM, 328--338."},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2016.7498228"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196929"},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2020.2061"},{"key":"e_1_3_2_2_45_1","volume-title":"Online Task Assignment with Controllable Processing Time. arXiv preprint arXiv:2305.04453","author":"Wu Ruoyu","year":"2023","unstructured":"Ruoyu Wu, Wei Bao, and Liming Ge. 2023. Online Task Assignment with Controllable Processing Time. arXiv preprint arXiv:2305.04453 (2023)."},{"key":"e_1_3_2_2_46_1","volume-title":"Exploring the Tradeoff between Competitive Ratio and Variance in Online-Matching Markets. arXiv preprint arXiv:2209.07580","author":"Pan Xu.","year":"2022","unstructured":"Pan Xu. 2022. Exploring the Tradeoff between Competitive Ratio and Variance in Online-Matching Markets. arXiv preprint arXiv:2209.07580 (2022)."}],"event":{"name":"WWW '24: The ACM Web Conference 2024","location":"Singapore Singapore","acronym":"WWW '24","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"]},"container-title":["Proceedings of the ACM Web Conference 2024"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3589334.3645335","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3589334.3645335","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T00:33:05Z","timestamp":1755822785000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3589334.3645335"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,13]]},"references-count":46,"alternative-id":["10.1145\/3589334.3645335","10.1145\/3589334"],"URL":"https:\/\/doi.org\/10.1145\/3589334.3645335","relation":{},"subject":[],"published":{"date-parts":[[2024,5,13]]},"assertion":[{"value":"2024-05-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}