| Publication | Date of Publication | Type |
|---|
Information design in the principal-agent problem
Games and Economic Behavior | 2025-12-18 | Paper |
| Settling the communication complexity of combinatorial auctions with two subadditive buyers | 2025-08-12 | Paper |
Algorithmic contract theory: a survey
Foundations and Trends in Theoretical Computer Science | 2025-01-28 | Paper |
| Interdependent public projects | 2024-05-14 | Paper |
Multi-channel Bayesian persuasion
(available as arXiv preprint) | 2024-04-09 | Paper |
Technical Note—Incomplete Information VCG Contracts for Common Agency
Operations Research | 2024-03-20 | Paper |
Regret-minimizing Bayesian persuasion
Games and Economic Behavior | 2022-11-24 | Paper |
Auctions with interdependence and SOS: improved approximation
(available as arXiv preprint) | 2022-06-01 | Paper |
| Nearest Neighbor Classification and Search | 2022-02-04 | Paper |
When are welfare guarantees robust?
(available as arXiv preprint) | 2021-07-28 | Paper |
A simple and approximately optimal mechanism for a buyer with complements
Operations Research | 2021-06-17 | Paper |
Competitive equilibrium with indivisible goods and generic budgets
Mathematics of Operations Research | 2021-06-03 | Paper |
The complexity of contracts
SIAM Journal on Computing | 2021-03-24 | Paper |
The Complexity of Contracts
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Robust auctions for revenue via enhanced competition
Operations Research | 2021-01-08 | Paper |
Approximate modularity revisited
SIAM Journal on Computing | 2020-01-28 | Paper |
| Oblivious rounding and the integrality gap | 2018-04-19 | Paper |
Modularity and greed in double auctions
Games and Economic Behavior | 2017-10-24 | Paper |
Approximate modularity revisited
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
Prediction and welfare in ad auctions
Theory of Computing Systems | 2017-02-01 | Paper |
Welfare and revenue guarantees for competitive bundling equilibrium
Web and Internet Economics | 2016-01-08 | Paper |
Prediction and welfare in ad auctions
Algorithmic Game Theory | 2015-01-14 | Paper |
Vertex sparsifiers: new results from old techniques
SIAM Journal on Computing | 2014-11-14 | Paper |
Ad auctions with data
Algorithmic Game Theory | 2013-03-13 | Paper |
A direct reduction from k-player to 2-player approximate Nash equilibrium
Algorithmic Game Theory | 2010-10-19 | Paper |
Vertex Sparsifiers: New Results from Old Techniques
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2010-09-10 | Paper |
