The classifier judged this item not relevant to AI security, so it is left out of lists, feeds, the API and dataset releases. If that is wrong, report a correction on this page.
InfoResearchPeer-reviewed
Efficient Privacy-Preserving Ridesharing: An Online Matching-Based Approach
- Published
- Record updated
Summary
Researchers study real-time matching between ridesharing requests and drivers when user locations are obfuscated with random noise, which normally reduces matching efficiency. They model order dispatching as an online bipartite matching problem and propose an LP-based online matching algorithm with provable performance guarantees, plus a privacy-aware variant that mitigates the impact of Laplace noise. Experiments on real-world datasets support the theoretical findings.