Author of the publication

On the Existence of Competitive Equilibrium with Chores.

, , , and . ITCS, volume 215 of LIPIcs, page 41:1-41:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (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. 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

On Fair Division for Indivisible Items., , , , , and . FSTTCS, volume 122 of LIPIcs, page 25:1-25:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Combinatorial Algorithms for General Linear Arrow-Debreu Markets., and . FSTTCS, volume 122 of LIPIcs, page 26:1-26:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Competitive Equilibrium with Chores: Combinatorial Algorithm and Hardness., , , and . EC, page 1106-1107. ACM, (2022)On the Existence of EFX Allocations.. IWOCA, volume 13270 of Lecture Notes in Computer Science, page 21-27. Springer, (2022)Polyline Simplification has Cubic Complexity., and . SoCG, volume 129 of LIPIcs, page 18:1-18:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Finding fair and efficient allocations.. Saarland University, Germany, (2021)Incentives in Federated Learning: Equilibria, Dynamics, and Mechanisms for Welfare Maximization., , , , and . NeurIPS, (2023)On the Existence of Competitive Equilibrium with Chores., , , and . ITCS, volume 215 of LIPIcs, page 41:1-41:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Fair Federated Learning via the Proportional Veto Core., , , , , and . ICML, OpenReview.net, (2024)A Little Charity Guarantees Almost Envy-Freeness., , , and . SODA, page 2658-2672. SIAM, (2020)