Up a level |
Garg, Jugal, Husić, Edin and Végh, László A. ORCID: 0000-0003-1152-200X (2023) An auction algorithm for market equilibrium with weak gross substitute demands. ACM Transactions on Economics and Computation, 11 (3-4). 1 - 24. ISSN 2167-8375
Garg, Jugal, Husić, Edin ORCID: 0000-0002-6708-5112, Li, Wenzheng, Végh, László A. ORCID: 0000-0003-1152-200X and Vondrák, Jan (2023) Approximating Nash social welfare by matching and local search. In: Saha, Barna and Servedio, Rocco A., (eds.) STOC 2023 - Proceedings of the 55th Annual ACM Symposium on Theory of Computing. Proceedings of the Annual ACM Symposium on Theory of Computing. Association for Computing Machinery, pp. 1298-1310. ISBN 9781450399135
Garg, Jugal and Végh, László A. ORCID: 0000-0003-1152-200X (2023) A strongly polynomial algorithm for linear exchange markets. Operations Research, 71 (2). 487 - 505. ISSN 0030-364X
Garg, Jugal, Tao, Yixin and Végh, László A. ORCID: 0000-0003-1152-200X (2022) Approximating equilibrium under constrained piecewise linear concave utilities with applications to matching markets. In: Naor, Joseph (Seffi) and Buchbinder, Niv, (eds.) Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, 2269 - 2284. ISBN 9781611977073
Garg, Jugal, Husić, Edin and Végh, László A. ORCID: 0000-0003-1152-200X (2021) Approximating Nash social welfare under rado valuations. In: Khuller, Samir and Williams, Virginia Vassilevska, (eds.) STOC 2021 - Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing. Proceedings of the Annual ACM Symposium on Theory of Computing. Association for Computing Machinery, ITA, 1412 - 1425. ISBN 9781450380539
Garg, Jugal, Husić, Edin ORCID: 0000-0002-6708-5112 and Végh, László A. ORCID: 0000-0003-1152-200X (2021) Auction algorithms for market equilibrium with weak gross substitute demands and their applications. In: Blaser, Markus and Monmege, Benjamin, (eds.) 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021. Leibniz International Proceedings in Informatics, LIPIcs,187. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. ISBN 9783959771801
Adsul, Bharat, Garg, Jugal, Mehta, Ruta, Sohoni, Milind and Von Stengel, Bernhard ORCID: 0000-0002-3488-8322 (2020) Fast algorithms for rank-1 bimatrix games. Operations Research. 0-0. ISSN 0030-364X
Garg, Jugal and Végh, László A. ORCID: 0000-0003-1152-200X (2019) A strongly polynomial algorithm for linear exchange markets. In: Charikar, Moses and Cohen, Edith, (eds.) STOC 2019 - Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing. Proceedings of the Annual ACM Symposium on Theory of Computing. UNSPECIFIED, pp. 54-65. ISBN 9781450367059
Devanur, Nikhil R., Garg, Jugal and Végh, László A. ORCID: 0000-0003-1152-200X (2016) A rational convex program for linear Arrow-Debreu markets. ACM Transactions on Economics and Computation, 5 (1). p. 6. ISSN 2167-8375