Pricing and allocation algorithm designs in dynamic ridesharing system

DOI10.1016/j.tcs.2019.05.045zbMath1443.91163OpenAlexW2954428100WikidataQ127580831 ScholiaQ127580831MaRDI QIDQ2283011

Guihai Chen, Fan Wu, Chaoli Zhang, Xiaofeng Gao, Jiapeng Xie

Publication date: 27 December 2019

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2019.05.045

zbMATH Keywords

pricingallocationdynamic systemapproximate algorithmridesharingonline algorithm design

Mathematics Subject Classification ID

Microeconomic theory (price theory and economic markets) (91B24) Traffic problems in operations research (90B20) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items

A combinatorial auction‐based approach for ridesharing in a student transportation system

Cites Work

• Unnamed Item
• A new extension of local search applied to the Dial-A-Ride problem
• An optimal deterministic algorithm for online \(b\)-matching
• Ride solo or pool: designing price-service menus for a ride-sharing platform
• Optimization for dynamic ride-sharing: a review
• The dial-a-ride problem: Models and algorithms
• HEURISTIC ALGORITHMS FOR THE SINGLE VEHICLE DIAL-A-RIDE PROBLEM
• Generalized Online Routing: New Competitive Ratios, Resource Augmentation, and Asymptotic Analyses
• Online algorithms for market clearing
• AdWords and generalized online matching
• Online Vehicle Routing Problems: A Survey
• Online traveling salesman problems with rejection options
• Online Weighted Matching
• Algorithms for the on-line travelling salesman
• On-line single-server dial-a-ride problems