Dynamic Reward Optimization for Sharing Economies: A Stochastic Control Framework for the Smart World

This paper proposes a dynamic and game-theoretic framework for optimizing reward policies in the sharing economy. Moving beyond static incentive schemes, we design a platform-wide control system that dynamically selects which shoppers to incentivize using real-time data, probability-driven models, and Nash equilibrium assumptions. Our approach integrates a dynamic programming algorithm and a continuous-time stochastic control formulation to determine optimal incentive allocations under budget constraints. Furthermore, we develop a novel methodology to estimate the optimal value of α, which represents the marginal value of a successful order (OTP). Simulated scenarios confirm the robustness of our framework across varying market dynamics, shopper behaviors, and budget scales. The results provide theoretical and practical foundations for deploying intelligent, adaptive, and cost-efficient reward policies at scale for the smart world.

Authors

Institutions

Publication Details

Published
2025-05-05
DOI
https://doi.org/10.1109/cai64502.2025.00030
Citations
1
Primary Topic
Transportation and Mobility Innovations
Type
article
Field-Weighted Citation Impact
0.68
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Dynamic Reward Optimization for Sharing Economies: A Stochastic Control Framework for the Smart World

David Li, Angela Li
1 citations
Transportation and Mobility Innovations
0.68
article

Dynamic Reward Optimization for Sharing Economies: A Stochastic Control Framework for the Smart World

David Li, Angela Li
article en
1 citations

Abstract

This paper proposes a dynamic and game-theoretic framework for optimizing reward policies in the sharing economy. Moving beyond static incentive schemes, we design a platform-wide control system that dynamically selects which shoppers to incentivize using real-time data, probability-driven models, and Nash equilibrium assumptions. Our approach integrates a dynamic programming algorithm and a continuous-time stochastic control formulation to determine optimal incentive allocations under budget constraints. Furthermore, we develop a novel methodology to estimate the optimal value of α, which represents the marginal value of a successful order (OTP). Simulated scenarios confirm the robustness of our framework across varying market dynamics, shopper behaviors, and budget scales. The results provide theoretical and practical foundations for deploying intelligent, adaptive, and cost-efficient reward policies at scale for the smart world.

Yeshiva University (US), Applied Mathematics (United States) (US), Stony Brook University (US)
Openalex Percentile: Top 28%
Transportation and Mobility Innovations
0.68
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.