A Simplex-Like Algorithm for Fisher Markets. - Bharat Adsul; Ch. Sobhan Babu; Jugal Garg; Ruta Mehta; Milind A. Sohoni (SAGT, 2010)

Nash Equilibria in Fisher Market. - Bharat Adsul; Ch. Sobhan Babu; Jugal Garg; Ruta Mehta; Milind A. Sohoni (SAGT, 2010)

Rank-1 Bi-matrix Games: A Homeomorphism and a Polynomial Time Algorithm - Bharat Adsul; Jugal Garg; Ruta Mehta; Milind A. Sohoni (CoRR, 2010)

Rank-1 bimatrix games: a homeomorphism and a polynomial time algorithm. - Bharat Adsul; Jugal Garg; Ruta Mehta; Milind A. Sohoni (STOC, 2011)

Bilinear Games: Polynomial Time Algorithms for Rank Based Subclasses. - Jugal Garg; Albert Xin Jiang; Ruta Mehta (WINE, 2011)

A complementary pivot algorithm for markets under separable, piecewise-linear concave utilities. - Jugal Garg; Ruta Mehta; Milind A. Sohoni; Vijay V. Vazirani (STOC, 2012)

Towards Polynomial Simplex-Like Algorithms for Market Equlibria. - Jugal Garg; Ruta Mehta; Milind A. Sohoni; Nisheeth K. Vishnoi (SODA, 2013)

On Computability of Equilibria in Markets with Production. - Jugal Garg; Vijay V. Vazirani (SODA, 2014)

Dichotomies in equilibrium computation, and complementary pivot algorithms for a new class of non-separable utility functions. - Jugal Garg; Ruta Mehta; Vijay V. Vazirani (STOC, 2014)

Market Equilibrium under Piecewise Leontief Concave Utilities - [Extended Abstract]. - Jugal Garg (WINE, 2014)

Leontief Exchange Markets Can Solve Multivariate Polynomial Equations, Yielding FIXP and ETR Hardness. - Jugal Garg; Ruta Mehta; Vijay V. Vazirani; Sadra Yazdanbod (CoRR, 2014)

ETR-Completeness for Decision Versions of Multi-player (Symmetric) Nash Equilibria. - Jugal Garg; Ruta Mehta; Vijay V. Vazirani; Sadra Yazdanbod (ICALP (1), 2015)

Markets with Production: A Polynomial Time Algorithm and a Reduction to Pure Exchange. - Jugal Garg; Ravi Kannan (EC, 2015)

Tatonnement for Linear and Gross Substitutes Markets. - Xiaohui Bei; Jugal Garg; Martin Hoefer 001 (CoRR, 2015)

A Market for Scheduling, with Applications to Cloud Computing. - Nikhil R. Devanur; Jugal Garg; Ruta Mehta; Vijay V. Vazirani; Sadra Yazdanbod (CoRR, 2015)

A Complementary Pivot Algorithm for Market Equilibrium under Separable, Piecewise-Linear Concave Utilities. - Jugal Garg; Ruta Mehta; Milind A. Sohoni; Vijay V. Vazirani (SIAM J. Comput., 2015)

Learning Market Parameters Using Aggregate Demand Queries. - Xiaohui Bei; Wei Chen 013; Jugal Garg; Martin Hoefer 001; Xiaoming Sun 001 (AAAI, 2016)

Computing Equilibria in Markets with Budget-Additive Utilities. - Xiaohui Bei; Jugal Garg; Martin Hoefer 001; Kurt Mehlhorn (ESA, 2016)

An Improved Combinatorial Polynomial Algorithm for the Linear Arrow-Debreu Market. - Ran Duan; Jugal Garg; Kurt Mehlhorn (SODA, 2016)

A Rational Convex Program for Linear Arrow-Debreu Markets. - Nikhil R. Devanur; Jugal Garg; László A. Végh (ACM Trans. Economics and Comput., 2016)

Dichotomies in Equilibrium Computation and Membership of PLC Markets in FIXP. - Jugal Garg; Ruta Mehta; Vijay V. Vazirani (Theory Comput., 2016)

Earning Limits in Fisher Markets with Spending-Constraint Utilities. - Xiaohui Bei; Jugal Garg; Martin Hoefer 001; Kurt Mehlhorn (SAGT, 2017)

Settling the complexity of Leontief and PLC exchange markets under exact and approximate equilibria. - Jugal Garg; Ruta Mehta; Vijay V. Vazirani; Sadra Yazdanbod (STOC, 2017)

