Publications

(2023). Uncoupled and Convergent Learning in Two-Player Zero-Sum Markov Games. The 37th Conference on Neural Information Processing Systems (NeurIPS).

arxiv

(2023). Simultaneous Auctions are Approximately Revenue-Optimal for Subadditive Bidders. Proceedings of the 64th IEEE Symposium on Foundations of Computer Science (FOCS).

PDF arxiv

(2023). Doubly Optimal No-Regret Learning in Monotone Games. The 40th International Conference on Machine Learning (ICML).

PDF arxiv

(2023). Nearly Optimal Committee Selection For Bias Minimization. Proceedings of the 24th ACM Conference on Economics and Computation (EC).

PDF arxiv

(2023). On the Optimal Fixed-Price Mechanism in Bilateral Trade. Proceedings of the 55th Annual ACM SIGACT Symposium on Theory of Computing (STOC).

PDF arxiv

(2023). Accelerated Single-Call Methods for Constrained Min-Max Optimization. The 11th International Conference on Learning Representations (ICLR).

PDF arxiv

(2022). Finite-Time Last-Iterate Convergence for Learning in Multi-Player Games. The 36th Conference on Neural Information Processing Systems [NeurIPS Oral].

PDF Video

(2022). Recommender Systems meet Mechanism Design. Proceedings of the 23rd ACM Conference on Economics and Computation (EC).

PDF DOI arxiv

(2022). Is Selling Complete Information (Approximately) Optimal?. Proceedings of the 23rd ACM Conference on Economics and Computation (EC).

PDF DOI arxiv

(2022). Computing Simple Mechanisms: Lift-and-Round over Marginal Reduced Forms. Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing (STOC).

PDF DOI arxiv

(2021). On Simple Mechanisms for Dependent Items. Proceedings of the 22nd ACM Conference on Economics and Computation (EC).

PDF DOI arXiv

(2021). On Multi-Dimensional Gains from Trade Maximization. Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA).

PDF DOI arXiv

(2021). How to Sell Information Optimally: An Algorithmic Study. 12th Innovations in Theoretical Computer Science Conference (ITCS).

PDF DOI arXiv

(2020). Third-Party Data Providers Ruin Simple Mechanisms. The 2020 SIGMETRICS/Performance Joint International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS).

PDF DOI arXiv

(2020). Third-Party Data Providers Ruin Simple Mechanisms. Proceedings of the ACM on Measurement and Analysis of Computing Systems.

PDF DOI

(2019). Simple Mechanisms for Profit Maximization in Multi-item Auctions. Proceedings of the 2019 ACM Conference on Economics and Computation (EC).

PDF DOI arXiv

(2018). Learning Safe Policies with Expert Guidance. Proceedings of the 32nd in Neural Information Processing Systems (NeurIPS).

PDF arXiv

(2017). Learning Multi-Item Auctions with (or without) Samples. 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).

PDF DOI arXiv

(2017). Simple mechanisms for subadditive buyers via duality. Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing (STOC).

PDF DOI arXiv SIGecom Exchange

(2017). Approximating Gains from Trade in Two-sided Markets via Simple Mechanisms. Proceedings of the 2017 ACM Conference on Economics and Computation (EC).

PDF DOI arXiv

(2016). A duality based unified approach to Bayesian mechanism design. Proceedings of the forty-eighth annual ACM symposium on Theory of Computing (STOC).

PDF DOI arXiv SIGecom Exchange

(2015). On the Economic Efficiency of the Combinatorial Clock Auction. Proceedings of the 2016 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA).

PDF DOI arXiv

(2014). Simultaneous bayesian auctions and computational complexity. Proceedings of the fifteenth ACM conference on Economics and computation (EC).

PDF DOI

(2013). Simple and Nearly Optimal Multi-Item Auctions. Proceedings of the 2013 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA).

PDF DOI arXiv

(2012). Can Nondeterminism Help Complementation?. Electronic Proceedings in Theoretical Computer Science.

PDF DOI arXiv

(2012). An Algorithmic Characterization of Multi-Dimensional Mechanisms. Proceedings of the forty-fourth annual ACM symposium on Theory of computing (STOC).

PDF DOI arXiv

(2011). Extreme-Value Theorems for Optimal Multidimensional Pricing. 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS).

PDF DOI arXiv

(2011). Tight Upper Bounds for Streett and Parity Complementation. Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL.

PDF DOI arXiv

(2011). On Minmax Theorems for Multiplayer Games. Proceedings of the 2011 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA).

PDF DOI

(2011). A Tight Lower Bound for Streett Complementation. IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS).

PDF DOI arXiv

(2009). API hyperlinking via structural overlap. Proceedings of the 7th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering (ESEC/FSE).

PDF DOI

(2009). An Improved Lower Bound for the Complementation of Rabin Automata. 2009 24th Annual IEEE Symposium on Logic In Computer Science (LICS).

PDF DOI