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.

 

Other publications of authors with the same name

Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems., , and . ISAAC, volume 5878 of Lecture Notes in Computer Science, page 55-64. Springer, (2009)Computing a Tree Having a Small Vertex Cover., and . COCOA, volume 10043 of Lecture Notes in Computer Science, page 77-91. Springer, (2016)Approximating Minimum Cost Source Location Problems with Local Vertex-Connectivity Demands.. TAMC, volume 6648 of Lecture Notes in Computer Science, page 428-439. Springer, (2011)Accurate Contention Estimate Scheduling Method Using Multiple Clusters of Many-core Platform., , , and . PDP, page 67-71. IEEE, (2020)Approximating a Generalization of Metric TSP., and . IEICE Trans. Inf. Syst., 90-D (2): 432-439 (2007)Unranking of small combinations from large sets., , and . J. Discrete Algorithms, (2014)Online Optimization of Video-Ad Allocation., , , and . IJCAI, page 423-429. ijcai.org, (2017)Adaptive Budget Allocation for Maximizing Influence of Advertisements., , and . IJCAI, page 3600-3608. IJCAI/AAAI Press, (2016)Virtual machine placement for minimizing connection cost in data center networks., , and . INFOCOM Workshops, page 486-491. IEEE, (2015)Approximation Algorithms for the b-Edge Dominating Set Problem and Its Related Problems., and . COCOON, volume 3595 of Lecture Notes in Computer Science, page 747-756. Springer, (2005)