Jieming Mao

Balasubramanian Sivan

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Regret Minimization with Noisy Observations.

[BibT_eX]

[DOI]

Mohammad Mahdian

Proceedings of the 24th ACM Conference on Economics and Computation, 2023

Differentially Private Continual Releases of Streaming Frequency Moment Estimations.

[BibT_eX]

[DOI]

Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

2022

Exponential Separations in Local Privacy.

[BibT_eX]

[DOI]

Aaron Roth

ACM Trans. Algorithms, 2022

Efficiency of the First-Price Auction in the Autobidding World.

[BibT_eX]

[DOI]

CoRR, 2022

Approximately efficient bilateral trade.

[BibT_eX]

[DOI]

Yuan Deng

Balasubramanian Sivan

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Optimal Mechanisms for Value Maximizers with Budget Constraints via Target Clipping.

[BibT_eX]

[DOI]

Proceedings of the EC '22: The 23rd ACM Conference on Economics and Computation, Boulder, CO, USA, July 11, 2022

Interactive Communication in Bilateral Trade.

[BibT_eX]

[DOI]

Renato Paes Leme

Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

Shuffle Private Stochastic Convex Optimization.

[BibT_eX]

[DOI]

Proceedings of the Tenth International Conference on Learning Representations, 2022

2021

Combinatorial Assortment Optimization.

[BibT_eX]

[DOI]

ACM Trans. Economics and Comput., 2021

Towards Efficient Auctions in an Auto-bidding World.

[BibT_eX]

[DOI]

Proceedings of the WWW '21: The Web Conference 2021, 2021

Connecting Robust Shuffle Privacy and Pan-Privacy.

[BibT_eX]

[DOI]

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Welfare-maximizing Guaranteed Dashboard Mechanisms.

[BibT_eX]

[DOI]

Yuan Deng

Jason D. Hartline

Balasubramanian Sivan

Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 2021

The Landscape of Auto-bidding Auctions: Value versus Utility Maximization.

[BibT_eX]

[DOI]

Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 2021

Robust Auction Design in the Auto-bidding World.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

2020

Exponential Separations in Local Differential Privacy.

[BibT_eX]

[DOI]

Aaron Roth

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Incentivizing Exploration with Selective Data Disclosure.

[BibT_eX]

[DOI]

Proceedings of the EC '20: The 21st ACM Conference on Economics and Computation, 2020

Smoothly Bounding User Contributions in Differential Privacy.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Pan-Private Uniformity Testing.

[BibT_eX]

[DOI]

Kareem Amin

Proceedings of the Conference on Learning Theory, 2020

2019

Exponential Separations in Local Differential Privacy Through Communication Complexity.

[BibT_eX]

[DOI]

Aaron Roth

CoRR, 2019

Diversity and Exploration in Social Learning.

[BibT_eX]

[DOI]

Nicole Immorlica

Christos Tzamos

Proceedings of the World Wide Web Conference, 2019

Bayesian Exploration with Heterogeneous Agents.

[BibT_eX]

[DOI]

Proceedings of the World Wide Web Conference, 2019

Locally Private Gaussian Estimation.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Differentially Private Fair Learning.

[BibT_eX]

[DOI]

Saeed Sharifi-Malvajerdi

Jonathan R. Ullman

Proceedings of the 36th International Conference on Machine Learning, 2019

The Role of Interactivity in Local Differential Privacy.

[BibT_eX]

[DOI]

Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

Multi-armed Bandit Problems with Strategic Arms.

[BibT_eX]

[DOI]

Proceedings of the Conference on Learning Theory, 2019

Sorted Top-k in Rounds.

[BibT_eX]

[DOI]

Yuval Peres

Proceedings of the Conference on Learning Theory, 2019

2018

Algorithms in Strategic or Noisy Environments

[BibT_eX]

[DOI]

PhD thesis, 2018

Optimal Instance Adaptive Algorithm for the Top-K Ranking Problem.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

Near-Optimal Bounds on the Bounded-Round Quantum Communication Complexity of Disjointness.

[BibT_eX]

[DOI]

SIAM J. Comput., 2018

Incentivizing Exploration with Unbiased Histories.

[BibT_eX]

[DOI]

CoRR, 2018

A Nearly Instance Optimal Algorithm for Top-<i>k</i> Ranking under the Multinomial Logit Model.

[BibT_eX]

[DOI]

Xi Chen

Yuanzhi Li

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

On Simultaneous Two-player Combinatorial Auctions.

[BibT_eX]

[DOI]

S. Matthew Weinberg

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Selling to a No-Regret Buyer.

[BibT_eX]

[DOI]

Proceedings of the 2018 ACM Conference on Economics and Computation, 2018

Contextual Pricing for Lipschitz Buyers.

[BibT_eX]

[DOI]

Renato Paes Leme

Jon Schneider

Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

2017

Coding for Interactive Communication Correcting Insertions and Deletions.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2017

A Nearly Instance Optimal Algorithm for Top-k Ranking under the Multinomial Logit Model.

[BibT_eX]

[DOI]

Xi Chen

Yuanzhi Li

CoRR, 2017

Competitive analysis of the top-<i>K</i> ranking problem.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

2016

Competitive analysis of the top-K ranking problem.

[BibT_eX]

[DOI]

CoRR, 2016

Parallel algorithms for select and partition with noisy comparisons.

[BibT_eX]

[DOI]

S. Matthew Weinberg

Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016

Interpolating Between Truthful and non-Truthful Mechanisms for Combinatorial Auctions.

[BibT_eX]

[DOI]

S. Matthew Weinberg

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

2014

Simulating Noisy Channel Interaction.

[BibT_eX]

[DOI]