2022/06/20 by Michał Bujak, Michal Bujak, Rafał Kucharski +2 · 1 citation
Business, Management and Accounting · Engineering · Physics and Astronomy · #Artificial intelligence #Computer science #FOS: Physical sciences #Physics and Society (physics.soc-ph) #Pooling #Probabilistic logic #Representation (politics) #Sharing Economy and Platforms #Theoretical computer science #Transportation and Mobility Innovations #Urban and Freight Transport Logistics #physics.soc-ph
paper · pdf · doi:10.48550/arxiv.2206.12259
published in arXiv (Cornell University) (Cornell University)
arxiv created 2022/06/20 · openalex publication_date 2022/06/20 · arxiv updated 2022/06/27 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/06
Travellers sharing rides in ride-pooling systems form various kinds of networks. While the notions of the so-called shareability graphs, has been in the core of many ride-pooling algorithms, so far they have not been explicitly analysed. Here, we introduce and examine four kinds of networks resulting from ride-pooling problems. We use 147 NYC taxi requests from 2016 pooled into attractive shared-rides with our utility based ExMAS algorithm and explore resulting shareability networks. To cover unknown individual properties of pooling travellers, we run 1000 replications of probabilistic pooling process, resulting in richer representation of weighted graphs instrumental to reveal complex network structures. Our findings reveal substantial differences between network structures and topologies. Properties of ride-pooling networks may be further analysed to better understand and improve ride-pooling systems.