2025
Online Fair Division: Towards Ex-Post Constant MMS Guarantees.
CoRR, March, 2025
EFX: A Simpler Approach and an (Almost) Optimal Guarantee via Rainbow Cycle Number.
Oper. Res., 2025
Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025
2024
Improving Envy Freeness up to Any Good Guarantees Through Rainbow Cycle Number.
Math. Oper. Res., 2024
Fair Division: Algorithms, Solution Concepts, and Applications (Dagstuhl Seminar 24401).
Dagstuhl Reports, 2024
Minimization I.I.D. Prophet Inequality via Extreme Value Theory: A Unified Approach.
CoRR, 2024
On the structure of envy-free orientations on graphs.
CoRR, 2024
Minimization is Harder in the Prophet World.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024
Competitive Equilibrium for Chores: from Dual Eisenberg-Gale to a Fast, Greedy, LP-based Algorithm.
Proceedings of the 25th ACM Conference on Economics and Computation, 2024
Fair Federated Learning via the Proportional Veto Core.
Proceedings of the Forty-first International Conference on Machine Learning, 2024
On the existence of EFX under picky or non-differentiative agents.
Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, 2024
Approximating APS Under Submodular and XOS Valuations with Binary Marginals.
Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, 2024
1/2-Approximate MMS Allocation for Separable Piecewise Linear Concave Valuations.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024
2023
A Complementary Pivot Algorithm for Competitive Allocation of a Mixed Manna.
Math. Oper. Res., August, 2023
Incentives in Federated Learning: Equilibria, Dynamics, and Mechanisms for Welfare Maximization.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023
Fair and Efficient Allocation of Indivisible Chores with Surplus.
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023
Maximin Share Allocations for Assignment Valuations.
Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023
2022
Introduction to the Special Issue on WINE'20: Part 1.
ACM Trans. Economics and Comput., 2022
Nash Social Welfare Approximation for Strategic Agents.
Oper. Res., 2022
On the Envy-free Allocation of Chores.
CoRR, 2022
Prophet Inequalities for Cost Minimization.
CoRR, 2022
EFX Allocations: Simplifications and Improvements.
CoRR, 2022
Online revenue maximization for server pricing.
Auton. Agents Multi Agent Syst., 2022
Polynomial Time Algorithms to Find an Approximate Competitive Equilibrium for Chores.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022
Competitive Equilibrium with Chores: Combinatorial Algorithm and Hardness.
Proceedings of the EC '22: The 23rd ACM Conference on Economics and Computation, Boulder, CO, USA, July 11, 2022
Fairness in Federated Learning via Core-Stability.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022
On the Existence of Competitive Equilibrium with Chores.
Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022
(Almost) Envy-Free, Proportional and Efficient Allocations of an Indivisible Mixed Manna.
Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, 2022
2021
Fast Algorithms for Rank-1 Bimatrix Games.
Oper. Res., 2021
Competitive Allocation of a Mixed Manna.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021
Indivisible Mixed Manna: On the Computability of MMS+PO Allocations.
Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 2021
Improving EFX Guarantees through Rainbow Cycle Number.
Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 2021
On the PTAS for Maximin Shares in an Indivisible Mixed Manna.
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
An incentive compatible, efficient market for air traffic flow management.
Theor. Comput. Sci., 2020
Unique end of potential line.
J. Comput. Syst. Sci., 2020
Dividing Bads is Harder than Dividing Goods: On the Complexity of Fair and Efficient Division of Chores.
CoRR, 2020
Approximating Maximin Shares with Mixed Manna.
CoRR, 2020
Smoothed Efficient Algorithms and Reductions for Network Coordination Games.
Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020
Approximate Nash Equilibria of Imitation Games: Algorithms and Complexity.
Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020
2019
Multiclass Performance Metric Elicitation.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019
Performance Metric Elicitation from Pairwise Classifier Comparisons.
Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, 2019
2018
∃R-Completeness for Decision Versions of Multi-Player (Symmetric) Nash Equilibria.
ACM Trans. Economics and Comput., 2018
Constant Rank Two-Player Games are PPAD-hard.
SIAM J. Comput., 2018
Substitution with Satiation: A New Class of Utility Functions and a Complementary Pivot Algorithm.
Math. Oper. Res., 2018
Sum-of-Squares meets Nash: Optimal Lower Bounds for Finding any Equilibrium.
Electron. Colloquium Comput. Complex., 2018
Nash Equilibrium in Smoothed Polynomial Time for Network Coordination Games.
CoRR, 2018
Resource Allocation Game on Social Networks: Best Response Dynamics and Convergence.
CoRR, 2018
Eliciting Binary Performance Metrics.
CoRR, 2018
Social Welfare and Profit Maximization from Revealed Preferences.
Proceedings of the Web and Internet Economics - 14th International Conference, 2018
Sum-of-squares meets nash: lower bounds for finding any equilibrium.
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 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
Universal Growth in Production Economies.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018
Maximizing Profit with Convex Costs in the Random-order Model.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018
Nash Equilibrium Computation in Resource Allocation Games.
Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018
2017
CLS: New Problems and Completeness.
CoRR, 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
Mutation, Sexual Reproduction and Survival in Dynamic Environments.
Proceedings of the 8th Innovations in Theoretical Computer Science Conference, 2017
2016
Dichotomies in Equilibrium Computation and Membership of PLC Markets in FIXP.
Theory Comput., 2016
To Give or not to Give: Fair Division for Strict Preferences.
CoRR, 2016
Proceedings of the Web and Internet Economics - 12th International Conference, 2016
To Give or Not to Give: Fair Division for Single Minded Valuations.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016
The Computational Complexity of Genetic Diversity.
Proceedings of the 24th Annual European Symposium on Algorithms, 2016
Get Me to My GATE on Time: Efficiently Solving General-Sum Bayesian Threat Screening Games.
Proceedings of the ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, 2016
2015
A Complementary Pivot Algorithm for Market Equilibrium under Separable, Piecewise-Linear Concave Utilities.
SIAM J. Comput., 2015
The game of survival: Sexual evolution in dynamic environments.
CoRR, 2015
A Market for Scheduling, with Applications to Cloud Computing.
CoRR, 2015
Settling Some Open Problems on 2-Player Symmetric Nash Equilibria.
Proceedings of the Algorithmic Game Theory - 8th International Symposium, 2015
Natural Selection as an Inhibitor of Genetic Diversity: Multiplicative Weights Updates Algorithm and a Conjecture of Haploid Genetics [Working Paper Abstract].
Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, 2015
ETR-Completeness for Decision Versions of Multi-player (Symmetric) Nash Equilibria.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015
2014
The Complexity of Genetic Diversity: Sex with Two Chromosomes is Advantageous but Unpredictable.
CoRR, 2014
Natural Selection as an Inhibitor of Genetic Diversity: Multiplicative Weights Updates Algorithm and a Conjecture of Haploid Genetics.
CoRR, 2014
Leontief Exchange Markets Can Solve Multivariate Polynomial Equations, Yielding FIXP and ETR Hardness.
CoRR, 2014
To Save Or Not To Save: The Fisher Game.
Proceedings of the Web and Internet Economics - 10th International Conference, 2014
Learning Economic Parameters from Revealed Preferences.
Proceedings of the Web and Internet Economics - 10th International Conference, 2014
Constant rank bimatrix games are PPAD-hard.
Proceedings of the Symposium on Theory of Computing, 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
2013
Exchange Markets: Strategy Meets Supply-Awareness - (Abstract).
Proceedings of the Web and Internet Economics - 9th International Conference, 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