| Publication | Date of Publication | Type |
|---|
An algorithmic framework for black-box reductions from Bayesian mechanism design to algorithm design
Journal of the ACM | 2026-06-03 | Paper |
| Approximately strategyproof tournament rules in the probabilistic setting | 2026-04-15 | Paper |
| Asynchronous majority dynamics in preferential attachment trees | 2026-03-18 | Paper |
| On the cut-query complexity of approximating max-cut | 2026-01-14 | Paper |
| Simple and optimal online contention resolution schemes for k-uniform matroids | 2025-11-04 | Paper |
| Approximation schemes for a unit-demand buyer with independent items via symmetries | 2025-08-12 | Paper |
| The sample complexity of up-to- multi-dimensional revenue maximization | 2025-08-12 | Paper |
| A simple and approximately optimal mechanism for an additive buyer | 2025-08-05 | Paper |
| Understanding incentives: mechanism design becomes algorithm design | 2025-05-20 | Paper |
| Optimal multi-dimensional mechanism design: reducing revenue to welfare maximization | 2025-05-05 | Paper |
| To regulate or not to regulate: using revenue maximization tools to maximize consumer utility | 2025-01-31 | Paper |
| An improved lower bound for matroid intersection prophet inequalities | 2024-09-25 | Paper |
| Optimal stopping with multi-dimensional comparative loss aversion | 2024-09-20 | Paper |
| Selling to multiple no-regret buyers | 2024-09-20 | Paper |
Optimal item pricing in online combinatorial auctions
Mathematical Programming. Series A. Series B | 2024-08-20 | Paper |
scientific article; zbMATH DE number 7829298 (Why is no real title available?)
(available as arXiv preprint) | 2024-04-09 | Paper |
Exponential communication separations between notions of selfishness
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
Tight bounds on 3-team manipulations in randomized death match
Web and Internet Economics | 2023-08-04 | Paper |
New Query Lower Bounds for Submodular Function Minimization
(available as arXiv preprint) | 2023-02-03 | Paper |
scientific article; zbMATH DE number 7650408 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-03 | Paper |
Implementation in Advised Strategies: Welfare Guarantees from Posted-Price Mechanisms when Demand Queries are NP-hard
(available as arXiv preprint) | 2023-02-03 | Paper |
scientific article; zbMATH DE number 7650351 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-03 | Paper |
The Sample Complexity of Up-to-ε Multi-dimensional Revenue Maximization
Journal of the ACM | 2022-12-08 | Paper |
| Optimal item pricing in online combinatorial auctions | 2022-08-16 | Paper |
scientific article; zbMATH DE number 7559048 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-18 | Paper |
| On symmetries in multi-dimensional mechanism design | 2022-07-06 | Paper |
Formal barriers to simple algorithms for the matroid secretary problem
(available as arXiv preprint) | 2022-07-06 | Paper |
Separating the communication complexity of truthful and nontruthful algorithms for combinatorial auctions
SIAM Journal on Computing | 2022-04-20 | Paper |
A Duality-Based Unified Approach to Bayesian Mechanism Design
SIAM Journal on Computing | 2021-06-29 | Paper |
A simple and approximately optimal mechanism for a buyer with complements
Operations Research | 2021-06-17 | Paper |
Computing exact minimum cuts without knowing the graph
(available as arXiv preprint) | 2021-06-15 | Paper |
Separating the communication complexity of truthful and non-truthful combinatorial auctions
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
A Simple and Approximately Optimal Mechanism for an Additive Buyer
Journal of the ACM | 2020-11-11 | Paper |
Persuasion and incentives through the lens of duality
(available as arXiv preprint) | 2020-06-30 | Paper |
Optimal (and benchmark-optimal) competition complexity for additive buyers over independent items
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
Optimal (and benchmark-optimal) competition complexity for additive buyers over independent items
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
Prior independent mechanisms via prophet inequalities with limited information
Games and Economic Behavior | 2019-12-12 | Paper |
Prophet Inequalities with Limited Information
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Optimal and Efficient Parametric Auctions
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
Reducing Revenue to Welfare Maximization: Approximation Algorithms and other Generalizations
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
Matroid prophet inequalities and applications to multi-dimensional mechanism design
Games and Economic Behavior | 2019-03-29 | Paper |
Interpolating between truthful and non-truthful mechanisms for combinatorial auctions
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Condorcet-consistent and approximately strategyproof tournament rules
(available as arXiv preprint) | 2018-05-03 | Paper |
| The menu complexity of ``one-and-a-half-dimensional'' mechanism design | 2018-03-15 | Paper |
The menu complexity of ``one-and-a-half-dimensional'' mechanism design
(available as arXiv preprint) | 2018-03-15 | Paper |
| On simultaneous two-player combinatorial auctions | 2018-03-15 | Paper |
On simultaneous two-player combinatorial auctions
(available as arXiv preprint) | 2018-03-15 | Paper |
Bayesian truthful mechanisms for job scheduling from bi-criterion approximation algorithms
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
Bayesian truthful mechanisms for job scheduling from bi-criterion approximation algorithms
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
A duality based unified approach to Bayesian mechanism design
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
Parallel algorithms for select and partition with noisy comparisons
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
Reaching consensus via non-Bayesian asynchronous learning in social networks
(available as arXiv preprint) | 2017-03-22 | Paper |
Pricing lotteries
Journal of Economic Theory | 2015-02-13 | Paper |
| Pricing randomized allocations | 2014-05-22 | Paper |
Matroid prophet inequalities
Proceedings of the forty-fourth annual ACM symposium on Theory of computing | 2014-05-13 | Paper |
An algorithmic characterization of multi-dimensional mechanisms
Proceedings of the forty-fourth annual ACM symposium on Theory of computing | 2014-05-13 | Paper |
