Metraipolis › archive › dc_339ebc904ff7

A General Framework for Budgeted Threshold Incentives on Request — arXiv:2609.29724

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.29724
License (as archived)
CC0-1.0
Archived
2026-10-08T04:26:19.379Z
SHA-256 of the archived text
c593a5f2cdbe5b46aa9a50b395aed0cb6a0a421e8ffbdb97feccf0f048b3d64d
Stable URL of this page
https://metraipolis.com/documento/dc_339ebc904ff7

How to cite

A General Framework for Budgeted Threshold Incentives on Request — arXiv:2609.29724 — arXiv (en), https://arxiv.org/abs/2609.29724 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_339ebc904ff7 (Metraipolis archive dc_339ebc904ff7, sha256 c593a5f2cdbe5b46aa9a50b395aed0cb6a0a421e8ffbdb97feccf0f048b3d64d)
BibTeX
@misc{dc339ebc904ff7,
  title = {A General Framework for Budgeted Threshold Incentives on Request — arXiv:2609.29724},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.29724},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_339ebc904ff7; sha256 c593a5f2cdbe5b46aa9a50b395aed0cb6a0a421e8ffbdb97feccf0f048b3d64d},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.29724. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

On-demand delivery platforms pay riders through incentive activities whose tiers are set from recent completions of riders with a similar history. Operators request such plans for changing periods, rider populations, payment rules and budgets, often for holidays or bad weather, where randomized trials are scarce and take months to collect. We present a request-driven framework that composes four stages (conditional prediction, population reduction, trajectory integration and budget allocation) through seven replaceable modules that exchange conditional trajectory laws, whose award probabilities and award-marked moments give payment and uplift for any activity rule. A response-correction step reweights trajectories from abundant no-offer history to match the moments of a short pilot. We prove that, on a fixed plan menu and given the stage errors, the end-to-end value loss is bounded by the sum of four stage terms, and that for every stage there are instances on which omitting it leaves an error floor the others cannot remove. On 3,000 riders over 45 weekly origins, all 127 windows of a week are answered 11.04x faster with identical scenarios and at most 0.92% value lost by the allocation. On 24 new controlled response laws, the response correction with a one-week pilot lowers regret by 51.2% relative to a trial with the same nominal randomized rider-weeks, and a four-week pilot with exact summation comes within +0.007 of an 18-week trial. In registered studies where windows, populations, rules and binding budgets change from request to request, the framework's regret is below that of a trial with the same nominal rider-weeks and below dose interpolation of the same pilot data, and reusing its one-off preparation answers 60 requests 14.1x and 2.70x faster with identical answers. Against a nine-offer trial fitted with the framework's own dose curve, one-week regret is 0.055 lower.

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-25 in cs.AI).
Categorie arXiv: Artificial Intelligence (cs.AI).
Pagina del lavoro: https://arxiv.org/abs/2609.29724 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-08T03:50:57.821Z dalla pagina https://arxiv.org/catchup/cs.AI/2026-09-25?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).