Back to Search
Start Over
Bid optimization using maximum entropy reinforcement learning
- Source :
- Neurocomputing. 501:529-543
- Publication Year :
- 2022
- Publisher :
- Elsevier BV, 2022.
-
Abstract
- Real-time bidding (RTB) has become a critical way of online advertising. In RTB, an advertiser can participate in bidding ad impressions to display its advertisements. The advertiser determines every impression's bidding price according to its bidding strategy. Therefore, a good bidding strategy can help advertisers improve cost efficiency. This paper focuses on optimizing a single advertiser's bidding strategy using reinforcement learning (RL) in RTB. Unfortunately, it is challenging to optimize the bidding strategy through RL at the granularity of impression due to the highly dynamic nature of the RTB environment. In this paper, we first utilize a widely accepted linear bidding function to compute every impression's base price and optimize it by a mutable adjustment factor derived from the RTB auction environment, to avoid optimizing every impression's bidding price directly. Specifically, we use the maximum entropy RL algorithm (Soft Actor-Critic) to optimize the adjustment factor generation policy at the impression-grained level. Finally, the empirical study on a public dataset demonstrates that the proposed bidding strategy has superior performance compared with the baselines.
- Subjects :
- FOS: Computer and information sciences
Computer Science - Machine Learning
Artificial Intelligence (cs.AI)
Computer Science - Artificial Intelligence
Computer Science - Computer Science and Game Theory
Artificial Intelligence
Cognitive Neuroscience
TheoryofComputation_GENERAL
Machine Learning (cs.LG)
Computer Science and Game Theory (cs.GT)
Computer Science Applications
Subjects
Details
- ISSN :
- 09252312
- Volume :
- 501
- Database :
- OpenAIRE
- Journal :
- Neurocomputing
- Accession number :
- edsair.doi.dedup.....269326e61d118680a7c3fc360c7a85f0