Jugal Garg

J. ACM, 2024

Weighted EF1 and PO Allocations with Few Types of Agents or Chores.

[BibT_eX]

[DOI]

CoRR, 2024

Approximating Competitive Equilibrium by Nash Welfare.

[BibT_eX]

[DOI]

Yixin Tao

CoRR, 2024

Breaking the 3/4 Barrier for Approximate Maximin Share.

[BibT_eX]

[DOI]

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023

Approximating Nash Social Welfare under Submodular Valuations through (Un)Matchings.

[BibT_eX]

[DOI]

Pooja Kulkarni

Rucha Kulkarni

ACM Trans. Algorithms, October, 2023

A Complementary Pivot Algorithm for Competitive Allocation of a Mixed Manna.

[BibT_eX]

[DOI]

Math. Oper. Res., August, 2023

Computing fair and efficient allocations with few utility values.

[BibT_eX]

[DOI]

Theor. Comput. Sci., June, 2023

A Strongly Polynomial Algorithm for Linear Exchange Markets.

[BibT_eX]

[DOI]

Oper. Res., March, 2023

Competitive Equilibria with a Constant Number of Chores.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2023

Improving Approximation Guarantees for Maximin Share.

[BibT_eX]

[DOI]

Setareh Taki

CoRR, 2023

Approximating Nash Social Welfare by Matching and Local Search.

[BibT_eX]

[DOI]

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

EFX: A Simpler Approach and an (Almost) Optimal Guarantee via Rainbow Cycle Number.

[BibT_eX]

[DOI]

Noga Alon

Proceedings of the 24th ACM Conference on Economics and Computation, 2023

New Algorithms for the Fair and Efficient Allocation of Indivisible Chores.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

New Fairness Concepts for Allocating Indivisible Items.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

Simplification and Improvement of MMS Approximation.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

Fair and Efficient Allocation of Indivisible Chores with Surplus.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

A Nash-Bargaining-Based Mechanism for One-Sided Matching Markets and Dichotomous Utilities.

[BibT_eX]

[DOI]

Thorben Tröbst

Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

2022

Prize Collecting Multiagent Orienteering: Price of Anarchy Bounds and Solution Methods.

[BibT_eX]

[DOI]

IEEE Trans Autom. Sci. Eng., 2022

Fair Division of Indivisible Goods for a Class of Concave Valuations.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2022

Improving Fairness and Efficiency Guarantees for Allocating Indivisible Chores.

[BibT_eX]

[DOI]

CoRR, 2022

Existence and Computation of Epistemic EFX.

[BibT_eX]

[DOI]

Eklavya Sharma

CoRR, 2022

EFX Allocations: Simplifications and Improvements.

[BibT_eX]

[DOI]

CoRR, 2022

Computing Pareto-Optimal and Almost Envy-Free Allocations of Indivisible Goods.

[BibT_eX]

[DOI]

CoRR, 2022

Tractable Fragments of the Maximum Nash Welfare Problem.

[BibT_eX]

[DOI]

Proceedings of the Web and Internet Economics - 18th International Conference, 2022

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

[BibT_eX]

[DOI]

Yixin Tao

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Competitive Equilibrium with Chores: Combinatorial Algorithm and Hardness.

[BibT_eX]

[DOI]

Proceedings of the EC '22: The 23rd ACM Conference on Economics and Computation, Boulder, CO, USA, July 11, 2022

On the Existence of Competitive Equilibrium with Chores.

[BibT_eX]

[DOI]

Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

One-Sided Matching Markets with Endowments: Equilibria and Algorithms.

[BibT_eX]

[DOI]

Thorben Tröbst

Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, 2022

Fair and Efficient Allocations of Chores under Bivalued Preferences.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021

Approximating nash social welfare under rado valuations.

[BibT_eX]

[DOI]

Edin Husic

SIGecom Exch., 2021

Fast Algorithms for Rank-1 Bimatrix Games.

[BibT_eX]

[DOI]

Oper. Res., 2021

Limited-trust equilibria.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2021

Trust in Social Network Games.

[BibT_eX]

[DOI]

CoRR, 2021

An improved approximation algorithm for maximin shares.

[BibT_eX]

[DOI]

Setareh Taki

Artif. Intell., 2021

Auction Algorithms for Market Equilibrium with Weak Gross Substitute Demands and Their Applications.

[BibT_eX]

[DOI]

Edin Husic

Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021

Competitive Allocation of a Mixed Manna.

[BibT_eX]

[DOI]

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Improving EFX Guarantees through Rainbow Cycle Number.

