Author of the publication

A Parameter-Free Algorithm for Misspecified Linear Contextual Bandits.

, , , , , , and . AISTATS, volume 130 of Proceedings of Machine Learning Research, page 3367-3375. PMLR, (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

Sparse Linear Complementarity Problems., , and . CIAC, volume 7878 of Lecture Notes in Computer Science, page 358-369. Springer, (2013)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)Fair and Truthful Mechanism with Limited Subsidy., , , , , , , and . AAMAS, page 534-542. International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS), (2022)Optimal Matroid Partitioning Problems., , , and . ISAAC, volume 92 of LIPIcs, page 51:1-51:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Envy-freeness and maximum Nash welfare for mixed divisible and indivisible goods., and . CoRR, (2023)Online Task Assignment Problems with Reusable Resources., , , , , , and . AAAI, page 5199-5207. AAAI Press, (2022)Causal Bandits with Propagating Inference., , , , , , and . ICML, volume 80 of Proceedings of Machine Learning Research, page 5508-5516. PMLR, (2018)Online Optimization of Video-Ad Allocation., , , and . IJCAI, page 423-429. ijcai.org, (2017)Fair and Truthful Mechanism with Limited Subsidy., , , , , , , and . CoRR, (2021)On the Max-Min Fair Stochastic Allocation of Indivisible Goods., and . AAAI, page 2070-2078. AAAI Press, (2020)