Author of the publication

Fair Division with Allocator's Preference.

, , , , and . WINE, volume 14413 of Lecture Notes in Computer Science, page 77-94. Springer, (2023)

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

Beyond Worst-Case (In)approximability of Nonsubmodular Influence Maximization., and . WINE, volume 10660 of Lecture Notes in Computer Science, page 368-382. Springer, (2017)Outsourcing Computation: The Minimal Refereed Mechanism., , , and . WINE, volume 11920 of Lecture Notes in Computer Science, page 256-270. Springer, (2019)Average Envy-freeness for Indivisible Items., , and . EAAMO, page 9:1-9:9. ACM, (2023)Designing a Combinatorial Financial Options Market., , , , , and . EC, page 864-883. ACM, (2021)On Existence of Truthful Fair Cake Cutting Mechanisms.. EC, page 404-434. ACM, (2022)Fair Division of Indivisible Goods with Comparison-Based Queries., , , , and . CoRR, (2024)A Complete Landscape for the Price of Envy-Freeness., , , , and . CoRR, (2024)Complexity, Algorithms, and Heuristics of Influence Maximization.. University of Michigan, USA, (2020)Fair Division with Allocator's Preference., , , , and . WINE, volume 14413 of Lecture Notes in Computer Science, page 77-94. Springer, (2023)Improving the Biclique Cryptanalysis of AES., and . ACISP, volume 9144 of Lecture Notes in Computer Science, page 39-56. Springer, (2015)