We frame the dual adjustment problem of daily budgets and bids in sponsored search. We propose a CRL‐based strategy, and present an iterative numerical solution. Our strategy performs better than two baseline strategies.
