Dynamic Driver Allocation Under Latent Demand Regimes: Indexability of a Partially Observed Markov Decision Process

Pedro Cesar Lopes Gerum, Jiong Liu, Ellen Bernal Cavalheiro, Luiz Felipe Martins, Matteo Giaretti

Abstract

Quick-commerce dark stores dispatch e-grocery orders within 15 to 30 minutes, so operators such as Getir, Glovo, and GoPuff must commit drivers before orders arrive. Demand follows a latent regime that persists across hours, while unfulfilled orders spill forward as a compounding backlog. This decision binds whether drivers are employed on fixed shifts or drawn from a gig platform whose incentives are set ahead of the hour, yet existing models do not learn the regime as orders arrive. We formulate the single-store problem as a partially observable Markov decision process in which the firm infers the regime from realized orders. We show that optimal staffing rises with backlog and prove the single-store problem is indexable, a property open for multi-action partially observed problems in general. We then extend the framework to a driver pool shared across stores through a Lagrangian relaxation that decouples the network into per-store subproblems. The result is a two-level allocation policy that prices the value of tracking demand in real time and ranks stores by a provably valid priority index. On 2021 to 2022 data from the European firm SuperGlovo, which staffs full-time drivers to comply with Spain's Rider's Law, belief updating adds 10.9\%, about \$188K across 27 stores, over the same program with the belief held fixed. The gain concentrates in the stores whose regimes are most persistent, observable before deployment. Online allocation reduces to a table lookup and a ranked list with a cutoff price.

Disclosure

“Statement: The authors used Claude to document and revise code, and to improve writing pre- sentation. The authors reviewed and edited the content and take full responsibility for the content of the article. References Afèche, P., Liu, Z., and Maglaras, C. (2023). Ride-h”

PDF page 28
Classification
Rewriting existing author-written text
Multiplier
4
Verified

Structural counts

Pages 41 pdf
Theorems 0 source
Lemmas 4 source
Propositions 0 source
Corollaries 0 source
Definitions 0 source
Displayed equations 33 source
Bibliography entries 62 source
Appendix pages 32 estimated

Count notes

  • Source counts use the expanded primary TeX file main.tex.
  • Appendix pages include the first PDF page with an explicit Appendix heading through the final page.