An asymptotically tight learning algorithm for mobile-promotion platforms
Year of publication: |
2023
|
---|---|
Authors: | Feng, Zhichao ; Dawande, Milind ; Janakiraman, Ganesh ; Qi, Anyan |
Published in: |
Management science : journal of the Institute for Operations Research and the Management Sciences. - Hanover, Md. : INFORMS, ISSN 1526-5501, ZDB-ID 2023019-9. - Vol. 69.2023, 3, p. 1536-1554
|
Subject: | learning | online advertising | regret minimization | stochastic dynamic programming | Algorithmus | Algorithm | Online-Marketing | Internet marketing | Dynamische Optimierung | Dynamic programming | Lernprozess | Learning process | Theorie | Theory | Lernen | Learning | Mathematische Optimierung | Mathematical programming | E-Learning | E-learning | Digitale Plattform | Digital platform |
-
Optimal online learning for nonlinear belief models using discrete priors
Han, Weidong, (2020)
-
Efficient online linear optimization with approximation algorithms
Garber, Dan, (2021)
-
Engineering Social Learning : Information Design of Time-Locked Sales Campaigns for Online Platforms
Küçükgül, Can, (2019)
- More ...
-
Technical note: dynamic pricing and learning with discounting
Feng, Zhichao, (2024)
-
On the structure of bottlenecks in processes
Dawande, Milind, (2021)
-
Supplier Centrality and Auditing Priority in Socially-Responsible Supply Chains
Chen, Jiayu, (2019)
- More ...