Abstract
The objective of this paper is to analyze the matching of ride share on a star network where the driver and user trips are uniformly and independently distributed. Through this simple spatial model, we derive two analytical expressions: the probabilities of matching of ride share and the expectation of the number of users waiting for be matched. Using Crofton's formula, our first main conclusion is that the trip closer to the center has the advantage of the ride share. The second one is that the effect of transfer at the center of the star network is signicant based on Markov chain model.
