Jugal Garg

Jugal's research studies algorithms and complexity for some of the most fundamental problems in economics and computation, with a particular focus on allocation problems arising in fair division and general equilibrium theory. Jugal received BTech and PhD in Computer Science from IIT-Bombay. Later, he was a postdoc in Algorithms and Randomness Center at Georgia Tech, and in Algorithms and Complexity group at Max-Planck-Institut für Informatik, Saarbrücken.

Jugal has received several awards for his research, including the NSF CRII Award, the NSF CAREER Award, the Exemplary Theory Paper Award at ACM EC 2020, INFORMS Koopman Prize 2021, and the Dean's Award for Excellence in Research 2022. For his teaching, he has received the James Franklin Sharp Outstanding Teaching Award 2019, ISE Department Head Teaching Award 2023, and have been featured in the List of Teachers Ranked as Excellent multiple times.

Recent/Upcoming Activities

Recent Program Committees: EC 2026 (SPC), IJCAI 2026 (SPC), AAAI 2026, EC 2025 (SPC), IJCAI 2025 (SPC), WINE 2024 (SPC), IJCAI 2024, WINE 2023 (co-chair), EC 2023, SODA 2023, IJCAI 2023

Invited talk at CS Theory Seminar, Purdue University, April 16, 2026

Invited talks at ACM India Winter School on Algorithmic Game Theory, IIT-Ropar, India, December 15-24, 2025

Invited talk at University of Bonn, Germany, March 31, 2025

Invited talk at STCS seminar@TIFR, Mumbai, India, January 14, 2025

Invited talk at Workshop on Fair Division, Singapore, November 25-29, 2024

Invited talks at ACO/CS seminar@UCI, Irvine, March 7-8, 2024

Invited talk at Fairness workshop@FSTTCS, Hyderabad, India, December 16-17, 2023

Invited talk at LSE, London, June 9-21, 2023

Invited talk at COMSOC Seminar, May 12, 2023 (Online)

Keynote talk at Bellairs Workshop on Multi-Agent Systems, Barbados, March 25-31, 2023

Invited talk at FOCS 2022 workshop on Fair Division: Algorithms & Complexity, Denver, October 31 - November 3, 2022

Teaching

IE 310: Deterministic Models in Optimization, Spring 2023

IE 405: Computing for ISE, Fall 2019, Fall 2020, Fall 2021, Fall 2022, Fall 2023, Fall 2024, Fall 2025

IE 498: Computing for ISE, Spring 2016, Spring 2017, Spring 2018, Fall 2018

IE 598: Games, Markets, and Mathematical Programming, Fall 2016, Fall 2017, Spring 2020 (Lecture Notes)

IE 598GT: Topics in Game Theory and Fair Division, Spring 2021, Spring 2022, Spring 2024

IE 598GTO: Game Theory and Optimization, Spring 2026

CS 8803: Advanced Topics in Algorithmic Game Theory, Spring 2013 (co-taught at Georgia Tech)

PhD Students

Eklavya Sharma (ISE)

John Qin (ISE)

Yuang (Eric) Shen (ISE)

Pooja Kulkarni (CS), May 2025. Postdoc at Northwestern

Aniket Murhekar (CS; Siebel Scholar 2020), May 2025. Postdoc at Northwestern

Setareh Taki (ISE), May 2022. Grubhub

Peter McGlaughlin (ISE), April 2021. San Jose State University

Timothy Murray (ISE), December 2020. Meta

Selected Publications (Google Scholar, DBLP)

Preprints

Refereed Journal Papers

Jugal Garg, Edin Husić, Wenzheng Li, László Végh, and Jan Vondrák. Approximating Nash Social Welfare by Matching and Local Search.
Journal of the ACM (accepted)

Jugal Garg, Yixin Tao, and László Végh. Approximating Competitive Equilibrium by Nash Welfare
Games and Economic Behavior (accepted)

Hannaneh Akrami, Noga Alon, Bhaskar Ray Chaudhury, Jugal Garg, Kurt Mehlhorn, and Ruta Mehta. EFX: A Simpler Approach and an (Almost) Optimal Guarantee via Rainbow Cycle Number
Operations Research 73(2): 738-751 (2025)

Bhaskar Ray Chaudhury, Jugal Garg, Kurt Mehlhorn, Ruta Mehta, and Pranabendu Misra. Improving Envy Freeness up to Any Good Guarantees through Rainbow Cycle Number
Mathematics of Operations Research 49(4): 2323-2340 (2024)

