{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T15:10:55Z","timestamp":1775229055935,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,8,14]],"date-time":"2021-08-14T00:00:00Z","timestamp":1628899200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,8,14]]},"DOI":"10.1145\/3447548.3467085","type":"proceedings-article","created":{"date-parts":[[2021,8,13]],"date-time":"2021-08-13T18:21:39Z","timestamp":1628878899000},"page":"3549-3557","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":43,"title":["Learning to Assign: Towards Fair Task Assignment in Large-Scale Ride Hailing"],"prefix":"10.1145","author":[{"given":"Dingyuan","family":"Shi","sequence":"first","affiliation":[{"name":"Beihang University, Beijing, China"}]},{"given":"Yongxin","family":"Tong","sequence":"additional","affiliation":[{"name":"Beihang University, Beijing, China"}]},{"given":"Zimu","family":"Zhou","sequence":"additional","affiliation":[{"name":"Singapore Management University, Singapore, Singapore"}]},{"given":"Bingchen","family":"Song","sequence":"additional","affiliation":[{"name":"Beihang University, Beijing, China"}]},{"given":"Weifeng","family":"Lv","sequence":"additional","affiliation":[{"name":"Beihang University, Beijing, China"}]},{"given":"Qiang","family":"Yang","sequence":"additional","affiliation":[{"name":"The Hong Kong University of Science and Technology & AI Group, WeBank Co., Ltd, Shenzhen, China"}]}],"member":"320","published-online":{"date-parts":[[2021,8,14]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-012-9581-9"},{"key":"e_1_3_2_2_2_1","volume-title":"Understanding inequalities in ridehailing services through simulations. Scientific reports 10, 1","author":"Bok\u00e1nyi Eszter","year":"2020","unstructured":"Eszter Bok\u00e1nyi and Aniko Hann\u00e1k . 2020. Understanding inequalities in ridehailing services through simulations. Scientific reports 10, 1 ( 2020 ), 1--11. Eszter Bok\u00e1nyi and Aniko Hann\u00e1k. 2020. Understanding inequalities in ridehailing services through simulations. Scientific reports 10, 1 (2020), 1--11."},{"key":"e_1_3_2_2_3_1","volume-title":"Proc. EDBT. OpenProceedings.org","author":"Borromeo Ria Mae","year":"2017","unstructured":"Ria Mae Borromeo , Thomas Laurent , Motomichi Toyama , and Sihem Amer-Yahia . 2017 . Fairness and Transparency in Crowdsourcing . In Proc. EDBT. OpenProceedings.org , Venice, Italy, 466--469. Ria Mae Borromeo, Thomas Laurent, Motomichi Toyama, and Sihem Amer-Yahia. 2017. Fairness and Transparency in Crowdsourcing. In Proc. EDBT. OpenProceedings.org, Venice, Italy, 466--469."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1148109.1148159"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.14778\/3407790.3407839"},{"key":"e_1_3_2_2_6_1","volume-title":"Proc. AAAI. AAAI","author":"Cohler Yuga J.","unstructured":"Yuga J. Cohler , John K. Lai , David C. Parkes , and Ariel D. Procaccia . 2011. Optimal Envy-Free Cake Cutting . In Proc. AAAI. AAAI , San Francisco, CA, USA, 626--631. Yuga J. Cohler, John K. Lai, David C. Parkes, and Ariel D. Procaccia. 2011. Optimal Envy-Free Cake Cutting. In Proc. AAAI. AAAI, San Francisco, CA, USA, 626--631."},{"key":"e_1_3_2_2_7_1","volume-title":"Proc","author":"Dickerson John P.","unstructured":"John P. Dickerson , Ariel D. Procaccia , and Tuomas Sandholm . 2014. Price of fairness in kidney exchange . In Proc . AAMAS. Springer , Paris, France , 1013--1020. John P. Dickerson, Ariel D. Procaccia, and Tuomas Sandholm. 2014. Price of fairness in kidney exchange. In Proc. AAMAS. Springer, Paris, France, 1013--1020."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/321694.321699"},{"key":"e_1_3_2_2_9_1","volume-title":"An Improved Algorithm for the Bottleneck Assignment Problem. Operations Research 19.7","author":"Garfinkel Robert S","year":"1971","unstructured":"Robert S Garfinkel . 1971. An Improved Algorithm for the Bottleneck Assignment Problem. Operations Research 19.7 ( 1971 ), 1747--1751. Robert S Garfinkel. 1971. An Improved Algorithm for the Bottleneck Assignment Problem. Operations Research 19.7 (1971), 1747--1751."},{"key":"e_1_3_2_2_10_1","volume-title":"Proc. NSDI. USENIX Association","author":"Ghodsi Ali","year":"2011","unstructured":"Ali Ghodsi , Matei Zaharia , Benjamin Hindman , Andy Konwinski , Scott Shenker , and Ion Stoica . 2011 . Dominant Resource Fairness: Fair Allocation of Multiple Resource Types . In Proc. NSDI. USENIX Association , Boston, MA, USA, 323--336. Ali Ghodsi, Matei Zaharia, Benjamin Hindman, Andy Konwinski, Scott Shenker, and Ion Stoica. 2011. Dominant Resource Fairness: Fair Allocation of Multiple Resource Types. In Proc. NSDI. USENIX Association, Boston, MA, USA, 323--336."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2013.1235"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/2750423.2750439"},{"key":"e_1_3_2_2_13_1","volume-title":"Proc. NeurIPS. Curran Associates Inc.","author":"Lesmana Nixie S.","year":"2019","unstructured":"Nixie S. Lesmana , Xuan Zhang , and Xiaohui Bei . 2019 . Balancing Efficiency and Fairness in On-Demand Ridesourcing . In Proc. NeurIPS. Curran Associates Inc. , Vancouver, BC, Canada, 5310--5320. Nixie S. Lesmana, Xuan Zhang, and Xiaohui Bei. 2019. Balancing Efficiency and Fairness in On-Demand Ridesourcing. In Proc. NeurIPS. Curran Associates Inc., Vancouver, BC, Canada, 5310--5320."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.2307\/2276207"},{"key":"e_1_3_2_2_15_1","volume-title":"Proc. AAAI. AAAI","author":"Duncan","unstructured":"Duncan C. McElfresh and John P. Dickerson. 2018. Balancing Lexicographic Fairness and a Utilitarian Objective With Application to Kidney Exchange . In Proc. AAAI. AAAI , New Orleans, LA, USA, 1161--1168. Duncan C. McElfresh and John P. Dickerson. 2018. Balancing Lexicographic Fairness and a Utilitarian Objective With Application to Kidney Exchange. In Proc. AAAI. AAAI, New Orleans, LA, USA, 1161--1168."},{"key":"e_1_3_2_2_16_1","volume-title":"Making a digital working class: Uber drivers in Boston","author":"Robinson Hilary C","year":"2016","unstructured":"Hilary C Robinson . 2017. Making a digital working class: Uber drivers in Boston , 2016 --2017. Ph.D. Dissertation. Massachusetts Institute of Technology . Hilary C Robinson. 2017. Making a digital working class: Uber drivers in Boston, 2016--2017. Ph.D. Dissertation. Massachusetts Institute of Technology."},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330793"},{"key":"e_1_3_2_2_18_1","volume-title":"Reinforcement learning: An introduction","author":"Sutton Richard S","unstructured":"Richard S Sutton and Andrew G Barto . 2018. Reinforcement learning: An introduction . MIT press , Cambridge . Richard S Sutton and Andrew G Barto. 2018. Reinforcement learning: An introduction. MIT press, Cambridge."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330724"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098018"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.14778\/2994509.2994523"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.2017.0768"},{"key":"e_1_3_2_2_23_1","volume-title":"Proc","author":"Wang Yansheng","unstructured":"Yansheng Wang , Yongxin Tong , Cheng Long , Pan Xu , Ke Xu , and Weifeng Lv. 2019. Adaptive Dynamic Bipartite Graph Matching: A Reinforcement Learning Approach . In Proc . ICDE. IEEE Press, Macao , China , 1478--1489. Yansheng Wang, Yongxin Tong, Cheng Long, Pan Xu, Ke Xu, and Weifeng Lv. 2019. Adaptive Dynamic Bipartite Graph Matching: A Reinforcement Learning Approach. In Proc. ICDE. IEEE Press, Macao, China, 1478--1489."},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33012221"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219824"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098138"}],"event":{"name":"KDD '21: The 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","location":"Virtual Event Singapore","acronym":"KDD '21","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3447548.3467085","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3447548.3467085","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:25:11Z","timestamp":1750195511000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3447548.3467085"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,14]]},"references-count":26,"alternative-id":["10.1145\/3447548.3467085","10.1145\/3447548"],"URL":"https:\/\/doi.org\/10.1145\/3447548.3467085","relation":{},"subject":[],"published":{"date-parts":[[2021,8,14]]},"assertion":[{"value":"2021-08-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}