( en | de | ru )

 

Disambiguation of "Hatano, Daisuke"

Author of the publication

copydeleteadd this publication to your clipboard
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.

Eduardo Hatano

Daisuke Yoshida

Daisuke Shibata

Minao Hatano

Daisuke Akimoto

 

Other publications of authors with the same name

Online Task Assignment Problems with Reusable Resources., , , , , , and . AAAI, page 5199-5207. AAAI Press, (2022)Lagrangian Decomposition Algorithm for Allocating Marketing Channels., , , and . AAAI, page 1144-1150. AAAI Press, (2015)DeQED: an efficient divide-and-coordinate algorithm for DCOP., and . AAMAS, page 1325-1326. IFAAMAS, (2013)Causal Bandits with Propagating Inference., , , , , , and . ICML, volume 80 of Proceedings of Machine Learning Research, page 5508-5516. PMLR, (2018)Non-zero-sum Stackelberg Budget Allocation Game for Computational Advertising., , , , , and . PRICAI (1), volume 11670 of Lecture Notes in Computer Science, page 568-582. Springer, (2019)Dynamic SAT with Decision Change Costs: Formalization and Solutions., and . IJCAI, page 560-565. IJCAI/AAAI, (2011)Adaptive Budget Allocation for Maximizing Influence of Advertisements., , and . IJCAI, page 3600-3608. IJCAI/AAAI Press, (2016)Computational Aspects of the Preference Cores of Supermodular Two-Scenario Cooperative Games., and . IJCAI, page 310-316. ijcai.org, (2018)Computing Least Cores of Supermodular Cooperative Games., and . AAAI, page 551-557. AAAI Press, (2017)Scalable Algorithm for Higher-Order Co-Clustering via Random Sampling., , , and . AAAI, page 1992-1999. AAAI Press, (2017)