Jugal Garg, Martin Hoefer, and Kurt Mehlhorn. Satiation in Fisher Markets and Approximation of Nash Social Welfare
Mathematics of Operations Research 49(2): 1109-1139 (2024)

Jugal Garg and Aniket Murhekar. Computing Pareto-Optimal and Almost Envy-Free Allocations of Indivisible Goods
Journal of Artificial Intelligence Research 80: 1-25 (2024)

Jugal Garg, Thorben Tröbst, and Vijay Vazirani. One-Sided Matching Markets with Endowments: Equilibria and Algorithms
Autonomous Agents and Multi-Agent Systems 38(2): 40 (2024)

Bhaskar Ray Chaudhury, Jugal Garg, and Kurt Mehlhorn. EFX Exists for Three Agents
Journal of the ACM 71(1): 4:1-4:27 (2024)

Jugal Garg, Edin Husić, and László Végh. Auction Algorithms for Market Equilibrium with Weak Gross Substitute Demands and their Applications
ACM Transactions on Economics and Computation 11(3-4): 1-24 (2023)

Jugal Garg, Martin Hoefer, Peter McGlaughlin, and Marco Schmalhofer. Competitive Equilibria with a Constant Number of Chores.
Journal of Artificial Intelligence Research 78: 1201-1219 (2023)

Jugal Garg, Pooja Kulkarni, and Rucha Kulkarni. Approximating Nash Social Welfare under Submodular Valuations through (Un)Matchings
ACM Transactions on Algorithms ACM Trans. Algorithms 19(4): 36:1-36:25 (2023)

Bhaskar Ray Chaudhury, Jugal Garg, Peter McGlaughlin, and Ruta Mehta. A Complementary Pivot Algorithm for Competitive Allocation of a Mixed Manna
Mathematics of Operations Research 48(3): 1630-1656 (2023)

Jugal Garg and László Végh. A Strongly Polynomial Algorithm for Linear Exchange Markets
Operations Research 71(2): 487-505 (2023)

Jugal Garg and Aniket Murhekar. Computing Fair and Efficient Allocations with Few Utility Values.
Theoretical Computer Science 962: 113932 (2023)

Bhaskar Chaudhury, Yun Kuen Cheung, Jugal Garg, Naveen Garg, Martin Hoefer, and Kurt Mehlhorn. Fair Division of Indivisible Goods for a Class of Concave Valuations.
Journal of Artificial Intelligence Research, 74: 111-142 (2022)

Timothy Murray, Jugal Garg, and Rakesh Nagi. Prize-Collecting Multi-Agent Orienteering: Price of Anarchy Bounds and Solution Methods.
IEEE Transactions on Automation Science and Engineering, 19(1): 531-544 (2022)

Jugal Garg and Setareh Taki. An Improved Approximation Algorithm for Maximin Shares
Artificial Intelligence 300: 103547 (2021)

Jugal Garg, Edin Husić, and László Végh. Approximating Nash Social Welfare under Rado Valuations
SIGecom Exch. 19(1): 45-51 (2021)

Bharat Adsul, Jugal Garg, Ruta Mehta, Milind Sohoni, and Bernhard von Stengel. Fast Algorithms for Rank-1 Bimatrix Games
Operations Research, 69(2): 613-631 (2021)

Timothy Murray, Jugal Garg, and Rakesh Nagi. Limited-Trust Equilibria.
European Journal of Operational Research, 289(1): 364-380 (2021)

Jugal Garg and Peter McGlaughlin. Improving Nash Social Welfare Approximations.
Journal of Artificial Intelligence Research, 68: 225-245 (2020)

Omkar Thakoor, Jugal Garg, and Rakesh Nagi. Multi-Agent UAV Routing: A Game Theory Analysis with Tight Price of Anarchy Bounds.
IEEE Transactions on Automation Science and Engineering, 17(1): 100-116 (2020) (Winner of INFORMS Koopman Prize 2021)

Xiaohui Bei, Jugal Garg, Martin Hoefer, and Kurt Mehlhorn. Earning and Utility Limits in Fisher Markets.
ACM Transactions on Economics and Computation, 7(2): 10:1-10:35 (2019)

Xiaohui Bei, Jugal Garg, and Martin Hoefer. Ascending-Price Algorithms for Unknown Markets.
ACM Transactions on Algorithms, 15(3): 37:1-37:33 (2019)

Jugal Garg, Ruta Mehta, and Vijay Vazirani. Substitution with Satiation: A New Class of Utility Functions and a Complementary Pivot Algorithm.
Mathematics of Operations Research, 43(3): 996-1024 (2018)

