Pricing Utility vs. Location Privacy: A Differentially Private Data Sharing Framework for Ride-on-Demand Services

• Published in: IEEE transactions on dependable and secure computing Vol. 22; no. 4; pp. 3497 - 3513
• Main Authors: Zheng, Zhirun, Li, Zhetao, Long, Saiqin, Guo, Suiming, Chen, Chao, Xu, Ke
• Format: Journal Article
• Language: English
• Published: Washington IEEE 01.07.2025; IEEE Computer Society
• Subjects: Algorithms; Bayes methods; Computer privacy; differential privacy; dynamic pricing utility; Heuristic algorithms; Heuristic methods; Location based services; Location privacy; Loss measurement; Matching; Minimization; Multiple objective analysis; Particle swarm optimization; Penalty function; Perturbation; Perturbation methods; Pricing; Privacy; ride-matching utility; ride-on-demand (RoD) services; Servers; Supply & demand; Supply and demand; Vehicles
• ISSN: 1545-5971; 1941-0018
• DOI: 10.1109/TDSC.2025.3532599

Noise perturbation introduced by differential privacy (DP) could degrade the quality of essential services like dynamic pricing and ride-matching in ride-on-demand (RoD) services. In this paper, we focus on RoD services under an honest-but-curious server, and propose a Pricing-Aware Differentially Private framework (PADP-RoD) to protect users' location privacy while providing them with high-quality location-based services. Specifically, given that a price multiplier is subject to abrupt changes in response to shifts in supply and demand, especially near hotspots, we propose an adaptive supply and demand aware grid to capture the changes. Powered by the grid, we put forward two utility metrics for quantifying the quality loss of dynamic pricing and ride-matching services caused by perturbation, respectively. With those metrics, PADP-RoD is formulated as a minimization problem, aiming to minimize the quality loss of services given DP constraint. In this way, we can achieve an optimal balance between privacy and service quality. Due to the problem being a multi-objective optimization, we decompose it into a dynamic-pricing utility sub-problem and a ride-matching utility sub-problem, and solve them separately. To solve the dynamic pricing utility sub-problem, we propose a heuristic algorithm named the dynamic pricing mapping algorithm. Since the semi-infinite and non-differentiable nature of the ride-matching utility sub-problem, we transform this sub-problem into an unconstrained problem by the exact penalty function method, and solve it employing the particle swarm optimization algorithm. Our theoretical analysis demonstrates that PADP-RoD satisfies both <inline-formula><tex-math notation="LaTeX">\varepsilon _{d}</tex-math> <mml:math><mml:msub><mml:mi>ɛ</mml:mi><mml:mi>d</mml:mi></mml:msub></mml:math><inline-graphic xlink:href="zheng-ieq1-3532599.gif"/> </inline-formula>-DP and <inline-formula><tex-math notation="LaTeX">\varepsilon _{d}</tex-math> <mml:math><mml:msub><mml:mi>ɛ</mml:mi><mml:mi>d</mml:mi></mml:msub></mml:math><inline-graphic xlink:href="zheng-ieq2-3532599.gif"/> </inline-formula>-identifiability, and extensive experiments on a real-world dataset show that it can provide high-quality dynamic pricing and ride-matching services.