Open AccessLinear Submodular Bandits with a Knapsack Constraint
Author(s) -
Baosheng Yu,
Meng Fang,
Dacheng Tao
Publication year - 2016
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.v30i1.10154
Subject(s) - submodular set function , knapsack problem , mathematical optimization , regret , constraint (computer aided design) , budget constraint , greedy algorithm , computer science , maximization , mathematics , economics , machine learning , geometry , neoclassical economics
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom