Jugal Garg

According to our database1, Jugal Garg authored at least 58 papers between 2010 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2021
Approximating nash social welfare under rado valuations.
SIGecom Exch., 2021

Fast Algorithms for Rank-1 Bimatrix Games.
Oper. Res., 2021

Limited-trust equilibria.
Eur. J. Oper. Res., 2021

On Fair and Efficient Allocations of Indivisible Public Goods.
CoRR, 2021

Approximating Equilibrium under Constrained Piecewise Linear Concave Utilities with Applications to Matching Markets.
CoRR, 2021

Trust in Social Network Games.
CoRR, 2021

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, 2021

Competitive Allocation of a Mixed Manna.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Improving EFX Guarantees through Rainbow Cycle Number.
Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 2021

Computing Fair and Efficient Allocations with Few Utility Values.
Proceedings of the Algorithmic Game Theory - 14th International Symposium, 2021

When Dividing Mixed Manna Is Easier Than Dividing Goods: Competitive Equilibria with a Constant Number of Chores.
Proceedings of the Algorithmic Game Theory - 14th International Symposium, 2021

On Fair and Efficient Allocations of Indivisible Goods.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

Fair and Efficient Allocations under Subadditive Valuations.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
Multiagent UAV Routing: A Game Theory Analysis With Tight Price of Anarchy Bounds.
IEEE Trans Autom. Sci. Eng., 2020

Improving Nash Social Welfare Approximations.
J. Artif. Intell. Res., 2020

An Arrow-Debreu Extension of the Hylland-Zeckhauser Scheme: Equilibrium Existence and Algorithms.
CoRR, 2020

Dividing Bads is Harder than Dividing Goods: On the Complexity of Fair and Efficient Division of Chores.
CoRR, 2020

Approximating Nash Social Welfare under Submodular Valuations through (Un)Matchings.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

An Improved Approximation Algorithm for Maximin Shares.
Proceedings of the EC '20: The 21st ACM Conference on Economics and Computation, 2020

EFX Exists for Three Agents.
Proceedings of the EC '20: The 21st ACM Conference on Economics and Computation, 2020

Computing Competitive Equilibria with Mixed Manna.
Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020

2019
Earning and Utility Limits in Fisher Markets.
ACM Trans. Economics and Comput., 2019

Ascending-Price Algorithms for Unknown Markets.
ACM Trans. Algorithms, 2019

Auction Algorithms for Market Equilibrium with Weak Gross Substitute Demands.
CoRR, 2019

A strongly polynomial algorithm for linear exchange markets.
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

Approximating Maximin Share Allocations.
Proceedings of the 2nd Symposium on Simplicity in Algorithms, 2019

2018
∃R-Completeness for Decision Versions of Multi-Player (Symmetric) Nash Equilibria.
ACM Trans. Economics and Comput., 2018

Substitution with Satiation: A New Class of Utility Functions and a Complementary Pivot Algorithm.
Math. Oper. Res., 2018

On Fair Division of Indivisible Items.
CoRR, 2018

Approximating the Nash Social Welfare with Budget-Additive Valuations.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

A New Class of Combinatorial Markets with Covering Constraints: Algorithms and Applications.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

A Truthful Mechanism for Interval Scheduling.
Proceedings of the Algorithmic Game Theory - 11th International Symposium, 2018

On Fair Division for Indivisible Items.
Proceedings of the 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2018

Network Cost-Sharing Games: Equilibrium Computation and Applications to Election Modeling.
Proceedings of the Combinatorial Optimization and Applications, 2018

2017
Market equilibrium under piecewise Leontief concave utilities.
Theor. Comput. Sci., 2017

Settling the complexity of Leontief and PLC exchange markets under exact and approximate equilibria.
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

Earning Limits in Fisher Markets with Spending-Constraint Utilities.
Proceedings of the Algorithmic Game Theory - 10th International Symposium, 2017

2016
Dichotomies in Equilibrium Computation and Membership of PLC Markets in FIXP.
Theory Comput., 2016

A Rational Convex Program for Linear Arrow-Debreu Markets.
ACM Trans. Economics and Comput., 2016

An Improved Combinatorial Polynomial Algorithm for the Linear Arrow-Debreu Market.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Computing Equilibria in Markets with Budget-Additive Utilities.
Proceedings of the 24th Annual European Symposium on Algorithms, 2016

Learning Market Parameters Using Aggregate Demand Queries.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015
A Complementary Pivot Algorithm for Market Equilibrium under Separable, Piecewise-Linear Concave Utilities.
SIAM J. Comput., 2015

A Market for Scheduling, with Applications to Cloud Computing.
CoRR, 2015

Tatonnement for Linear and Gross Substitutes Markets.
CoRR, 2015

Markets with Production: A Polynomial Time Algorithm and a Reduction to Pure Exchange.
Proceedings of the Sixteenth ACM Conference on Economics and Computation, 2015

ETR-Completeness for Decision Versions of Multi-player (Symmetric) Nash Equilibria.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

2014
Leontief Exchange Markets Can Solve Multivariate Polynomial Equations, Yielding FIXP and ETR Hardness.
CoRR, 2014

Market Equilibrium under Piecewise Leontief Concave Utilities - [Extended Abstract].
Proceedings of the Web and Internet Economics - 10th International Conference, 2014

Dichotomies in equilibrium computation, and complementary pivot algorithms for a new class of non-separable utility functions.
Proceedings of the Symposium on Theory of Computing, 2014

On Computability of Equilibria in Markets with Production.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

2013
Towards Polynomial Simplex-Like Algorithms for Market Equlibria.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

2012
A complementary pivot algorithm for markets under separable, piecewise-linear concave utilities.
Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

2011
Bilinear Games: Polynomial Time Algorithms for Rank Based Subclasses.
Proceedings of the Internet and Network Economics - 7th International Workshop, 2011

Rank-1 bimatrix games: a homeomorphism and a polynomial time algorithm.
Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011

2010
Rank-1 Bi-matrix Games: A Homeomorphism and a Polynomial Time Algorithm
CoRR, 2010

Nash Equilibria in Fisher Market.
Proceedings of the Algorithmic Game Theory - Third International Symposium, 2010

A Simplex-Like Algorithm for Fisher Markets.
Proceedings of the Algorithmic Game Theory - Third International Symposium, 2010


  Loading...