Author of the publication

On Fair and Efficient Allocations of Indivisible Public Goods.

, , and . FSTTCS, volume 213 of LIPIcs, page 22:1-22:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)

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

Nash Equilibria of Two-Player Matrix Games Repeated Until Collision., and . FSTTCS, volume 284 of LIPIcs, page 18:1-18:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Fair and Efficient Allocations of Chores under Bivalued Preferences., , and . AAAI, page 5043-5050. AAAI Press, (2022)(Almost) Envy-Free, Proportional and Efficient Allocations of an Indivisible Mixed Manna., , and . AAMAS, page 1678-1680. International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS), (2022)Brief Announcement: Dynamic Vector Bin Packing for Online Resource Allocation in the Cloud., , , and . SPAA, page 307-310. ACM, (2023)Fair Division of Indivisible Chores via Earning Restricted Equilibria., , and . CoRR, (2024)On Fair and Efficient Allocations of Indivisible Public Goods., , and . FSTTCS, volume 213 of LIPIcs, page 22:1-22:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Weighted EF1 and PO Allocations with Few Types of Agents or Chores., , and . IJCAI, page 2799-2806. ijcai.org, (2024)Fair and Efficient Chore Allocation: Existence and Computation.. IJCAI, page 8500-8501. ijcai.org, (2024)Vocabulary Tailored Summary Generation., , , and . COLING, page 795-805. Association for Computational Linguistics, (2018)Computing Fair and Efficient Allocations with Few Utility Values., and . SAGT, volume 12885 of Lecture Notes in Computer Science, page 345-359. Springer, (2021)