Online Cost-Sharing Mechanism Design for Demand-Responsive Transport Systems
Author
dc.contributor.author
Furuhata, Masabumi
Author
dc.contributor.author
Daniel, Kenny
Author
dc.contributor.author
Koenig, Sven
Author
dc.contributor.author
Ordóñez Pizarro, Fernando
Author
dc.contributor.author
Dessouky, Maged
Author
dc.contributor.author
Brunet, Marc
Author
dc.contributor.author
Cohen, Liron
Author
dc.contributor.author
Wang, Xiaoqing
Admission date
dc.date.accessioned
2015-08-23T00:28:24Z
Available date
dc.date.available
2015-08-23T00:28:24Z
Publication date
dc.date.issued
2015
Cita de ítem
dc.identifier.citation
IEEE Transactions on Intelligent Transportation Systems, vol. 16, no. 2, April 2015
en_US
Identifier
dc.identifier.issn
1558-0016
Identifier
dc.identifier.other
DOI: 10.1109/TITS.2014.2336212
Identifier
dc.identifier.uri
https://repositorio.uchile.cl/handle/2250/133046
General note
dc.description
Artículo de publicación ISI
en_US
Abstract
dc.description.abstract
Demand-responsive transport (DRT) systems provide
flexible transport services for passengers who request
door-to-door rides in shared-ride mode without fixed routes and
schedules. DRT systems face interesting coordination challenges.
For example, one has to design cost-sharing mechanisms for offering
fare quotes to potential passengers so that all passengers are
treated fairly. Themain issue is how the operating costs of the DRT
system should be shared among the passengers (given that different
passengers cause different amounts of inconvenience to the
other passengers), taking into account that DRT systems should
provide fare quotes instantaneously without knowing future ride
request submissions. We determine properties of cost-sharing
mechanisms that make DRT systems attractive to both the transport
providers and passengers, namely online fairness, immediate
response, individual rationality, budget balance, and ex-post incentive
compatibility.We propose a novel cost-sharing mechanism,
which is called Proportional Online Cost Sharing (POCS), which
provides passengers with upper bounds on their fares immediately
after their ride request submissions despite missing knowledge
of future ride request submissions, allowing them to accept their
fare quotes or drop out. We examine how POCS satisfies these
properties in theory and computational experiments.