{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T00:15:26Z","timestamp":1742948126007,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031164736"},{"type":"electronic","value":"9783031164743"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-16474-3_26","type":"book-chapter","created":{"date-parts":[[2022,9,12]],"date-time":"2022-09-12T14:16:28Z","timestamp":1662992188000},"page":"309-321","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Driver Equitability and\u00a0Customer Optimality in\u00a0Intelligent Vehicle Applications"],"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"}]}],"member":"297","published-online":{"date-parts":[[2022,9,13]]},"reference":[{"key":"26_CR1","unstructured":"Aleksandrov, M.: Jealousy-freeness and other common properties in fair division of mixed manna. CoRR abs\/2004.11469 (2020). https:\/\/arxiv.org\/abs\/2004.11469"},{"key":"26_CR2","doi-asserted-by":"publisher","unstructured":"Aleksandrov, M.D.: Fleet fairness and fleet efficiency in capacitated pickup and delivery problems. In: Proceedings of the 32nd IEEE Intelligent Vehicles Symposium (IV21), Nagoya, Japan, 11\u201317 July 2021, pp. 1156\u20131161. IEEE Xplore, July 2021. https:\/\/doi.org\/10.1109\/IV48863.2021.9576002","DOI":"10.1109\/IV48863.2021.9576002"},{"key":"26_CR3","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-3-030-86230-5_16","volume-title":"Progress in Artificial Intelligence","author":"MD Aleksandrov","year":"2021","unstructured":"Aleksandrov, M.D.: Minimising fleet times in multi-depot pickup and dropoff problems. In: Marreiros, G., Melo, F.S., Lau, N., Lopes Cardoso, H., Reis, L.P. (eds.) EPIA 2021. LNCS (LNAI), vol. 12981, pp. 199\u2013210. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-86230-5_16"},{"key":"26_CR4","unstructured":"Aleksandrov, M.D.: Fairness for drivers with additive profits in emerging vehicle routing problems. Technical report, AAAI Press, March 2022. https:\/\/martofena.github.io\/fevrps\/publications\/2022aaai-symp.pdf"},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"Bei, X., Zhang, S.: Algorithms for trip-vehicle assignment in ride-sharing. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 32, no. 1, April 2018. https:\/\/ojs.aaai.org\/index.php\/AAAI\/article\/view\/11298","DOI":"10.1609\/aaai.v32i1.11298"},{"key":"26_CR6","doi-asserted-by":"publisher","unstructured":"Brams, S.J., Taylor, A.D.: Fair Division - From Cake-Cutting to Dispute Resolution. Cambridge University Press, Cambridge (1996). https:\/\/doi.org\/10.1017\/CBO9780511598975","DOI":"10.1017\/CBO9780511598975"},{"key":"26_CR7","unstructured":"Camerer, C.F.: Behavioral Game Theory Experiment in Strategic Interaction, vol. 32. Princeton University Press, Princeton (2003). https:\/\/press.princeton.edu\/books\/hardcover\/9780691090399\/behavioral-game-theory"},{"issue":"1","key":"26_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2307\/2311357","volume":"68","author":"LE Dubins","year":"1961","unstructured":"Dubins, L.E., Spanier, E.H.: How to cut a cake fairly. Am. Math. Mon. 68(1), 1\u201317 (1961). https:\/\/doi.org\/10.2307\/2311357","journal-title":"Am. Math. Mon."},{"key":"26_CR9","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman (1979). https:\/\/dl.acm.org\/doi\/10.5555\/574848"},{"key":"26_CR10","unstructured":"Lesmana, N.S., Zhang, X., Bei, X.: Balancing efficiency and fairness in on-demand ridesourcing, vol. 32, pp. 5309\u20135319. Curran Associates Inc., Red Hook, December 2019. https:\/\/proceedings.neurips.cc\/paper\/2019\/file\/3070e6addcd702cb58de5d7897bfdae1-Paper.pdf"},{"issue":"1","key":"26_CR11","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.ejor.2014.03.003","volume":"238","author":"B Li","year":"2014","unstructured":"Li, B., Krushinsky, D., Reijers, H.A., Woensel, T.V.: The share-a-ride problem: people and parcels sharing taxis. Eur. J. Oper. Res. 238(1), 31\u201340 (2014). https:\/\/doi.org\/10.1016\/j.ejor.2014.03.003","journal-title":"Eur. J. Oper. Res."},{"key":"26_CR12","doi-asserted-by":"publisher","unstructured":"Llorca, D.F., Gutierrez, E.G.: Trustworthy autonomous vehicles. Technical report, KJ-NA-30942-EN-N (online), EUR 30942 EN, Publications Office of the European Union, Luxembourg, ISBN 978-92-76-46055-8, Luxembourg, December 2021. https:\/\/doi.org\/10.2760\/120385. JRC127051","DOI":"10.2760\/120385"},{"issue":"1","key":"26_CR13","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.ejor.2017.05.034","volume":"264","author":"D M\u00e4nnel","year":"2018","unstructured":"M\u00e4nnel, D., Bortfeldt, A.: Solving the pickup and delivery problem with three-dimensional loading constraints and reloading ban. Eur. J. Oper. Res. 264(1), 119\u2013137 (2018). https:\/\/doi.org\/10.1016\/j.ejor.2017.05.034","journal-title":"Eur. J. Oper. Res."},{"key":"26_CR14","doi-asserted-by":"publisher","unstructured":"Pareto, V.: Cours d\u2019\u00e9conomie politique. \u0152uvres compl\u00e8tes publi\u00e9es sous la direction de giovanni busino. tomes 1 et 2 en un volume (1897). https:\/\/doi.org\/10.3917\/droz.paret.1964.01. 9782600040143","DOI":"10.3917\/droz.paret.1964.01"},{"key":"26_CR15","doi-asserted-by":"crossref","unstructured":"Rheingans-Yoo, D., Kominers, S.D., Ma, H., Parkes, D.C.: Ridesharing with driver location preferences. In: Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, IJCAI-2019, pp. 557\u2013564. International Joint Conferences on Artificial Intelligence Organization, July 2019. https:\/\/dl.acm.org\/doi\/abs\/10.5555\/3367032.3367112","DOI":"10.24963\/ijcai.2019\/79"},{"key":"26_CR16","doi-asserted-by":"publisher","unstructured":"Santos, D.O., Xavier, E.C.: Dynamic taxi and ridesharing: a framework and heuristics for the optimization problem. In: Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence, IJCAI 2013, pp. 2885\u20132891. AAAI Press, August 2013. https:\/\/doi.org\/10.5555\/2540128.2540544","DOI":"10.5555\/2540128.2540544"}],"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-16474-3_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,12]],"date-time":"2022-09-12T14:20:37Z","timestamp":1662992437000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-16474-3_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031164736","9783031164743"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-16474-3_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"13 September 2022","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":"Lisbon","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"epia2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/epia2022.inesc-id.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":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"85","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":"64","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":"75% - 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":"3,7","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":"0,9","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)"}}]}}