| A complementary pivot algorithm for market equilibrium under separable, piecewise-linear concave utilities J Garg, R Mehta, M Sohoni, VV Vazirani SIAM Journal on Computing 44 (6), 1820-1847, 2015 | 47 | 2015 |
| Rank-1 bimatrix games: a homeomorphism and a polynomial time algorithm B Adsul, J Garg, R Mehta, M Sohoni Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011 | 42 | 2011 |
| Approximating the Nash social welfare with budget-additive valuations J Garg, M Hoefer, K Mehlhorn Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018 | 37 | 2018 |
| ∃ R-Completeness for Decision Versions of Multi-Player (Symmetric) Nash Equilibria J Garg, R Mehta, VV Vazirani, S Yazdanbod ACM Transactions on Economics and Computation (TEAC) 6 (1), 1-23, 2018 | 35 | 2018 |
| Nash equilibria in Fisher market B Adsul, CS Babu, J Garg, R Mehta, M Sohoni International Symposium on Algorithmic Game Theory, 30-41, 2010 | 34 | 2010 |
| An improved combinatorial polynomial algorithm for the linear Arrow-Debreu market R Duan, J Garg, K Mehlhorn Proceedings of the twenty-seventh annual ACM-SIAM symposium on discrete …, 2016 | 25 | 2016 |
| An improved approximation algorithm for maximin shares J Garg, S Taki Proceedings of the 21st ACM Conference on Economics and Computation, 379-380, 2020 | 23 | 2020 |
| A rational convex program for linear Arrow-Debreu markets NR Devanur, J Garg, LA Végh ACM Transactions on Economics and Computation (TEAC) 5 (1), 1-13, 2016 | 23 | 2016 |
| Bilinear games: Polynomial time algorithms for rank based subclasses J Garg, AX Jiang, R Mehta International Workshop on Internet and Network Economics, 399-407, 2011 | 22 | 2011 |
| On Fair Division of Indivisible Items B Chaudhury, YK Cheung, J Garg, N Garg, M Hoefer, K Mehlhorn arXiv preprint arXiv:1805.06232, 2018 | 21* | 2018 |
| Approximating maximin share allocations J Garg, P McGlaughlin, S Taki Open access series in informatics 69, 2019 | 20 | 2019 |
| EFX exists for three agents BR Chaudhury, J Garg, K Mehlhorn Proceedings of the 21st ACM Conference on Economics and Computation, 1-19, 2020 | 19 | 2020 |
| Settling the complexity of Leontief and PLC exchange markets under exact and approximate equilibria J Garg, R Mehta, VV Vazirani, S Yazdanbod Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017 | 17 | 2017 |
| Towards polynomial simplex-like algorithms for market equilibria J Garg, R Mehta, M Sohoni, NK Vishnoi Proceedings of the twenty-fourth annual ACM-SIAM symposium on discrete …, 2013 | 16 | 2013 |
| Approximating Nash social welfare under submodular valuations through (un) matchings J Garg, P Kulkarni, R Kulkarni Proceedings of the fourteenth annual ACM-SIAM symposium on discrete …, 2020 | 15 | 2020 |
| Dichotomies in equilibrium computation, and complementary pivot algorithms for a new class of non-separable utility functions J Garg, R Mehta, VV Vazirani Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014 | 14 | 2014 |
| A strongly polynomial algorithm for linear exchange markets J Garg, LA Végh Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019 | 13 | 2019 |
| A game theory analysis of green infrastructure stormwater management policies R William, J Garg, AS Stillwell Water Resources Research 53 (9), 8003-8019, 2017 | 13 | 2017 |
| Ascending-price algorithms for unknown markets X Bei, J Garg, M Hoefer ACM Transactions on Algorithms (TALG) 15 (3), 1-33, 2019 | 10 | 2019 |
| Improving Nash social welfare approximations J Garg, P McGlaughlin Improving Nash Social Welfare Approximations, 2019 | 9 | 2019 |
Kurt MehlhornProfessor of Computer Science, Max Planck Institute for Informatics, Saarland Informatics CampusVerified email at mpi-inf.mpg.de
