考虑骑手偏好,动态调整接单报酬以提升平台收益。
Preference-aware compensation policies for crowdsourced on-demand services
- 基于多分类逻辑回归建模骑手接单意愿,优化报酬策略。
- 在真实与合成数据上均优于基准算法,最高提升20%。
- 适合研究平台调度、激励设计的从业者与研究者。
众包按需服务在降低运营成本、缩短交付时间、增强灵活性及促进可持续城市交通方面具有优势。然而,平台成功依赖于平衡骑手报酬吸引力与自身盈利能力的补偿策略。本文研究离散时间框架下按请求动态定价问题,请求与骑手随机到达,目标是最大化整个时间周期的总期望收益。提出一种显式考虑骑手请求偏好的补偿策略,采用多项式对数模型表示骑手接受概率,并推导出基于后决策状态的解析解,进而融入近似动态规划算法。与基于公式的基准策略及全信息线性规划上界相比,该算法在多种设置中表现稳健:在同质骑手群体中提升2.5%-7.5%,异质群体中提升9%(合成数据);真实数据中,弱位置偏好场景下提升8%,强位置偏好场景下提升20%。
原文摘要 · Abstract (English)
Crowdsourced on-demand services offer benefits such as reduced costs, faster service fulfillment times, greater adaptability, and contributions to sustainable urban transportation in on-demand delivery contexts. However, the success of an on-demand platform that utilizes crowdsourcing relies on finding a compensation policy that strikes a balance between creating attractive offers for gig workers and ensuring profitability. In this work, we examine a dynamic pricing problem for an on-demand platform that sets request-specific compensation of gig workers in a discrete-time framework, where requests and workers arrive stochastically. The operator's goal is to determine a compensation policy that maximizes the total expected reward over the time horizon. Our approach introduces compensation strategies that explicitly account for gig worker request preferences. To achieve this, we employ the Multinomial Logit model to represent the acceptance probabilities of gig workers, and, as a result, derive an analytical solution that utilizes post-decision states. Subsequently, we integrate this solution into an approximate dynamic programming algorithm. We compare our algorithm against benchmark algorithms, including formula-based policies and an upper bound provided by the full information linear programming solution. Our algorithm demonstrates consistent performance across diverse settings, achieving improvements of at least 2.5-7.5% in homogeneous gig worker populations and 9% in heterogeneous populations over benchmarks, based on fully synthetic data. For real-world data, it surpasses benchmarks by 8% in weak and 20% in strong location preference scenarios.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。