Canada Spends Logo

Explorez notre analyse du budget 2026

Grant: Discovery Grants Program - Individual

Concordia University

$42,000.00

Stable Matching Mechanisms for Shared Mobility Systems

EF 2023-24

Résumé
As an innovative transportation strategy, shared mobility addresses traffic congestion, parking scarcity, and climate change by shifting mobility from a vehicle ownership model to service-based operations. Unlike public transit systems, shared mobility platforms operate in a market environment in which a supplier (driver) is free to decide whether to comply with the ride request assigned by the platform. In such a transport mode, drivers' ride acceptance behaviors can significantly influence the performance of a shared mobility platform in terms of riders' waiting time, drivers' occupation rate and idle time, and platform revenue and reputation. The past several years have seen rapidly increased driver ride decline rates, which indicates that the current matching mechanisms are not stable in the sense that drivers often have the incentive to decline assigned ride requests. As such, the long-term objective of this research program is to design stable matching mechanisms for highly dynamic shared mobility systems. Matching stability is a standard requirement in the design of two-sided markets. The economic application of the stable matching theory has been used to guide designs of real-world markets from labor markets to school choice programs, and kidney exchange. However, the classic stable matching theory focuses on finding stable matchings in a static and deterministic setting. Its application to shared mobility faces significant challenges attributable to the highly stochastic, dynamic environment and complex spatiotemporal and socioeconomic constraints of the shared mobility markets. Existing stable matching approaches in the literature are largely restrictive in the sense that they are confined to the boundaries of the oversimplified settings set by the classic stable matching theory. In this research program, we design stable matching mechanisms for shared mobility by modifying and expanding the classic stable matching theory to deliver the features that are required in real shared mobility markets. The outputs of this research can help design matching mechanisms that balance the interests of all stakeholders, promote fairness in ride allocation, foster trust between drivers and the platform, and improve shared mobility service quality. In addition, the methods developed in this program can be general enough to enrich our understanding of the practical market design in the broader context of the sharing economy which is an important enabler of Canada's greener and more innovative future.
Programme
Discovery Grants Program - Individual
Bénéficiaire
Emplacement
Quebec, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data

Tel que publié

Application id
RGPIN-2023-04818
Name nom
Wang, Chun
Department département
Concordia Institute for Information Systems Engineering
Organization id
70
Institution établissement
Concordia University
Province en
Québec
Province fr
Québec
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2023
Competition year année de concours
2023
Award amount
42000
Program id
RGPIN
Program name en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
DISCOVERY RESEARCH
Group fr
RECHERCHE AXÉE SUR LA DÉCOUVERTE
Committee code
1509
Committee name en
Civil, Industrial and Systems Engineering
Committee name fr
Génie civil, industriel et des systèmes
Area of application code
700
Area of application group en
Transportation systems and services
Area of application group fr
Services et systèmes de transport
Area of application en
Transportation systems and services
Area of application fr
Services et systèmes de transport
Research subject code
2710
Research subject group en
Information technology
Research subject group fr
Information systems design
Research subject en
Technologie de l'information
Research subject fr
Conception de systèmes d'information
Application title
Stable Matching Mechanisms for Shared Mobility Systems
Keyword
Intelligent transportation systems; Machine learning; Multi-agent systems; Scheduling; Shared mobility; Supply side behavior modeling; Two-sided matching
Application summary
As an innovative transportation strategy, shared mobility addresses traffic congestion, parking scarcity, and climate change by shifting mobility from a vehicle ownership model to service-based operations. Unlike public transit systems, shared mobility platforms operate in a market environment in which a supplier (driver) is free to decide whether to comply with the ride request assigned by the platform. In such a transport mode, drivers' ride acceptance behaviors can significantly influence the performance of a shared mobility platform in terms of riders' waiting time, drivers' occupation rate and idle time, and platform revenue and reputation. The past several years have seen rapidly increased driver ride decline rates, which indicates that the current matching mechanisms are not stable in the sense that drivers often have the incentive to decline assigned ride requests. As such, the long-term objective of this research program is to design stable matching mechanisms for highly dynamic shared mobility systems. Matching stability is a standard requirement in the design of two-sided markets. The economic application of the stable matching theory has been used to guide designs of real-world markets from labor markets to school choice programs, and kidney exchange. However, the classic stable matching theory focuses on finding stable matchings in a static and deterministic setting. Its application to shared mobility faces significant challenges attributable to the highly stochastic, dynamic environment and complex spatiotemporal and socioeconomic constraints of the shared mobility markets. Existing stable matching approaches in the literature are largely restrictive in the sense that they are confined to the boundaries of the oversimplified settings set by the classic stable matching theory. In this research program, we design stable matching mechanisms for shared mobility by modifying and expanding the classic stable matching theory to deliver the features that are required in real shared mobility markets. The outputs of this research can help design matching mechanisms that balance the interests of all stakeholders, promote fairness in ride allocation, foster trust between drivers and the platform, and improve shared mobility service quality. In addition, the methods developed in this program can be general enough to enrich our understanding of the practical market design in the broader context of the sharing economy which is an important enabler of Canada's greener and more innovative future.