| Publication | Date of Publication | Type |
|---|
Welfare loss in connected resource allocation
Discrete Applied Mathematics | 2026-03-19 | Paper |
The incentive guarantees behind Nash welfare in divisible resources allocation
Artificial Intelligence | 2025-05-30 | Paper |
Fair division with subjective divisibility
Games and Economic Behavior | 2025-04-11 | Paper |
Truthful cake sharing
Social Choice and Welfare | 2025-03-11 | Paper |
Dividing a graphical cake
SIAM Journal on Discrete Mathematics | 2025-01-22 | Paper |
| Auction design for bidders with ex post ROI constraints | 2024-09-20 | Paper |
Approval-based voting with mixed goods
Social Choice and Welfare | 2024-07-29 | Paper |
| Bidder subset selection problem in auction design | 2024-05-14 | Paper |
Fair and efficient multi-resource allocation for cloud computing
Web and Internet Economics | 2023-08-04 | Paper |
| From Independent Sets and Vertex Colorings to Isotropic Spaces and Isotropic Decompositions: Another Bridge Between Graphs and Alternating Matrix Spaces. | 2023-02-03 | Paper |
| Heterogeneous multi-commodity network flows over time | 2022-11-11 | Paper |
The price of connectivity in fair division
SIAM Journal on Discrete Mathematics | 2022-06-03 | Paper |
Fair division of mixed divisible and indivisible goods
Artificial Intelligence | 2021-11-02 | Paper |
The price of fairness for indivisible goods
Theory of Computing Systems | 2021-09-28 | Paper |
From independent sets and vertex colorings to isotropic spaces and isotropic decompositions: another bridge between graphs and alternating matrix spaces
SIAM Journal on Computing | 2021-06-22 | Paper |
Truthful fair division without free disposal
Social Choice and Welfare | 2021-01-06 | Paper |
Ascending-price algorithms for unknown markets
ACM Transactions on Algorithms | 2019-11-25 | Paper |
Correlation-robust analysis of single item auction
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
From independent sets and vertex colorings to isotropic spaces and isotropic decompositions
(available as arXiv preprint) | 2019-04-08 | 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 |
| Bayesian incentive compatibility via fractional assignments | 2017-09-29 | Paper |
Worst-case mechanism design via Bayesian analysis
SIAM Journal on Computing | 2017-08-18 | Paper |
Solving linear programming with constraints unknown
Automata, Languages, and Programming | 2015-10-27 | Paper |
On the complexity of trial and error
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
Budget feasible mechanism design, from prior-free to Bayesian
Proceedings of the forty-fourth annual ACM symposium on Theory of computing | 2014-05-13 | Paper |
Bounded budget betweenness centrality game for strategic network formations
Theoretical Computer Science | 2012-01-04 | Paper |
Bounded Budget Betweenness Centrality Game for Strategic Network Formations
Lecture Notes in Computer Science | 2009-10-29 | Paper |
