Competitive Analysis of Vehicle-Sharing Systems With Cournot Queueing Games

Product-form closed queueing networks are a useful formalism for analyzing the availability of vehicles within a vehicle sharing system with stochastic user behavior. However, existing models assume that the provider has full control over the system. In reality, competition between providers within a single geographic area is quite common. In this paper, we introduce a non-cooperative game that extends a closed queueing model into a competitive environment, in which players decide the number of jobs that they wish to submit. This can be used to model vehicle sharing systems with multiple providers, in which they receive fares from trips but are responsible for the costs of their own fleet. The core technical results of this paper include conditions that guarantee the existence of a pure Nash equilibrium, and an efficient equilibrium-finding algorithm. We then present a case study, using our model, of a vehicle sharing system in Oslo with multiple providers. In this case study, we find that adding an additional competitor can increase the number of trips by up to 18.9%, and a highly competitive market can increase this by up to 30%.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Intelligent Transportation Systems
Published
2025-05-15
DOI
https://doi.org/10.1109/tits.2025.3565904
Citations
2
Primary Topic
Transportation and Mobility Innovations
Type
article
Field-Weighted Citation Impact
1.37
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Competitive Analysis of Vehicle-Sharing Systems With Cournot Queueing Games

Matthew Sheldon, Giuliano Casale, Dario Paccagnan
2 citations
IEEE Transactions on Intelligent Transportation Systems
Transportation and Mobility Innovations
1.37
article

Competitive Analysis of Vehicle-Sharing Systems With Cournot Queueing Games

Matthew Sheldon, Giuliano Casale, Dario Paccagnan
article en
2 citations

Abstract

Product-form closed queueing networks are a useful formalism for analyzing the availability of vehicles within a vehicle sharing system with stochastic user behavior. However, existing models assume that the provider has full control over the system. In reality, competition between providers within a single geographic area is quite common. In this paper, we introduce a non-cooperative game that extends a closed queueing model into a competitive environment, in which players decide the number of jobs that they wish to submit. This can be used to model vehicle sharing systems with multiple providers, in which they receive fares from trips but are responsible for the costs of their own fleet. The core technical results of this paper include conditions that guarantee the existence of a pure Nash equilibrium, and an efficient equilibrium-finding algorithm. We then present a case study, using our model, of a vehicle sharing system in Oslo with multiple providers. In this case study, we find that adding an additional competitor can increase the number of trips by up to 18.9%, and a highly competitive market can increase this by up to 30%.

IEEE Transactions on Intelligent Transportation SystemsVol. 26(8)
Imperial College London (GB)
Openalex Percentile: Top 19%
Transportation and Mobility Innovations
1.37
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.