A Combinatorial-Bandit Algorithm for the Online Joint Bid/Budget Optimization of Pay-per-Click Advertising Campaigns | Zendy

Alessandro Nuara | Zendy; Francesco Trovò | Zendy; Nicola Gatti | Zendy; Marcello Restelli | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A Combinatorial-Bandit Algorithm for the Online Joint Bid/Budget Optimization of Pay-per-Click Advertising Campaigns

Author(s) -

Alessandro Nuara,

Francesco Trovò,

Nicola Gatti,

Marcello Restelli

Publication year - 2018

Publication title -

proceedings of the aaai conference on artificial intelligence

Language(s) - English

Resource type - Journals

eISSN - 2374-3468

pISSN - 2159-5399

DOI - 10.1609/aaai.v32i1.11888

Subject(s) - knapsack problem , computer science , online advertising , click through rate , bayesian optimization , display advertising , common value auction , online algorithm , clickstream , greedy algorithm , bayesian probability , budget constraint , stochastic optimization , mathematical optimization , algorithm , machine learning , artificial intelligence , information retrieval , mathematics , economics , world wide web , the internet , statistics , neoclassical economics , web api , web modeling

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research