My main research interests are in computational aspects of economics and game theory, design and analysis of algorithms, and mathematical programming. Currently, I am working on designing fast algorithms for computing competitive equilibria with applications to fair division problems. I received my BTech and PhD in Computer Science from IITBombay. Later, I was a postdoc in Algorithms and Randomness Center at Georgia Tech, and in Algorithms and Complexity group at MaxPlanckInstitut für Informatik, Saarbrücken. For more information, please see my CV.
My research is funded by the NSF CRII Award and the NSF CAREER Award.
Recent/Upcoming Activities
 Program Committee: AAAI 2022, EC 2021, IJCAI 2021, AAMAS 2021, AAAI 2021, FOCS 2020, EC 2020, SODA 2020, IJCAI 2020
 Invited talk at DIMAP seminar at the University of Warwick, UK, October 18, 2021 (Online)
 Invited talk at IJTCS 2021, Beijing, China, August 1620, 2021 (Online)
 Invited talk at EC'21 workshop on Fair Resource Allocation: Concepts, Algorithms and Complexity EC 2021, Hungary, July 1823, 2021 (Online)
 Invited talk at HALG 2020, Zurich, August 31September 2, 2020 (Online)
 ADFOCS 2020, Saarbrücken, Germany, August 2428, 2020 (Online)
 Plenary talk at ITA 2020, San Diego, February 27, 2020
 CSE Seminar, IITBombay, India, January 14, 2020
 INFORMS Annual Meeting, Seattle, October 20  23, 2019
 Online and MatchingBased Market Design, Simons Institute, UC Berkeley, August 21  October 4, 2019
 Tutorial (coorganized) on Nash welfare, Market Equilibrium, and Stable Polynomials at STOC 2019, Phoenix, June 2326, 2019
 Invited talk at UCI, Irvine, May 16, 2019
 Invited talk at LSE, London, March 1228, 2019
Teaching (Recipient of The James Franklin Sharp Outstanding Teaching Award, 2019; Featured in the List of Teachers Ranked as Excellent for Spring 2016, Fall 2018, and Spring 2021)
 IE 405: Computing for ISE, Fall 2019, Fall 2020, Fall 2021
 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
 IE 498: Computing for ISE, Spring 2016, Spring 2017, Spring 2018, Fall 2018
 CS 8803: Advanced Topics in Algorithmic Game Theory, Spring 2013 (cotaught at Georgia Tech)
Students
Peter McGlaughlin
Timothy Murray (coadvised with Rakesh Nagi)
Setareh Taki
John Qin
Pooja Kulkarni (CS)
Aniket Murhekar (CS, coadvised with Ruta Mehta; Siebel Scholar 2020)
Omkar Thakoor (MS, CS) (graduated in May 2017; now a Ph.D. student at USC)
Selected Publications (We have implemented some of our algorithms. Source code is available on request; just send me an email.)
Preprints
Refereed Journal Papers
 Jugal Garg and Setareh Taki. An Improved Approximation Algorithm for Maximin Shares. Artificial Intelligence, (accepted).
 Timothy Murray, Jugal Garg, and Rakesh Nagi. PrizeCollecting MultiAgent Orienteering: Price of Anarchy Bounds and Solution Methods. IEEE Transactions on Automation Science and Engineering, (accepted).
 Jugal Garg, Edin Husić, and László Végh. Approximating Nash Social Welfare under Rado Valuations. SIGecom Exch. 19(1): 4551 (2021).
 Bharat Adsul, Jugal Garg, Ruta Mehta, Milind Sohoni, and Bernhard von Stengel. Fast Algorithms for Rank1 Bimatrix Games. Operations Research, 69(2): 613631 (2021).
 Timothy Murray, Jugal Garg, and Rakesh Nagi. LimitedTrust Equilibria. European Journal of Operational Research, 289(1): 364380 (2021).
 Jugal Garg and Peter McGlaughlin. Improving Nash Social Welfare Approximations. Journal of Artificial Intelligence Research, 68: 225245 (2020).
 Omkar Thakoor, Jugal Garg, and Rakesh Nagi. MultiAgent UAV Routing: A Game Theory Analysis with Tight Price of Anarchy Bounds. IEEE Transactions on Automation Science and Engineering, 17(1): 100116 (2020).
 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:110:35 (2019).
 Xiaohui Bei, Jugal Garg, and Martin Hoefer. AscendingPrice Algorithms for Unknown Markets. ACM Transactions on Algorithms, 15(3): 37:137: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): 9961024 (2018).
 Jugal Garg, Ruta Mehta, Vijay Vazirani, and Sadra Yazdanbod. EXISTSRCompleteness for Decision Versions of MultiPlayer (Symmetric) Nash Equilibria. ACM Transactions on Economics and Computation, 6(1): 1:11:23 (2018).
 Reshmina William, Jugal Garg, and Ashlynn Stillwell. A Game Theory Analysis of Green Infrastructure Implementation Policies. Water Resources Research, 53:9 80038019 (2017).
 Jugal Garg. Market Equilibrium under Piecewise Leontief Concave Utilities. Theoretical Computer Science, 703: 5565 (2017).
 Nikhil Devanur, Jugal Garg, and László Végh. A Rational Convex Program for Linear ArrowDebreu Markets. ACM Transactions on Economics and Computation, 5(1): 6:16: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): 125 (2016).
 Jugal Garg, Ruta Mehta, Milind Sohoni, and Vijay Vazirani. A Complementary Pivot Algorithm for Market Equilibrium under Separable, PiecewiseLinear Concave Utilities. SIAM Journal on Computing 44(6): 18201847 (2015).
