{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T04:31:29Z","timestamp":1729657889839,"version":"3.28.0"},"reference-count":40,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,5,2]],"date-time":"2022-05-02T00:00:00Z","timestamp":1651449600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,5,2]],"date-time":"2022-05-02T00:00:00Z","timestamp":1651449600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,5,2]]},"DOI":"10.1109\/infocom48880.2022.9796963","type":"proceedings-article","created":{"date-parts":[[2022,6,20]],"date-time":"2022-06-20T21:18:49Z","timestamp":1655759929000},"page":"1079-1088","source":"Crossref","is-referenced-by-count":0,"title":["A Unified Model for Bi-objective Online Stochastic Bipartite Matching with Two-sided Limited Patience"],"prefix":"10.1109","author":[{"given":"Gaofei","family":"Xiao","sequence":"first","affiliation":[{"name":"Nanjing University,State Key Laboratory for Novel Software Technology,China"}]},{"given":"Jiaqi","family":"Zheng","sequence":"additional","affiliation":[{"name":"Nanjing University,State Key Laboratory for Novel Software Technology,China"}]},{"given":"Haipeng","family":"Dai","sequence":"additional","affiliation":[{"name":"Nanjing University,State Key Laboratory for Novel Software Technology,China"}]}],"member":"263","reference":[{"year":"2017","key":"ref39","article-title":"The dataset of haikou city"},{"year":"2013","key":"ref38","article-title":"The dataset of new york city"},{"key":"ref33","article-title":"New algorithms, better bounds, and a novel model for online stochastic matching","author":"brubach","year":"2016","journal-title":"Proceedings of 24th Annual European Symposium on Algorithms (ESA 2016)"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2013.0621"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1120.0551"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25510-6_15"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/1147954.1147956"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.2139\/ssrn.3421227"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48350-3_1"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.85"},{"article-title":"Assortment planning for recommendations at checkout under inventory constraints","year":"2016","author":"chen","key":"ref10"},{"article-title":"Group-level fairness maximization in online bipartite matching","year":"2020","author":"ma","key":"ref40"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/100216.100262"},{"key":"ref12","article-title":"Online matching and ad allocation","author":"mehta","year":"2013","journal-title":"Foundations and Trends\ufffd in Theoretical Computer Science"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-45046-4_25"},{"key":"ref14","article-title":"Bi-objective online matching and submodular allocations","author":"esfandiari","year":"2016","journal-title":"Proceedings of Advances in Neural Information Processing Systems"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2527003"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/6"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33011877"},{"key":"ref18","article-title":"Dominant resource fairness: Fair allocation of multiple resource types","author":"ghodsi","year":"2011","journal-title":"Proceedings of NSDI"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/2940716.2940763"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-019-00603-7"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33012245"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-011-9511-8"},{"key":"ref3","doi-asserted-by":"crossref","DOI":"10.1609\/aaai.v32i1.11298","article-title":"Algorithms for trip-vehicle assignment in ride-sharing","author":"bei","year":"2018","journal-title":"Proceedings of Thirty-Second AAAI Conference on Artificial Intelligence"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.14778\/2994509.2994523"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2009.72"},{"key":"ref5","doi-asserted-by":"crossref","DOI":"10.1609\/aaai.v32i1.11477","article-title":"Allocation problems in ride-sharing platforms: Online matching with offline reusable resources","author":"dickerson","year":"2018","journal-title":"Proceedings of the AAAI Conference on Artificial Intelligence"},{"key":"ref8","article-title":"Online task assignment in crowdsourcing markets","author":"ho","year":"2012","journal-title":"Proceedings of the AAAI Conference on Artificial Intelligence"},{"key":"ref7","doi-asserted-by":"crossref","DOI":"10.1609\/hcomp.v3i1.13236","article-title":"Online assignment of heterogeneous tasks in crowdsourcing markets","author":"assadi","year":"2015","journal-title":"Proceedings of the AAAI Conference on Human Computation and Crowdsourcing"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2018.04.005"},{"article-title":"Online resource allocation under arbitrary arrivals: Optimal algorithms and tight competitive ratios","year":"2017","author":"ma","key":"ref9"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/3328526.3329573"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/2739040"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/3219166.3219174"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1613\/jair.4405"},{"article-title":"Balancing the tradeoff between profit and fairness in rideshare platforms during high-demand hours","year":"2019","author":"nanda","key":"ref24"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2020\/580"},{"key":"ref26","article-title":"Balancing efficiency and fairness in on-demand ridesourcing","volume":"2019","author":"lesmana","year":"2019","journal-title":"Advances in Neural Information Processing Systems 32 Annual Conference on Neural Information Processing Systems 2019 NeurIPS 2019"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330793"}],"event":{"name":"IEEE INFOCOM 2022 - IEEE Conference on Computer Communications","start":{"date-parts":[[2022,5,2]]},"location":"London, United Kingdom","end":{"date-parts":[[2022,5,5]]}},"container-title":["IEEE INFOCOM 2022 - IEEE Conference on Computer Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9796607\/9796652\/09796963.pdf?arnumber=9796963","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,8]],"date-time":"2023-02-08T21:40:50Z","timestamp":1675892450000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9796963\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,2]]},"references-count":40,"URL":"https:\/\/doi.org\/10.1109\/infocom48880.2022.9796963","relation":{},"subject":[],"published":{"date-parts":[[2022,5,2]]}}}