Market equilibrium under piecewise Leontief concave utilities. - Jugal Garg (Theor. Comput. Sci., 2017)

Network Cost-Sharing Games: Equilibrium Computation and Applications to Election Modeling. - Rahul Swamy; Timothy Murray; Jugal Garg (COCOA, 2018)

On Fair Division for Indivisible Items. - Bhaskar Ray Chaudhury; Yun Kuen Cheung; Jugal Garg; Naveen Garg 001; Martin Hoefer 001; Kurt Mehlhorn (FSTTCS, 2018)

A Truthful Mechanism for Interval Scheduling. - Jugal Garg; Peter McGlaughlin (SAGT, 2018)

A New Class of Combinatorial Markets with Covering Constraints: Algorithms and Applications. - Nikhil R. Devanur; Jugal Garg; Ruta Mehta; Vijay V. Vazirani; Sadra Yazdanbod (SODA, 2018)

Approximating the Nash Social Welfare with Budget-Additive Valuations. - Jugal Garg; Martin Hoefer 001; Kurt Mehlhorn (SODA, 2018)

On Fair Division of Indivisible Items. - Yun Kuen Cheung; Bhaskar Chaudhuri; Jugal Garg; Naveen Garg 001; Martin Hoefer 001; Kurt Mehlhorn (CoRR, 2018)

Substitution with Satiation: A New Class of Utility Functions and a Complementary Pivot Algorithm. - Jugal Garg; Ruta Mehta; Vijay V. Vazirani (Math. Oper. Res., 2018)

∃R-Completeness for Decision Versions of Multi-Player (Symmetric) Nash Equilibria. - Jugal Garg; Ruta Mehta; Vijay V. Vazirani; Sadra Yazdanbod (ACM Trans. Economics and Comput., 2018)

Approximating Maximin Share Allocations. - Jugal Garg; Peter McGlaughlin; Setareh Taki (SOSA, 2019)

Auction Algorithms for Market Equilibrium with Weak Gross Substitute Demands. - Jugal Garg; Edin Husic; László A. Végh (CoRR, 2019)

Ascending-Price Algorithms for Unknown Markets. - Xiaohui Bei; Jugal Garg; Martin Hoefer 001 (ACM Trans. Algorithms, 2019)

Earning and Utility Limits in Fisher Markets. - Xiaohui Bei; Jugal Garg; Martin Hoefer 001; Kurt Mehlhorn (ACM Trans. Economics and Comput., 2019)

Computing Competitive Equilibria with Mixed Manna. - Jugal Garg; Peter McGlaughlin (AAMAS, 2020)

Dividing Bads is Harder than Dividing Goods: On the Complexity of Fair and Efficient Division of Chores. - Bhaskar Ray Chaudhury; Jugal Garg; Peter McGlaughlin; Ruta Mehta (CoRR, 2020)

An Arrow-Debreu Extension of the Hylland-Zeckhauser Scheme: Equilibrium Existence and Algorithms. - Jugal Garg; Thorben Tröbst; Vijay V. Vazirani (CoRR, 2020)

Improving Nash Social Welfare Approximations. - Peter McGlaughlin; Jugal Garg (J. Artif. Intell. Res., 2020)

Multiagent UAV Routing: A Game Theory Analysis With Tight Price of Anarchy Bounds. - Omkar Thakoor; Jugal Garg; Rakesh Nagi (IEEE Trans Autom. Sci. Eng., 2020)

Fair and Efficient Allocations under Subadditive Valuations. - Bhaskar Ray Chaudhury; Jugal Garg; Ruta Mehta (AAAI, 2021)

On Fair and Efficient Allocations of Indivisible Goods. - Aniket Murhekar; Jugal Garg (AAAI, 2021)

On Fair and Efficient Allocations of Indivisible Public Goods. - Jugal Garg; Pooja Kulkarni; Aniket Murhekar (FSTTCS, 2021)

When Dividing Mixed Manna Is Easier Than Dividing Goods: Competitive Equilibria with a Constant Number of Chores. - Jugal Garg; Martin Hoefer 001; Peter McGlaughlin; Marco Schmalhofer (SAGT, 2021)

Improving EFX Guarantees through Rainbow Cycle Number. - Bhaskar Ray Chaudhury; Jugal Garg; Kurt Mehlhorn; Ruta Mehta; Pranabendu Misra (EC, 2021)

Competitive Allocation of a Mixed Manna. - Bhaskar Ray Chaudhury; Jugal Garg; Peter McGlaughlin; Ruta Mehta (SODA, 2021)

