Author of the publication

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

Dividing Bads is Harder than Dividing Goods: On the Complexity of Fair and Efficient Division of Chores., , , and . CoRR, (2020)A Complementary Pivot Algorithm for Competitive Allocation of a Mixed Manna., , , and . Math. Oper. Res., 48 (3): 1630-1656 (August 2023)Improving Nash Social Welfare Approximations., and . J. Artif. Intell. Res., (2020)Competitive Equilibria with a Constant Number of Chores., , , and . J. Artif. Intell. Res., (2023)A Truthful Mechanism for Interval Scheduling., and . SAGT, volume 11059 of Lecture Notes in Computer Science, page 100-112. Springer, (2018)Approximating Maximin Share Allocations., , and . SOSA, volume 69 of OASIcs, page 20:1-20:11. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Competitive Allocation of a Mixed Manna., , , and . SODA, page 1405-1424. SIAM, (2021)Improving Nash Social Welfare Approximations., and . IJCAI, page 294-300. ijcai.org, (2019)When Dividing Mixed Manna Is Easier Than Dividing Goods: Competitive Equilibria with a Constant Number of Chores., , , and . SAGT, volume 12885 of Lecture Notes in Computer Science, page 329-344. Springer, (2021)Competitive Equilibrium with Chores: Combinatorial Algorithm and Hardness., , , and . EC, page 1106-1107. ACM, (2022)