Jugal Garg, Ruta Mehta, Vijay Vazirani, and Sadra Yazdanbod. EXISTS-R-Completeness for Decision Versions of Multi-Player (Symmetric) Nash Equilibria.
ACM Transactions on Economics and Computation, 6(1): 1:1-1:23 (2018)

Reshmina William, Jugal Garg, and Ashlynn Stillwell. A Game Theory Analysis of Green Infrastructure Implementation Policies
Water Resources Research, 53:9 8003-8019 (2017) (Featured in Editor's Highlight)

Jugal Garg. Market Equilibrium under Piecewise Leontief Concave Utilities
Theoretical Computer Science, 703: 55-65 (2017)

Nikhil Devanur, Jugal Garg, and László Végh. A Rational Convex Program for Linear Arrow-Debreu Markets
ACM Transactions on Economics and Computation, 5(1): 6:1-6:13 (2016)

Jugal Garg, Ruta Mehta, and Vijay Vazirani. Dichotomies in Equilibrium Computation, and Membership of PLC markets in FIXP
Theory of Computing, 12(1): 1-25 (2016)

Jugal Garg, Ruta Mehta, Milind Sohoni, and Vijay Vazirani. A Complementary Pivot Algorithm for Market Equilibrium under Separable, Piecewise-Linear Concave Utilities
SIAM Journal on Computing 44(6): 1820-1847 (2015)

Refereed Conference Papers

Bhaskar Ray Chaudhury, Jugal Garg, Aniket Murhekar, and Jiaxin Song. Data Pricing via Competitive Equilibrium. WWW 2026

Jugal Garg, Eklavya Sharma, and Xiaowei Wu. Proportional and Pareto-Optimal Allocation of Chores with Subsidy. AAMAS 2026

Jugal Garg and Eklavya Sharma. Exploring Relations among Fairness Notions in Discrete Fair Division. AAMAS 2026

Jugal Garg and Aniket Murhekar. Existence of 2-EFX Allocations of Chores. AAAI 2026

Jugal Garg, Vishnu V. Narayan, and Yuang Eric Shen. Designing Truthful Mechanisms for Asymptotic Fair Division. AAAI 2026

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

Jugal Garg and Parnian Shahkar. Improved MMS Approximations for Few Agent Types IJCAI 2025

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

Jugal Garg, Thorben Tröbst, and Vijay Vazirani. Matching Markets with Chores. AAMAS 2025

Michal Feldman, Jugal Garg, Vishnu V. Narayan, and Tomasz Ponitka. Proportionally Fair Makespan Approximation. AAAI 2025

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

Jugal Garg, Yixin Tao, and László Végh. Approximating Competitive Equilibrium by Nash Welfare. SODA 2025

Hannaneh Akrami, Jugal Garg, Eklavya Sharma, and Setareh Taki. Improving Approximation Guarantees for Maximin Share. EC 2024

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

Hannaneh Akrami and Jugal Garg. Breaking the 3/4 Barrier for Approximate Maximin Share. SODA 2024

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

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

Jugal Garg, Aniket Murhekar, and John Qin. Improving Fairness and Efficiency Guarantees for Allocating Indivisible Chores. IJCAI 2023

Ioannis Caragiannis, Jugal Garg, Nidhi Rathi, Eklavya Sharma, and Giovanna Varricchio Existence and Computation of Epistemic EFX. IJCAI 2023

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

Jugal Garg, Edin Husić, Wenzheng Li, László Végh, and Jan Vondrák. Approximating Nash Social Welfare by Matching and Local Search. STOC 2023

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

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

Jugal Garg, Edin Husić, Aniket Murhekar, and László Végh. Tractable Fragments of the Maximum Nash Welfare Problem. WINE 2022

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

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

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

Jugal Garg, Thorben Tröbst, and Vijay Vazirani. One-Sided Matching Markets with Endowments: Equilibria and Algorithms. AAMAS 2022

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

Jugal Garg and Aniket Murhekar. Computing Fair and Efficient Allocations with Few Utility Values. SAGT 2021 (Invited to the TCS Special Issue for SAGT 2021)

Jugal Garg, Martin Hoefer, Peter McGlaughlin, and Marco Schmalhofer. When Dividing Mixed Manna is Easier than Dividing Goods: Competitive Equilibria with a Constant Number of Chores. SAGT 2021

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

Jugal Garg, Edin Husić, and László Végh. Approximating Nash Social Welfare under Rado Valuations. STOC 2021

Jugal Garg, Edin Husić, and László Végh. Auction Algorithms for Market Equilibrium with Weak Gross Substitute Demands and their Applications. STACS 2021 (Invited to the TOCS Special Issue for STACS 2021)

Jugal Garg and Aniket Murhekar. On Fair and Efficient Allocations of Indivisible Goods. AAAI 2021

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

Bhaskar Ray Chaudhury, Jugal Garg, Peter McGlaughlin, and Ruta Mehta. Competitive Allocation of a Mixed Manna. SODA 2021

Bhaskar Ray Chaudhury, Jugal Garg, and Kurt Mehlhorn. EFX Exists for Three Agents. EC 2020 (Exemplary Theory Paper Award; Best Paper with a Student Lead Author Award)

Jugal Garg and Setareh Taki. An Improved Approximation Algorithm for Maximin Shares. EC 2020

Jugal Garg and Peter McGlaughlin. Computing Competitive Equilibria with Mixed Manna. AAMAS 2020

Jugal Garg, Pooja Kulkarni, and Rucha Kulkarni. Approximating Nash Social Welfare under Submodular Valuations through (Un)Matchings. SODA 2020

Jugal Garg and Peter McGlaughlin. Improving Nash Social Welfare Approximations. IJCAI 2019

Jugal Garg and László Végh. A Strongly Polynomial Algorithm for Linear Exchange Markets. STOC 2019 (Invited to HALG 2020 and to the SICOMP Special Issue for STOC 2019)

Jugal Garg, Peter McGlaughlin, and Setareh Taki. Approximating Maximin Share Allocations. SOSA 2019

Bhaskar Chaudhury, Yun Kuen Cheung, Jugal Garg, Naveen Garg, Martin Hoefer, and Kurt Mehlhorn. On Fair Division of Indivisible Items. FSTTCS 2018

Rahul Swamy, Timothy Murray, and Jugal Garg. Network Cost-Sharing Games: Equilibrium Computation and Applications to Election Modeling. COCOA 2018 (Invited to the JOCO Special Issue for COCOA 2018)

Jugal Garg and Peter McGlaughlin. A Truthful Mechanism for Interval Scheduling. SAGT 2018

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

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

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

Jugal Garg, Ruta Mehta, Vijay Vazirani, and Sadra Yazdanbod. Settling the Complexity of Leontief and PLC Exchange Markets under Exact and Approximate Equilibria. STOC 2017

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

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

Xiaohui Bei, Jugal Garg, and Martin Hoefer. Ascending-Price Algorithms for Unknown Markets. EC 2016

Xiaohui Bei, Wei Chen, Jugal Garg, Martin Hoefer, and Xiaoming Sun. Learning Market Parameters using Aggregate Demand Queries. AAAI 2016

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

Jugal Garg and Ravi Kannan. Markets with Production: A Polynomial Time Algorithm and a Reduction to Exchange. EC 2015

Jugal Garg, Ruta Mehta, and Vijay Vazirani. Dichotomies in Equilibrium Computation, and Complementary Pivot Algorithms for a New Class of Non-Separable Utility Functions. STOC 2014

Jugal Garg and Vijay Vazirani. On Computability of Equilibria in Markets with Production. SODA 2014

Jugal Garg. Market Equilibrium under Piecewise Leontief Concave Utilities. WINE 2014

Jugal Garg, Ruta Mehta, Milind Sohoni, and Nisheeth Vishnoi. Towards Polynomial Simplex-Like Algorithms for Market Equilibria. SODA 2013

Jugal Garg, Ruta Mehta, Milind Sohoni, and Vijay V. Vazirani. A Complementary Pivot Algorithm for Market Equilibrium under Separable, Piecewise-Linear Concave Utilities. STOC 2012

Bharat Adsul, Jugal Garg, Ruta Mehta, and Milind Sohoni. Rank-1 Bi-matrix Games: A Homeomorphism and a Polynomial Time Algorithm. STOC 2011 (Invited to the GEB Special Issue for STOC/FOCS/SODA 2011)

Jugal Garg, Albert Jiang and Ruta Mehta. Bilinear Games: Polynomial Time Algorithms for Rank Based Subclasses. WINE 2011

Bharat Adsul, Ch. Sobhan Babu, Jugal Garg, Ruta Mehta, and Milind Sohoni. A Simplex-like Algorithm for Fisher Markets. SAGT 2010

Bharat Adsul, Ch. Sobhan Babu, Jugal Garg, Ruta Mehta, and Milind Sohoni. Nash Equilibria in Fisher Market. SAGT 2010 (Invited to the TOCS Special Issue for SAGT 2010)