Auction Algorithms for Market Equilibrium with Weak Gross Substitute Demands and Their Applications. - Jugal Garg; Edin Husic; László A. Végh (STACS, 2021)

An improved approximation algorithm for maximin shares. - Jugal Garg; Setareh Taki (Artif. Intell., 2021)

Trust in Social Network Games. - Timothy Murray; Jugal Garg; Rakesh Nagi (CoRR, 2021)

Limited-trust equilibria. - Timothy Murray; Jugal Garg; Rakesh Nagi (Eur. J. Oper. Res., 2021)

Fast Algorithms for Rank-1 Bimatrix Games. - Bharat Adsul; Jugal Garg; Ruta Mehta; Milind A. Sohoni; Bernhard von Stengel (Oper. Res., 2021)

Approximating nash social welfare under rado valuations. - Jugal Garg; Edin Husic; László A. Végh (SIGecom Exch., 2021)

Fair and Efficient Allocations of Chores under Bivalued Preferences. - Jugal Garg; Aniket Murhekar; John Qin (AAAI, 2022)

On the Existence of Competitive Equilibrium with Chores. - Bhaskar Ray Chaudhury; Jugal Garg; Peter McGlaughlin; Ruta Mehta (ITCS, 2022)

Competitive Equilibrium with Chores: Combinatorial Algorithm and Hardness. - Bhaskar Ray Chaudhury; Jugal Garg; Peter McGlaughlin; Ruta Mehta (EC, 2022)

Approximating Equilibrium under Constrained Piecewise Linear Concave Utilities with Applications to Matching Markets. - Jugal Garg; Yixin Tao; László A. Végh (SODA, 2022)

Tractable Fragments of the Maximum Nash Welfare Problem. - Jugal Garg; Edin Husic; Aniket Murhekar; László A. Végh (WINE, 2022)

EFX Allocations: Simplifications and Improvements. - Hannaneh Akrami; Bhaskar Ray Chaudhury; Jugal Garg; Kurt Mehlhorn; Ruta Mehta (CoRR, 2022)

Existence and Computation of Epistemic EFX. - Jugal Garg; Eklavya Sharma (CoRR, 2022)

Improving Fairness and Efficiency Guarantees for Allocating Indivisible Chores. - Jugal Garg; Aniket Murhekar; John Qin (CoRR, 2022)

Fair Division of Indivisible Goods for a Class of Concave Valuations. - Bhaskar Ray Chaudhury; Yun Kuen Cheung; Jugal Garg; Naveen Garg 001; Martin Hoefer 001; Kurt Mehlhorn (J. Artif. Intell. Res., 2022)

Prize Collecting Multiagent Orienteering: Price of Anarchy Bounds and Solution Methods. - Timothy Murray; Jugal Garg; Rakesh Nagi (IEEE Trans Autom. Sci. Eng., 2022)

A Nash-Bargaining-Based Mechanism for One-Sided Matching Markets and Dichotomous Utilities. - Jugal Garg; Thorben Tröbst; Vijay V. Vazirani (AAMAS, 2023)

Fair and Efficient Allocation of Indivisible Chores with Surplus. - Hannaneh Akrami; Bhaskar Ray Chaudhury; Jugal Garg; Kurt Mehlhorn; Ruta Mehta (IJCAI, 2023)

Simplification and Improvement of MMS Approximation. - Hannaneh Akrami; Jugal Garg; Eklavya Sharma; Setareh Taki (IJCAI, 2023)

New Fairness Concepts for Allocating Indivisible Items. - Ioannis Caragiannis; Jugal Garg; Nidhi Rathi; Eklavya Sharma; Giovanna Varricchio (IJCAI, 2023)

New Algorithms for the Fair and Efficient Allocation of Indivisible Chores. - Jugal Garg; Aniket Murhekar; John Qin (IJCAI, 2023)

Approximating Nash Social Welfare by Matching and Local Search. - Jugal Garg; Edin Husic; Wenzheng Li; László A. Végh; Jan Vondrák (STOC, 2023)

Improving Approximation Guarantees for Maximin Share. - Hannaneh Akrami; Jugal Garg; Setareh Taki (CoRR, 2023)

Competitive Equilibria with a Constant Number of Chores. - Jugal Garg; Peter McGlaughlin; Martin Hoefer 001; Marco Schmalhofer (J. Artif. Intell. Res., 2023)

