( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
EFX Exists for Three Agents.

, , и . J. ACM, 71 (1): 4:1-4:27 (2024)

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.

Bhaskar Mehta

Bhaskar Saha

R Chaudhury

Uta Chaudhury

Shameem Chaudhury

 

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

Combinatorial Algorithms for General Linear Arrow-Debreu Markets., и . FSTTCS, том 122 из LIPIcs, стр. 26:1-26:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)A Little Charity Guarantees Almost Envy-Freeness., , , и . CoRR, (2019)Polyline Simplification has Cubic Complexity., и . SoCG, том 129 из LIPIcs, стр. 18:1-18:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Competitive Equilibrium with Chores: Combinatorial Algorithm and Hardness., , , и . EC, стр. 1106-1107. ACM, (2022)On the Existence of EFX Allocations.. IWOCA, том 13270 из Lecture Notes in Computer Science, стр. 21-27. Springer, (2022)Competitive Allocation of a Mixed Manna., , , и . CoRR, (2020)Maximizing Nash Social Welfare in 2-Value Instances: The Half-Integer Case., , , , , , , , и . CoRR, (2022)Finding fair and efficient allocations.. Saarland University, Germany, (2021)On the Existence of Competitive Equilibrium with Chores., , , и . ITCS, том 215 из LIPIcs, стр. 41:1-41:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)On Fair Division for Indivisible Items., , , , , и . FSTTCS, том 122 из LIPIcs, стр. 25:1-25:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)