{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T17:43:08Z","timestamp":1775929388530,"version":"3.50.1"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031490101","type":"print"},{"value":"9783031490118","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-49011-8_32","type":"book-chapter","created":{"date-parts":[[2023,12,14]],"date-time":"2023-12-14T16:03:27Z","timestamp":1702569807000},"page":"401-412","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Safety, Stability, and Efficiency of Taxi Rides"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0047-1235","authenticated-orcid":false,"given":"Martin","family":"Aleksandrov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tobias","family":"Labarta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,15]]},"reference":[{"key":"32_CR1","unstructured":"Breiding, M.J.: Prevalence and characteristics of sexual violence, stalking, and intimate partner violence victimization-national intimate partner and sexual violence survey, united states, 2011. Morbidity and mortality weekly report. In: Surveillance summaries (Washington, DC: 2002), vol. 63, no. 8, p. 1 (2014). https:\/\/ajph.aphapublications.org\/doi\/10.2105\/AJPH.2015.302634"},{"key":"32_CR2","unstructured":"Brown, E.: Fare trade: reconciling public safety and gender discrimination in single-sex ridesharing. Yale L. & Pol\u2019y Rev. 35, 367 (2016). https:\/\/www.jstor.org\/stable\/26601904"},{"key":"32_CR3","doi-asserted-by":"publisher","unstructured":"Chen, J., Niedermeier, R., Skowron, P.: Stable marriage with multi-modal preferences. In: Proceedings of the 2018 ACM Conference on Economics and Computation, pp. 269\u2013286. EC \u201918, Association for Computing Machinery, New York, NY, USA (2018). https:\/\/doi.org\/10.1145\/3219166.3219168","DOI":"10.1145\/3219166.3219168"},{"key":"32_CR4","doi-asserted-by":"crossref","unstructured":"Fileborn, B., Cama, E., Young, A.: Perceptions of safety among taxi and rideshare service patrons: gender, safekeeping and responsibilisation. Int. J. Crime Justice Soc. Democr. 11(4), 40 (2022). https:\/\/www.crimejusticejournal.com\/article\/view\/2085","DOI":"10.5204\/ijcjsd.2085"},{"key":"32_CR5","doi-asserted-by":"crossref","unstructured":"Gale, D., Shapley, L.S.: College admissions and the stability of marriage. Am. Math. Mon. 69(1), 9\u201315 (1962). https:\/\/www.jstor.org\/stable\/2312726","DOI":"10.1080\/00029890.1962.11989827"},{"key":"32_CR6","doi-asserted-by":"publisher","unstructured":"Hopcroft, J.E., Karp, R.M.: A n5\/2 algorithm for maximum matchings in bipartite. In: Proceedings of the 12th Annual Symposium on Switching and Automata Theory (Swat 1971), pp. 122\u2013125. SWAT \u201971, IEEE Computer Society, USA (1971). https:\/\/doi.org\/10.1109\/SWAT.1971.1","DOI":"10.1109\/SWAT.1971.1"},{"key":"32_CR7","doi-asserted-by":"crossref","unstructured":"Iwama, K., Manlove, D., Miyazaki, S., Morita, Y.: Stable marriage with incomplete lists and ties. In: Wiedermann, J., van Emde Boas, P., Nielsen, M. (eds.) Automata, Languages and Programming, pp. 443\u2013452. Springer, Berlin Heidelberg, Heidelberg (1999). https:\/\/link.springer.com\/chapter\/10.1007\/3-540-48523-6_41","DOI":"10.1007\/3-540-48523-6_41"},{"key":"32_CR8","doi-asserted-by":"publisher","unstructured":"Karp, R.M., Vazirani, U.V., Vazirani, V.V.: An optimal algorithm for on-line bipartite matching. In: Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing, pp. 352\u2013358. STOC \u201990, Association for Computing Machinery, New York, NY, USA (1990). https:\/\/doi.org\/10.1145\/100216.100262","DOI":"10.1145\/100216.100262"},{"issue":"1\u20132","key":"32_CR9","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"HW Kuhn","year":"1955","unstructured":"Kuhn, H.W.: The Hungarian method for the assignment problem. Naval Res. Logist. Quart. 2(1\u20132), 83\u201397 (1955). https:\/\/doi.org\/10.1002\/nav.3800020109. March","journal-title":"Naval Res. Logist. Quart."},{"key":"32_CR10","unstructured":"Lesmana, N.S., Zhang, X., Bei, X.: Balancing efficiency and fairness in on-demand ridesourcing. In: Wallach, H., Larochelle, H., Beygelzimer, A., d\u2019Alch\u00e9-Buc, F., Fox, E., Garnett, R. (eds.) Advances in Neural Information Processing Systems. vol. 32, pp. 5309\u20135319. Curran Associates, Inc. https:\/\/proceedings.neurips.cc\/paper\/2019\/hash\/3070e6addcd702cb58de5d7897bfdae1-Abstract.html"},{"key":"32_CR11","doi-asserted-by":"publisher","unstructured":"Mehta, A.: Online matching and ad allocation. Found. Trends Theor. Comput. Sci. 8(4), 265\u2013368 (2013). https:\/\/doi.org\/10.1561\/0400000057","DOI":"10.1561\/0400000057"},{"key":"32_CR12","doi-asserted-by":"crossref","unstructured":"Tomizawa, N.: On some techniques useful for solution of transportation network problems. Networks 1, 173\u2013194 (1971). https:\/\/onlinelibrary.wiley.com\/doi\/abs\/10.1002\/net.3230010206","DOI":"10.1002\/net.3230010206"},{"key":"32_CR13","doi-asserted-by":"crossref","unstructured":"Zhao, B., Xu, P., Shi, Y., Tong, Y., Zhou, Z., Zeng, Y.: Preference-aware task assignment in on-demand taxi dispatching: an online stable matching approach. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 33, pp. 2245\u20132252 (2019). https:\/\/ojs.aaai.org\/index.php\/AAAI\/article\/view\/4060","DOI":"10.1609\/aaai.v33i01.33012245"}],"container-title":["Lecture Notes in Computer Science","Progress in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-49011-8_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,14]],"date-time":"2023-12-14T16:10:44Z","timestamp":1702570244000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49011-8_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031490101","9783031490118"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49011-8_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"15 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EPIA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"EPIA Conference on Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Faial Island","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"epia2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/epia2023.inesctec.pt\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easy Chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"163","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"85","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"52% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}