$$\epsilon $$-Policy Gradient for Online Pricing
Applied Mathematics & Optimization · 2026-08 · 94 (1)
DOI: 10.1007/s00245-026-10396-1 ↗Kurz gefasst
Fachartikel in der Zeitschrift Applied Mathematics & Optimization, online erschienen am 02.07.2026. Verfasst von Lukasz Szpruch und 2 weiteren Autor:innen. Die Arbeit nennt 27 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
Combining model-based and model-free reinforcement learning approaches, this paper proposes and analyzes an $$\epsilon $$ ϵ -policy gradient algorithm for the online pricing learning task. The algorithm extends $$\epsilon $$ ϵ -greedy algorithm by replacing greedy exploitation with gradient descent step and facilitates learning via model inference. We optimize the regret of the proposed algorithm by quantifying the exploration cost in terms of the exploration probability $$\epsilon $$ ϵ and the exploitation cost in terms of the gradient descent optimization and gradient estimation errors. The algorithm achieves an expected regret of order $$\mathcal {O}(\sqrt{T})$$ O ( T ) (up to a logarithmic factor) over T trials.
Zitieren
APA
Szpruch, L., Treetanthiploet, T., & Zhang, Y. (2026). $$\epsilon $$-Policy Gradient for Online Pricing. Applied Mathematics & Optimization, 94(1). https://doi.org/10.1007/s00245-026-10396-1
Vancouver
Szpruch L, Treetanthiploet T, Zhang Y. $$\epsilon $$-Policy Gradient for Online Pricing. Applied Mathematics & Optimization. 2026;94(1). doi:10.1007/s00245-026-10396-1
BibTeX
@article{Szpruch2026,
author = {Szpruch, Lukasz and Treetanthiploet, Tanut and Zhang, Yufei},
title = {$$\epsilon $$-Policy Gradient for Online Pricing},
journal = {Applied Mathematics & Optimization},
year = {2026},
volume = {94},
number = {1},
doi = {10.1007/s00245-026-10396-1}
}
EUVIMED