| Publication | Date of Publication | Type |
|---|
| Tight approximation guarantees for concave coverage problems | 2026-04-21 | Paper |
| Sublinear approximation algorithm for Nash social welfare with XOS valuations | 2025-11-04 | Paper |
| Approximation algorithms for envy-free cake division with connected pieces | 2024-11-14 | Paper |
The Edgeworth Conjecture with Small Coalitions and Approximate Equilibria in Large Economies
Mathematics of Operations Research | 2024-02-23 | Paper |
The Edgeworth Conjecture with Small Coalitions and Approximate Equilibria in Large Economies
Mathematics of Operations Research | 2024-02-23 | Paper |
Nash welfare guarantees for fair and efficient coverage
Web and Internet Economics | 2023-08-04 | Paper |
Nash welfare guarantees for fair and efficient coverage
Web and Internet Economics | 2023-08-04 | Paper |
Optimal bounds on the price of fairness for indivisible goods
(available as arXiv preprint) | 2023-03-21 | Paper |
scientific article; zbMATH DE number 7651150 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-07 | Paper |
Tight approximation bounds for maximum multi-coverage
Integer Programming and Combinatorial Optimization | 2022-10-14 | Paper |
Fair Cake Division Under Monotone Likelihood Ratios
Mathematics of Operations Research | 2022-09-26 | Paper |
Fully polynomial-time approximation schemes for fair rent division
Mathematics of Operations Research | 2022-09-26 | Paper |
Approximating Nash social welfare under binary XOS and binary subadditive valuations
(available as arXiv preprint) | 2022-07-06 | Paper |
Tight approximation bounds for maximum multi-coverage
Mathematical Programming. Series A. Series B | 2022-03-22 | Paper |
Fair and efficient cake division with connected pieces
(available as arXiv preprint) | 2020-06-30 | Paper |
Fully polynomial-time approximation schemes for fair rent division
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Traffic-redundancy aware network design
(available as arXiv preprint) | 2019-05-10 | Paper |
| Traffic-redundancy aware network design | 2019-05-10 | Paper |
| Packing multiway cuts in capacitated graphs | 2019-05-06 | Paper |
Approximating Nash equilibria and dense subgraphs via an approximate version of Carathéodory's theorem
SIAM Journal on Computing | 2018-07-04 | Paper |
Algorithmic Aspects of Optimal Channel Coding
IEEE Transactions on Information Theory | 2018-06-27 | Paper |
Algorithmic aspects of private Bayesian persuasion
(available as arXiv preprint) | 2018-05-03 | Paper |
Decomposition Methods for Large Scale LP Decoding
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Empirical distribution of equilibrium play and its testing application
Mathematics of Operations Research | 2017-04-13 | Paper |
Network design with coverage costs
(available as arXiv preprint) | 2017-03-22 | Paper |
Approximating Nash equilibria in tree polymatrix games
Algorithmic Game Theory | 2015-11-04 | Paper |
Approximating Nash equilibria in tree polymatrix games
Algorithmic Game Theory | 2015-11-04 | Paper |
Approximating Nash equilibria and dense bipartite subgraphs via an approximate version of Carathéodory's theorem
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
On the Existence of Low-Rank Explanations for Mixed Strategy Behavior
Web and Internet Economics | 2015-01-07 | Paper |
On the Existence of Low-Rank Explanations for Mixed Strategy Behavior
Web and Internet Economics | 2015-01-07 | Paper |
| Region growing for multi-route cuts | 2014-05-22 | Paper |
Secretary problems with convex costs
Automata, Languages, and Programming | 2013-08-12 | Paper |
A bicriteria approximation for the reordering buffer problem
Algorithms – ESA 2012 | 2012-09-25 | Paper |
