( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Fair and Truthful Mechanism with Limited Subsidy.

, , , , , , , и . AAMAS, стр. 534-542. International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS), (2022)

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

Gert Hannay

Martin Hannappel

Heinrich Hannay

 

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

Online Regression with Partial Information: Generalization and Linear Projection., , , , , , и . AISTATS, том 84 из Proceedings of Machine Learning Research, стр. 1599-1607. PMLR, (2018)Parameterized Complexity of Sparse Linear Complementarity Problems., , и . IPEC, том 43 из LIPIcs, стр. 355-364. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Submodular Maximization with Uncertain Knapsack Capacity., , и . LATIN, том 10807 из Lecture Notes in Computer Science, стр. 653-668. Springer, (2018)Online Max-min Fair Allocation., и . SAGT, том 13584 из Lecture Notes in Computer Science, стр. 526-543. Springer, (2022)New Classes of the Greedy-Applicable Arm Feature Distributions in the Sparse Linear Bandit Problem., , , , , , и . AAAI, стр. 12708-12716. AAAI Press, (2024)Towards Optimal Subsidy Bounds for Envy-Freeable Allocations., , , , и . AAAI, стр. 9824-9831. AAAI Press, (2024)Regret Bounds for Online Portfolio Selection with a Cardinality Constraint., , , , , , и . NeurIPS, стр. 10611-10620. (2018)A Parameter-Free Algorithm for Misspecified Linear Contextual Bandits., , , , , , и . AISTATS, том 130 из Proceedings of Machine Learning Research, стр. 3367-3375. PMLR, (2021)Random Assignment of Indivisible Goods under Constraints., , и . IJCAI, стр. 2792-2799. ijcai.org, (2023)Optimal Matroid Partitioning Problems., , , и . ISAAC, том 92 из LIPIcs, стр. 51:1-51:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)