NCG-TSM: A Noncooperative Game for the Taxi Sharing Model in Urban Road Networks

Table 2

Algorithm 1 runtime.

Number of passenger requests	Optimal-case runtime for Algorithm 1 (s)	Worst-case runtime for Algorithm 1 (s)
200	7.23	12.65
400	11.21	15.39
600	20.24	26.19
800	25.37	31.24
1000	36.15	40.51
1200	49.83	60.93