Author of the publication

Near-Optimal Complexity Bounds for Fragments of the Skolem Problem.

, , , , and . STACS, volume 154 of LIPIcs, page 37:1-37:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)

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

Computing fair and efficient allocations with few utility values., and . Theor. Comput. Sci., (June 2023)Fair and Efficient Allocations of Chores under Bivalued Preferences., , and . CoRR, (2021)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)On Fair and Efficient Allocations of Indivisible Goods., and . AAAI, page 5595-5602. AAAI Press, (2021)Tractable Fragments of the Maximum Nash Welfare Problem., , , and . WINE, volume 13778 of Lecture Notes in Computer Science, page 362-363. Springer, (2022)Approximate Nash Equilibria of Imitation Games: Algorithms and Complexity., and . AAMAS, page 887-894. International Foundation for Autonomous Agents and Multiagent Systems, (2020)Improving Fairness and Efficiency Guarantees for Allocating Indivisible Chores., , and . CoRR, (2022)Dynamic Vector Bin Packing for Online Resource Allocation in the Cloud., , , and . CoRR, (2023)(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)Fair and Efficient Allocations of Chores under Bivalued Preferences., , and . AAAI, page 5043-5050. AAAI Press, (2022)