工作量
计算机科学
工作(物理)
控制(管理)
运筹学
贪婪算法
质量(理念)
资源配置
时间分配
准入控制
简单(哲学)
在线算法
劳动经济学
最优分配
服务器
实时计算
运营管理
订单(交换)
高效算法
到期日
微观经济学
随机建模
作者
Garud Iyengar,Raghav Singal
出处
期刊:Operations Research
[Institute for Operations Research and the Management Sciences]
日期:2026-10-23
被引量:4
标识
DOI:10.1287/opre.2024.1196
摘要
Keeping Gig Workers Working How should platforms allocate jobs when workers need a minimum amount of work to stay engaged? In their accepted paper, “Online Allocation with Heterogeneous Supply and Minimum Workload Guarantees,” Garud Iyengar and Raghav Singal study this question in online labor marketplaces, where workers differ in quality, capacity, and desired workload. The authors show that intuitive allocation rules can perform poorly. A first-come-first-served policy can favor lower-quality workers, whereas a quality-based greedy policy can cause high-capacity workers to leave when their workload requirements are not met. They develop Tracker, an online policy that combines admission control with a simple target-tracking rule: Each worker is assigned a target workload, and arriving jobs are directed toward workers who are most under their targets. Despite the stochastic nature of demand, the authors establish that Tracker is optimal. Computational experiments calibrated to a real labor marketplace show substantial improvements in allocation quality relative to standard policies, while maintaining workers’ minimum workload guarantees.
科研通智能强力驱动
Strongly Powered by AbleSci AI