| Publication | Date of Publication | Type |
|---|
| The outer limits of contention resolution on matroids and connections to the secretary problem | 2026-03-18 | Paper |
| On supermodular contracts and dense subgraphs | 2024-11-28 | Paper |
| On sparsification of stochastic packing problems | 2024-11-14 | Paper |
scientific article; zbMATH DE number 7829290 (Why is no real title available?)
(available as arXiv preprint) | 2024-04-09 | Paper |
| Bayesian repeated zero-sum games with persistent state, with application to security games | 2023-03-21 | Paper |
Bernoulli Factories and Black-box Reductions in Mechanism Design
Journal of the ACM | 2022-12-08 | Paper |
Alea iacta est: auctions, persuasion, interim rules, and dice
(available as arXiv preprint) | 2022-07-18 | Paper |
Algorithmic Bayesian persuasion
SIAM Journal on Computing | 2021-06-29 | Paper |
Persuasion and incentives through the lens of duality
(available as arXiv preprint) | 2020-06-30 | Paper |
On the hardness of designing public signals
Games and Economic Behavior | 2019-12-12 | Paper |
Constrained signaling in auction design
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Optimal Mechanisms for Combinatorial Auctions and Combinatorial Public Projects via Convex Rounding
Journal of the ACM | 2018-08-02 | Paper |
Algorithmic Bayesian persuasion
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
Bernoulli factories and black-box reductions in mechanism design
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
Algorithmic signaling of features in auction design
Algorithmic Game Theory | 2015-11-04 | Paper |
Limitations of randomized mechanisms for combinatorial auctions
Games and Economic Behavior | 2015-08-12 | Paper |
Sampling and Representation Complexity of Revenue Maximization
Web and Internet Economics | 2015-01-07 | Paper |
Limitations of randomized mechanisms for combinatorial auctions
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
On the Power of Randomization in Algorithmic Mechanism Design
2009 50th Annual IEEE Symposium on Foundations of Computer Science | 2014-07-25 | Paper |
From convex optimization to randomized mechanisms
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
Black-box randomized reductions in algorithmic mechanism design
SIAM Journal on Computing | 2014-06-04 | Paper |
| Inapproximability for VCG-based combinatorial auctions | 2014-05-22 | Paper |
On the power of randomization in algorithmic mechanism design
SIAM Journal on Computing | 2014-04-11 | Paper |
Revenue submodularity
Theory of Computing | 2012-09-27 | Paper |
Truthful approximation schemes for single-parameter agents
SIAM Journal on Computing | 2011-10-18 | Paper |
