( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Near-Optimal Regret Bounds for Contextual Combinatorial Semi-Bandits with Linear Payoff Functions.

, , , , , , и . AAAI, стр. 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.

Wolfgang Hannak

Abdalla Hanna

Idwar Hanna

Monika Hannak

Thomas Hannappel

 

Другие публикации лиц с тем же именем

Sparse Linear Complementarity Problems., , и . CIAC, том 7878 из Lecture Notes in Computer Science, стр. 358-369. Springer, (2013)Non-zero-sum Stackelberg Budget Allocation Game for Computational Advertising., , , , , и . PRICAI (1), том 11670 из Lecture Notes in Computer Science, стр. 568-582. Springer, (2019)Optimal Matroid Partitioning Problems., , , и . ISAAC, том 92 из LIPIcs, стр. 51:1-51:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Fair and Truthful Mechanism with Limited Subsidy., , , , , , , и . AAMAS, стр. 534-542. International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS), (2022)Causal Bandits with Propagating Inference., , , , , , и . ICML, том 80 из Proceedings of Machine Learning Research, стр. 5508-5516. PMLR, (2018)Envy-freeness and maximum Nash welfare for mixed divisible and indivisible goods., и . CoRR, (2023)Online Task Assignment Problems with Reusable Resources., , , , , , и . AAAI, стр. 5199-5207. AAAI Press, (2022)Online Optimization of Video-Ad Allocation., , , и . IJCAI, стр. 423-429. ijcai.org, (2017)Fair and Truthful Mechanism with Limited Subsidy., , , , , , , и . CoRR, (2021)On the Max-Min Fair Stochastic Allocation of Indivisible Goods., и . AAAI, стр. 2070-2078. AAAI Press, (2020)