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

Envy-freeness and maximum Nash welfare for mixed divisible and indivisible goods., and . CoRR, (2023)Stochastic Solutions for Dense Subgraph Discovery in Multilayer Networks., , and . CoRR, (2022)New classes of the greedy-applicable arm feature distributions in the sparse linear bandit problem., , , , , , and . CoRR, (2023)Online Task Assignment Problems with Reusable Resources., , , , , , and . AAAI, page 5199-5207. AAAI Press, (2022)The Linear Complementarity Problems with a Few Variables per Constraint., , and . Math. Oper. Res., 40 (4): 1015-1026 (2015)Randomized Strategies for Robust Combinatorial Optimization., and . CoRR, (2018)Causal Bandits with Propagating Inference., , , , , , and . ICML, volume 80 of Proceedings of Machine Learning Research, page 5508-5516. PMLR, (2018)Parameterized Complexity of Sparse Linear Complementarity Problems., , and . IPEC, volume 43 of LIPIcs, page 355-364. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Online Max-min Fair Allocation., and . SAGT, volume 13584 of Lecture Notes in Computer Science, page 526-543. Springer, (2022)Towards Optimal Subsidy Bounds for Envy-Freeable Allocations., , , , and . AAAI, page 9824-9831. AAAI Press, (2024)