From post

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.

 

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

Approximate maximin shares for groups of agents.. Math. Soc. Sci., (2018)Weighted Envy-freeness in Indivisible Item Allocation., , , и . ACM Trans. Economics and Comput., 9 (3): 18:1-18:39 (2021)Pricing Multi-Unit Markets., , , и . ACM Trans. Economics and Comput., 7 (4): 20:1-20:29 (2020)Fairness Concepts for Indivisible Items with Externalities., , , и . CoRR, (2021)Cutting a Cake Fairly for Groups Revisited., и . Am. Math. Mon., 130 (3): 203-213 (марта 2023)Simple Pricing Schemes for the Cloud., , и . WINE, том 10660 из Lecture Notes in Computer Science, стр. 311-324. Springer, (2017)Who Can Win a Single-Elimination Tournament?, , и . SIAM J. Discret. Math., 31 (3): 1751-1764 (2017)Robust bounds on choosing from large tournaments., и . Soc. Choice Welf., 54 (1): 87-110 (2020)Robust Bounds on Choosing from Large Tournaments., и . WINE, том 11316 из Lecture Notes in Computer Science, стр. 393-407. Springer, (2018)When Do Envy-Free Allocations Exist?, и . AAAI, стр. 2109-2116. AAAI Press, (2019)