( en | de | ru )

 

Disambiguation of "Garg, Jugal"

Author of the publication

copydeleteadd this publication to your clipboard
Prize Collecting Multiagent Orienteering: Price of Anarchy Bounds and Solution Methods.

, , and . IEEE Trans Autom. Sci. Eng., 19 (1): 531-544 (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.

Neil Garg

Jugal Kishor

Animesh Garg

Priya Garg

Dineshkumar Garg

 

Other publications of authors with the same name

On Fair and Efficient Allocations of Indivisible Goods., and . AAAI, page 5595-5602. AAAI Press, (2021)An Improved Approximation Algorithm for Maximin Shares., and . EC, page 379-380. ACM, (2020)Computing Competitive Equilibria with Mixed Manna., and . AAMAS, page 420-428. International Foundation for Autonomous Agents and Multiagent Systems, (2020)One-Sided Matching Markets with Endowments: Equilibria and Algorithms., , and . AAMAS, page 463-471. International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS), (2022)Settling the complexity of Leontief and PLC exchange markets under exact and approximate equilibria., , , and . STOC, page 890-901. ACM, (2017)ETR-Completeness for Decision Versions of Multi-player (Symmetric) Nash Equilibria., , , and . ICALP (1), volume 9134 of Lecture Notes in Computer Science, page 554-566. Springer, (2015)Approximating Nash social welfare under rado valuations., , and . STOC, page 1412-1425. ACM, (2021)Tractable Fragments of the Maximum Nash Welfare Problem., , , and . WINE, volume 13778 of Lecture Notes in Computer Science, page 362-363. Springer, (2022)Auction Algorithms for Market Equilibrium with Weak Gross Substitute Demands and Their Applications., , and . STACS, volume 187 of LIPIcs, page 33:1-33:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)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)