An Auction Algorithm for Market Equilibrium with Weak Gross Substitute Demands. - Jugal Garg; Edin Husic; László A. Végh (ACM Trans. Economics and Comput., 2023)

A Strongly Polynomial Algorithm for Linear Exchange Markets. - Jugal Garg; László A. Végh (Oper. Res., 2023)

Computing fair and efficient allocations with few utility values. - Jugal Garg; Aniket Murhekar (Theor. Comput. Sci., 2023)

A Complementary Pivot Algorithm for Competitive Allocation of a Mixed Manna. - Bhaskar Ray Chaudhury; Jugal Garg; Peter McGlaughlin; Ruta Mehta (Math. Oper. Res., 2023)

Approximating Nash Social Welfare under Submodular Valuations through (Un)Matchings. - Jugal Garg; Pooja Kulkarni; Rucha Kulkarni (ACM Trans. Algorithms, 2023)

Weighted EF1 and PO Allocations with Few Types of Agents or Chores. - Jugal Garg; Aniket Murhekar; John Qin (IJCAI, 2024)

Improving Approximation Guarantees for Maximin Share. - Hannaneh Akrami; Jugal Garg; Eklavya Sharma; Setareh Taki (EC, 2024)

Breaking the 3/4 Barrier for Approximate Maximin Share. - Hannaneh Akrami; Jugal Garg (SODA, 2024)

Fair Division of Indivisible Chores via Earning Restricted Equilibria. - Jugal Garg; Aniket Murhekar; John Qin (CoRR, 2024)

Best-of-Both-Worlds Fairness of the Envy-Cycle-Elimination Algorithm. - Jugal Garg; Eklavya Sharma (CoRR, 2024)

EF1 for Mixed Manna with Unequal Entitlements. - Jugal Garg; Eklavya Sharma (CoRR, 2024)

EFX Exists for Three Agents. - Bhaskar Ray Chaudhury; Jugal Garg; Kurt Mehlhorn (J. ACM, 2024)

Computing Pareto-Optimal and Almost Envy-Free Allocations of Indivisible Goods. - Jugal Garg; Aniket Murhekar (J. Artif. Intell. Res., 2024)

Improving Envy Freeness up to Any Good Guarantees Through Rainbow Cycle Number. - Bhaskar Ray Chaudhury; Jugal Garg; Kurt Mehlhorn; Ruta Mehta; Pranabendu Misra (Math. Oper. Res., 2024)

Satiation in Fisher Markets and Approximation of Nash Social Welfare. - Jugal Garg; Martin Hoefer 001; Kurt Mehlhorn (Math. Oper. Res., 2024)

One-sided matching markets with endowments: equilibria and algorithms. - Jugal Garg; Thorben Tröbst; Vijay V. Vazirani (Auton. Agents Multi Agent Syst., 2024)

Proportionally Fair Makespan Approximation. - Michal Feldman; Jugal Garg; Vishnu V. Narayan; Tomasz Ponitka (AAAI, 2025)

Improved Maximin Share Approximations for Chores by Bin Packing. - Jugal Garg; Xin Huang; Erel Segal-Halevi (AAAI, 2025)

Matching Markets with Chores. - Jugal Garg; Thorben Tröbst; Vijay V. Vazirani (AAMAS, 2025)

On the Theoretical Foundations of Data Exchange Economies. - Hannaneh Akrami; Bhaskar Ray Chaudhury; Jugal Garg; Aniket Murhekar (EC, 2025)

Approximating Competitive Equilibrium by Nash Welfare. - Jugal Garg; Yixin Tao; László A. Végh (SODA, 2025)

Constant-Factor EFX Exists for Chores. - Jugal Garg; Aniket Murhekar; John Qin (STOC, 2025)

EFX: A Simpler Approach and an (Almost) Optimal Guarantee via Rainbow Cycle Number. - Hannaneh Akrami; Noga Alon; Bhaskar Ray Chaudhury; Jugal Garg; Kurt Mehlhorn; Ruta Mehta (Oper. Res., 2025)

Exploring Relations among Fairness Notions in Discrete Fair Division. - Jugal Garg; Eklavya Sharma (CoRR, 2025)

Improved MMS Approximations for Few Agent Types. - Jugal Garg; Parnian Shahkar (CoRR, 2025)

Tight Efficiency Bounds for the Probabilistic Serial Mechanism under Cardinal Preferences. - Jugal Garg; Yixin Tao; László A. Végh (CoRR, 2025)

Existence of 2-EFX Allocations of Chores. - Jugal Garg; Aniket Murhekar (CoRR, 2025)