| Publication | Date of Publication | Type |
|---|
| Auction algorithms for market equilibrium with weak Gross substitute demands and their applications | 2026-04-21 | Paper |
EFX exists for three agents
Journal of the ACM | 2025-02-05 | Paper |
Improving envy freeness up to any good guarantees through rainbow cycle number
Mathematics of Operations Research | 2025-01-28 | Paper |
| Breaking the 3/4 barrier for approximate maximin share | 2024-11-28 | Paper |
| Approximating maximin share allocations | 2024-08-26 | Paper |
| Approximating equilibrium under constrained piecewise linear concave utilities with applications to matching markets | 2024-07-19 | Paper |
Satiation in Fisher markets and approximation of Nash social welfare
Mathematics of Operations Research | 2024-06-27 | Paper |
| Approximating Nash social welfare by matching and local search | 2024-05-08 | Paper |
| scientific article; zbMATH DE number 7829273 (Why is no real title available?) | 2024-04-09 | Paper |
A Strongly Polynomial Algorithm for Linear Exchange Markets
Operations Research | 2024-03-12 | Paper |
A Complementary Pivot Algorithm for Competitive Allocation of a Mixed Manna
Mathematics of Operations Research | 2024-02-27 | Paper |
scientific article; zbMATH DE number 7799600 (Why is no real title available?)
(available as arXiv preprint) | 2024-02-05 | Paper |
scientific article; zbMATH DE number 7788423 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
Approximating Nash social welfare under rado valuations
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
Approximating Nash social welfare under rado valuations
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
Approximating Nash Social Welfare under Submodular Valuations through (Un)Matchings
ACM Transactions on Algorithms | 2023-10-23 | Paper |
Computing fair and efficient allocations with few utility values
Theoretical Computer Science | 2023-06-01 | Paper |
Fair Division of Indivisible Goods for a Class of Concave Valuations
Journal of Artificial Intelligence Research | 2022-08-02 | Paper |
On fair division for indivisible items
(available as arXiv preprint) | 2022-07-21 | Paper |
| Computing fair and efficient allocations with few utility values | 2022-06-01 | Paper |
| When dividing mixed manna is easier than dividing goods: competitive equilibria with a constant number of chores | 2022-06-01 | Paper |
An improved approximation algorithm for maximin shares
Artificial Intelligence | 2021-11-02 | Paper |
Limited-trust equilibria
European Journal of Operational Research | 2021-06-03 | Paper |
Approximating Nash Social Welfare under Submodular Valuations through (Un)Matchings
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Improving Nash social welfare approximations of indivisible goods
Journal of Artificial Intelligence Research | 2020-06-26 | Paper |
Substitution with satiation: a new class of utility functions and a complementary pivot algorithm
Mathematics of Operations Research | 2020-03-12 | Paper |
A strongly polynomial algorithm for linear exchange markets
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
A strongly polynomial algorithm for linear exchange markets
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
Ascending-price algorithms for unknown markets
ACM Transactions on Algorithms | 2019-11-25 | Paper |
| Network cost-sharing games: equilibrium computation and applications to election modeling | 2019-10-11 | Paper |
On computability of equilibria in markets with production
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
| A truthful mechanism for interval scheduling | 2018-11-08 | Paper |
An improved combinatorial polynomial algorithm for the linear Arrow-Debreu market
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
| Approximating the Nash social welfare with budget-additive valuations | 2018-03-15 | Paper |
| A new class of combinatorial markets with covering constraints: algorithms and applications | 2018-03-15 | Paper |
A new class of combinatorial markets with covering constraints: algorithms and applications
(available as arXiv preprint) | 2018-03-15 | Paper |
Computing equilibria in markets with budget-additive utilities
(available as arXiv preprint) | 2018-03-02 | Paper |
| Earning limits in Fisher markets with spending-constraint utilities | 2018-02-13 | Paper |
Market equilibrium under piecewise Leontief concave utilities
Theoretical Computer Science | 2017-11-07 | Paper |
Dichotomies in equilibrium computation and membership of PLC markets in FIXP
Theory of Computing | 2017-10-10 | Paper |
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-08-17 | Paper |
ETR-completeness for decision versions of multi-player (symmetric) Nash equilibria
Automata, Languages, and Programming | 2015-10-27 | Paper |
Dichotomies in equilibrium computation, and complementary pivot algorithms for a new class of non-separable utility functions
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
Market equilibrium under piecewise Leontief concave utilities. (Extended abstract)
Web and Internet Economics | 2015-01-07 | Paper |