Refereed Conference Papers
 Jugal Garg, Pooja Kulkarni, and Aniket Murhekar. On Fair and Efficient Allocations of Indivisible Public Goods. To appear in the Proceedings of the 41st Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), 2021.
 Jugal Garg and Aniket Murhekar. Computing Fair and Efficient Allocations with Few Utility Values. Proceedings of the 14th International Symposium on Algorithmic Game Theory (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. Proceedings of the 14th International Symposium on Algorithmic Game Theory (SAGT), 2021.
 Bhaskar Ray Chaudhury, Jugal Garg, Kurt Mehlhorn, Ruta Mehta, and Pranabendu Misra. Improving EFX Guarantees through Rainbow Cycle Number. Proceedings of the 22nd ACM Conference on Economics and Computation (EC), 2021.
 Jugal Garg, Edin Husić, and László Végh. Approximating Nash Social Welfare under Rado Valuations. Proceedings of the 53rd Symposium on Theory of Computing (STOC), 2021.
 Jugal Garg, Edin Husić, and László Végh. Auction Algorithms for Market Equilibrium with Weak Gross Substitute Demands and their Applications. Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science (STACS), 2021. Invited to the TOCS Special Issue for STACS 2021.
 Jugal Garg and Aniket Murhekar. On Fair and Efficient Allocations of Indivisible Goods. Proceedings of the 35th AAAI Conference on Artificial Intelligence (AAAI), 2021.
 Bhaskar Ray Chaudhury, Jugal Garg, and Ruta Mehta. Fair and Efficient Allocations under Subadditive Valuations. Proceedings of the 35th AAAI Conference on Artificial Intelligence (AAAI), 2021.
 Bhaskar Ray Chaudhury, Jugal Garg, Peter McGlaughlin, and Ruta Mehta. Competitive Allocation of a Mixed Manna. Proceedings of the 32nd Annual ACMSIAM Symposium on Discrete Algorithms (SODA), 2021.
 Bhaskar Ray Chaudhury, Jugal Garg, and Kurt Mehlhorn. EFX Exists for Three Agents. Proceedings of the 21st ACM Conference on Economics and Computation (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. Proceedings of the 21st ACM Conference on Economics and Computation (EC), 2020.
 Jugal Garg and Peter McGlaughlin. Computing Competitive Equilibria with Mixed Manna. Proceedings of the 19th International Conference on Autonomous Agents and MultiAgent Systems (AAMAS), 2020.
 Jugal Garg, Pooja Kulkarni, and Rucha Kulkarni. Approximating Nash Social Welfare under Submodular Valuations through (Un)Matchings. Proceedings of the 31st Annual ACMSIAM Symposium on Discrete Algorithms (SODA), 2020.
 Jugal Garg and Peter McGlaughlin. Improving Nash Social Welfare Approximations. Proceedings of the 28th International Joint Conference on Artificial Intelligence (IJCAI), 2019.
 Jugal Garg and László Végh. A Strongly Polynomial Algorithm for Linear Exchange Markets. Proceedings of the 51st Symposium on Theory of Computing (STOC), 2019. Invited to HALG'20 and to the SICOMP Special Issue for STOC 2019.
 Jugal Garg, Peter McGlaughlin, and Setareh Taki. Approximating Maximin Share Allocations. Proceedings of the Symposium on Simplicity in Algorithms (SOSA), 2019.
 Bhaskar Chaudhury, Yun Kuen Cheung, Jugal Garg, Naveen Garg, Martin Hoefer, and Kurt Mehlhorn. On Fair Division of Indivisible Items. Proceedings of the 38th Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), 2018.
 Rahul Swamy, Timothy Murray, and Jugal Garg. Network CostSharing Games: Equilibrium Computation and Applications to Election Modeling. Proceedings of the 12th International Conference on Combinatorial Optimization and Applications (COCOA), 2018. Invited to the JOCO Special Issue for COCOA 2018.
 Jugal Garg and Peter McGlaughlin. A Truthful Mechanism for Interval Scheduling. Proceedings of the 11th International Symposium on Algorithmic Game Theory (SAGT), 2018.
 Jugal Garg, Martin Hoefer, and Kurt Mehlhorn. Approximating the Nash Social Welfare with BudgetAdditive Valuations. Proceedings of the 29th Annual ACMSIAM Symposium on Discrete Algorithms (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. Proceedings of the 29th Annual ACMSIAM Symposium on Discrete Algorithms (SODA), 2018.
 Xiaohui Bei, Jugal Garg, Martin Hoefer, and Kurt Mehlhorn. Earning Limits in Fisher Markets with SpendingConstraint Utilities. Proceedings of the 10th International Symposium on Algorithmic Game Theory (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. Proceedings of the 49th Symposium on Theory of Computing (STOC), 2017.
 Ran Duan, Jugal Garg, and Kurt Mehlhorn. An Improved Combinatorial Polynomial Algorithm for the Linear ArrowDebreu Market. Proceedings of the 27th Annual ACMSIAM Symposium on Discrete Algorithms (SODA), 2016.
 Xiaohui Bei, Jugal Garg, Martin Hoefer, and Kurt Mehlhorn. Computing Equilibria in Markets with BudgetAdditive Utilities. Proceedings of the 24th European Symposium on Algorithms (ESA), 2016.
 Xiaohui Bei, Jugal Garg, and Martin Hoefer. AscendingPrice Algorithms for Unknown Markets. Proceedings of the 17th ACM Conference on Economics and Computation (EC), 2016.
 Xiaohui Bei, Wei Chen, Jugal Garg, Martin Hoefer, and Xiaoming Sun. Learning Market Parameters using Aggregate Demand Queries. Proceedings of the 30th AAAI Conference on Artificial Intelligence (AAAI), 2016.
 Jugal Garg, Ruta Mehta, Vijay Vazirani, and Sadra Yazdanbod. ETRCompleteness for Decision Versions of MultiPlayer (Symmetric) Nash Equilibria. Proceedings of the 42nd International Colloquium on Automata, Languages and Programming (ICALP), 2015.
 Jugal Garg and Ravi Kannan. Markets with Production: A Polynomial Time Algorithm and a Reduction to Exchange. Proceedings of the 16th ACM Conference on Economics and Computation (EC), 2015.
 Jugal Garg, Ruta Mehta, and Vijay Vazirani. Dichotomies in Equilibrium Computation, and Complementary Pivot Algorithms for a New Class of NonSeparable Utility Functions. Proceedings of the 46th Symposium on Theory of Computing (STOC), 2014.
 Jugal Garg and Vijay Vazirani. On Computability of Equilibria in Markets with Production. Proceedings of the 25th Annual ACMSIAM Symposium on Discrete Algorithms (SODA), 2014.
 Jugal Garg. Market Equilibrium under Piecewise Leontief Concave Utilities. Proceedings of the 10th Conference on Web and & Internet Economics (WINE), 2014.
 Jugal Garg, Ruta Mehta, Milind Sohoni, and Nisheeth Vishnoi. Towards Polynomial SimplexLike Algorithms for Market Equilibria. Proceedings of the 24th Annual ACMSIAM Symposium on Discrete Algorithms (SODA), 2013.
 Jugal Garg, Ruta Mehta, Milind Sohoni, and Vijay V. Vazirani. A Complementary Pivot Algorithm for Market Equilibrium under Separable, PiecewiseLinear Concave Utilities. Proceedings of the 44th Symposium on Theory of Computing (STOC), 2012.
 Bharat Adsul, Jugal Garg, Ruta Mehta, and Milind Sohoni. Rank1 Bimatrix Games: A Homeomorphism and a Polynomial Time Algorithm. Proceedings of the 43rd Symposium on Theory of Computing (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. Proceedings of the 7th Workshop on Internet & Network Economics (WINE), 2011.
 Bharat Adsul, Ch. Sobhan Babu, Jugal Garg, Ruta Mehta, and Milind Sohoni. A Simplexlike Algorithm for Fisher Markets. Proceedings of the 3rd International Symposium on Algorithmic Game Theory (SAGT), 2010.
 Bharat Adsul, Ch. Sobhan Babu, Jugal Garg, Ruta Mehta, and Milind Sohoni. Nash Equilibria in Fisher Market. Proceedings of the 3rd International Symposium on Algorithmic Game Theory (SAGT), 2010. Invited to the TOCS Special Issue for SAGT 2010.