[BibT_eX]

[DOI]

Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 2021

When Dividing Mixed Manna Is Easier Than Dividing Goods: Competitive Equilibria with a Constant Number of Chores.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory - 14th International Symposium, 2021

On Fair and Efficient Allocations of Indivisible Public Goods.

[BibT_eX]

[DOI]

Pooja Kulkarni

Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2021

On Fair and Efficient Allocations of Indivisible Goods.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

Fair and Efficient Allocations under Subadditive Valuations.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Omkar Thakoor

IEEE Trans Autom. Sci. Eng., 2020

Improving Nash Social Welfare Approximations.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2020

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

[BibT_eX]

[DOI]

Thorben Tröbst

CoRR, 2020

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

[BibT_eX]

[DOI]

CoRR, 2020

Computing Competitive Equilibria with Mixed Manna.

[BibT_eX]

[DOI]

Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020

2019

Earning and Utility Limits in Fisher Markets.

[BibT_eX]

[DOI]

ACM Trans. Economics and Comput., 2019

Ascending-Price Algorithms for Unknown Markets.

[BibT_eX]

[DOI]

Xiaohui Bei

Martin Hoefer

ACM Trans. Algorithms, 2019

Auction Algorithms for Market Equilibrium with Weak Gross Substitute Demands.

[BibT_eX]

[DOI]

Edin Husic

CoRR, 2019

Approximating Maximin Share Allocations.

[BibT_eX]

[DOI]

Setareh Taki

Proceedings of the 2nd Symposium on Simplicity in Algorithms, 2019

2018

∃R-Completeness for Decision Versions of Multi-Player (Symmetric) Nash Equilibria.

[BibT_eX]

[DOI]

ACM Trans. Economics and Comput., 2018

Substitution with Satiation: A New Class of Utility Functions and a Complementary Pivot Algorithm.

[BibT_eX]

[DOI]

Math. Oper. Res., 2018

On Fair Division of Indivisible Items.

[BibT_eX]

[DOI]

CoRR, 2018

Approximating the Nash Social Welfare with Budget-Additive Valuations.

[BibT_eX]

[DOI]

Martin Hoefer

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.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

A Truthful Mechanism for Interval Scheduling.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory - 11th International Symposium, 2018

On Fair Division for Indivisible Items.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Rahul Swamy

Proceedings of the Combinatorial Optimization and Applications, 2018

2017

Market equilibrium under piecewise Leontief concave utilities.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Settling the complexity of Leontief and PLC exchange markets under exact and approximate equilibria.

[BibT_eX]

[DOI]

Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

Earning Limits in Fisher Markets with Spending-Constraint Utilities.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory - 10th International Symposium, 2017

2016

Dichotomies in Equilibrium Computation and Membership of PLC Markets in FIXP.

[BibT_eX]

[DOI]

Theory Comput., 2016

A Rational Convex Program for Linear Arrow-Debreu Markets.

[BibT_eX]

[DOI]

Nikhil R. Devanur

ACM Trans. Economics and Comput., 2016

An Improved Combinatorial Polynomial Algorithm for the Linear Arrow-Debreu Market.

[BibT_eX]

[DOI]

Ran Duan

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Computing Equilibria in Markets with Budget-Additive Utilities.

[BibT_eX]

[DOI]

Proceedings of the 24th Annual European Symposium on Algorithms, 2016

Learning Market Parameters Using Aggregate Demand Queries.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015

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

[BibT_eX]

[DOI]

SIAM J. Comput., 2015

A Market for Scheduling, with Applications to Cloud Computing.

[BibT_eX]

[DOI]

CoRR, 2015

Tatonnement for Linear and Gross Substitutes Markets.

[BibT_eX]

[DOI]

Xiaohui Bei

Martin Hoefer

CoRR, 2015

Markets with Production: A Polynomial Time Algorithm and a Reduction to Pure Exchange.

[BibT_eX]

[DOI]

Ravi Kannan

Proceedings of the Sixteenth ACM Conference on Economics and Computation, 2015

ETR-Completeness for Decision Versions of Multi-player (Symmetric) Nash Equilibria.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

CoRR, 2014

Market Equilibrium under Piecewise Leontief Concave Utilities - [Extended Abstract].

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Theory of Computing, 2014

On Computability of Equilibria in Markets with Production.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

2013

Towards Polynomial Simplex-Like Algorithms for Market Equlibria.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

2011

Bilinear Games: Polynomial Time Algorithms for Rank Based Subclasses.

[BibT_eX]

[DOI]

Albert Xin Jiang