Sign in
Dominant strategy truthful, deterministic multi-armed bandit mechanisms with logarithmic regret for sponsored search auctions.
Divya Padmanabhan
Satyanath Bhat
Prabuchandran K. J.
Shirish K. Shevade
Y. Narahari
Published in:
Appl. Intell. (2022)
Keyphrases
</>
regret bounds
multi armed bandit
multi armed bandits
online learning
sponsored search auctions
lower bound
mechanism design
linear regression
reinforcement learning
upper bound
bandit problems
bregman divergences
multi agent
active learning
probabilistic model
machine learning
decision making