Author of the publication

Near-Optimal Regret Bounds for Contextual Combinatorial Semi-Bandits with Linear Payoff Functions.

, , , , , , and . AAAI, page 9791-9798. AAAI Press, (2021)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Kakimura, Naonori
add a person with the name Kakimura, Naonori
 

Other publications of authors with the same name

Computing Knapsack Solutions with Cardinality Robustness., , and . ISAAC, volume 7074 of Lecture Notes in Computer Science, page 693-702. Springer, (2011)Optimal Budget Allocation: Theoretical Guarantee and Efficient Algorithm., , , and . ICML, volume 32 of JMLR Workshop and Conference Proceedings, page 351-359. JMLR.org, (2014)An Improved Approximation Algorithm for the Subpath Planning Problem and Its Generalization., , , and . IJCAI, page 4412-4418. ijcai.org, (2017)Streaming Algorithms for Maximizing Monotone Submodular Functions under a Knapsack Constraint., , and . APPROX-RANDOM, volume 81 of LIPIcs, page 11:1-11:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Matching Problems with Delta-Matroid Constraints., and . CATS, volume 128 of CRPIT, page 83-92. Australian Computer Society, (2012)Delay and Cooperation in Nonstochastic Linear Bandits., , , , , , and . NeurIPS, (2020)Minimum-Cost b-Edge Dominating Sets on Trees., , , , and . Algorithmica, 81 (1): 343-366 (2019)Causal Bandits with Propagating Inference., , , , , , and . ICML, volume 80 of Proceedings of Machine Learning Research, page 5508-5516. PMLR, (2018)Tight Approximability of the Server Allocation Problem for Real-Time Applications., , , , , and . ALGOCLOUD, volume 10739 of Lecture Notes in Computer Science, page 41-55. Springer, (2017)Online Task Assignment Problems with Reusable Resources., , , , , , and . AAAI, page 5199-5207. AAAI Press, (2022)