Jieming Mao

According to our database, Jieming Mao authored at least 48 papers between 2013 and 2023.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2023

Non-uniform Bid-scaling and Equilibria for Different Auctions: An Empirical Study.

Yuan Deng, Jieming Mao, Vahab Mirrokni, Yifeng Teng, Song Zuo

CoRR, 2023

Efficiency of the Generalized Second-Price Auction for Value Maximizers.

Yuan Deng, Mohammad Mahdian, Jieming Mao, Vahab Mirrokni, Hanrui Zhang, Song Zuo

CoRR, 2023

Learning across Data Owners with Joint Differential Privacy.

Yangsibo Huang, Haotian Jiang, Daogao Liu, Mohammad Mahdian, Jieming Mao, Vahab Mirrokni

CoRR, 2023

Autobidding Auctions in the Presence of User Costs.

Yuan Deng, Jieming Mao, Vahab Mirrokni, Hanrui Zhang, Song Zuo

Proceedings of the ACM Web Conference 2023, 2023

Optimal Pricing Schemes for an Impatient Buyer.

Yuan Deng, Jieming Mao, Balasubramanian Sivan, Kangning Wang

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

Regret Minimization with Noisy Observations.

Mohammad Mahdian, Jieming Mao, Kangning Wang

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

Differentially Private Continual Releases of Streaming Frequency Moment Estimations.

Alessandro Epasto, Jieming Mao, Andres Muñoz Medina, Vahab Mirrokni, Sergei Vassilvitskii, Peilin Zhong

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

2022

Exponential Separations in Local Privacy.

Matthew Joseph, Jieming Mao, Aaron Roth

ACM Trans. Algorithms, 2022

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

Yuan Deng, Jieming Mao, Vahab Mirrokni, Hanrui Zhang, Song Zuo

CoRR, 2022

Approximately efficient bilateral trade.

Yuan Deng, Jieming Mao, Balasubramanian Sivan, Kangning Wang

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.

Santiago R. Balseiro, Yuan Deng, Jieming Mao, Vahab S. Mirrokni, Song Zuo

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

Interactive Communication in Bilateral Trade.

Jieming Mao, Renato Paes Leme, Kangning Wang

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

Shuffle Private Stochastic Convex Optimization.

Albert Cheu, Matthew Joseph, Jieming Mao, Binghui Peng

Proceedings of the Tenth International Conference on Learning Representations, 2022

2021

Combinatorial Assortment Optimization.

Nicole Immorlica, Brendan Lucier, Jieming Mao, Vasilis Syrgkanis, Christos Tzamos

ACM Trans. Economics and Comput., 2021

Towards Efficient Auctions in an Auto-bidding World.

Yuan Deng, Jieming Mao, Vahab S. Mirrokni, Song Zuo

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

Connecting Robust Shuffle Privacy and Pan-Privacy.

Victor Balcer, Albert Cheu, Matthew Joseph, Jieming Mao

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

Welfare-maximizing Guaranteed Dashboard Mechanisms.

Yuan Deng, Jason D. Hartline, Jieming Mao, 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.

Santiago R. Balseiro, Yuan Deng, Jieming Mao, Vahab S. Mirrokni, Song Zuo

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

Robust Auction Design in the Auto-bidding World.

Santiago R. Balseiro, Yuan Deng, Jieming Mao, Vahab S. Mirrokni, Song Zuo

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.

Matthew Joseph, Jieming Mao, Aaron Roth

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

Incentivizing Exploration with Selective Data Disclosure.

Nicole Immorlica, Jieming Mao, Aleksandrs Slivkins, Zhiwei Steven Wu

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

Smoothly Bounding User Contributions in Differential Privacy.

Alessandro Epasto, Mohammad Mahdian, Jieming Mao, Vahab S. Mirrokni, Lijie Ren

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

Pan-Private Uniformity Testing.

Kareem Amin, Matthew Joseph, Jieming Mao

Proceedings of the Conference on Learning Theory, 2020

2019

Exponential Separations in Local Differential Privacy Through Communication Complexity.

Matthew Joseph, Jieming Mao, Aaron Roth

CoRR, 2019

Diversity and Exploration in Social Learning.

Nicole Immorlica, Jieming Mao, Christos Tzamos

Proceedings of the World Wide Web Conference, 2019

Bayesian Exploration with Heterogeneous Agents.

Nicole Immorlica, Jieming Mao, Aleksandrs Slivkins, Zhiwei Steven Wu

Proceedings of the World Wide Web Conference, 2019

Locally Private Gaussian Estimation.

Matthew Joseph, Janardhan Kulkarni, Jieming Mao, Zhiwei Steven Wu

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

Differentially Private Fair Learning.

Matthew Jagielski, Michael J. Kearns, Jieming Mao, Alina Oprea, Aaron Roth, Saeed Sharifi-Malvajerdi, Jonathan R. Ullman

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

The Role of Interactivity in Local Differential Privacy.

Matthew Joseph, Jieming Mao, Seth Neel, Aaron Roth

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

Multi-armed Bandit Problems with Strategic Arms.

Mark Braverman, Jieming Mao, Jon Schneider, S. Matthew Weinberg

Proceedings of the Conference on Learning Theory, 2019

Sorted Top-k in Rounds.

Mark Braverman, Jieming Mao, Yuval Peres

Proceedings of the Conference on Learning Theory, 2019

2018

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

Xi Chen, Sivakanth Gopi, Jieming Mao, Jon Schneider

IEEE Trans. Inf. Theory, 2018

Incentivizing Exploration with Unbiased Histories.

Nicole Immorlica, Jieming Mao, Aleksandrs Slivkins, Zhiwei Steven Wu

CoRR, 2018

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

Xi Chen, Yuanzhi Li, Jieming Mao

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

On Simultaneous Two-player Combinatorial Auctions.

Mark Braverman, Jieming Mao, S. Matthew Weinberg

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

Selling to a No-Regret Buyer.

Mark Braverman, Jieming Mao, Jon Schneider, S. Matthew Weinberg

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

Contextual Pricing for Lipschitz Buyers.

Jieming Mao, 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.

Mark Braverman, Ran Gelles, Jieming Mao, Rafail Ostrovsky

IEEE Trans. Inf. Theory, 2017

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

Xi Chen, Yuanzhi Li, Jieming Mao

CoRR, 2017

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

Xi Chen, Sivakanth Gopi, Jieming Mao, Jon Schneider

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

2016

Competitive analysis of the top-K ranking problem.

Xi Chen, Sivakanth Gopi, Jieming Mao, Jon Schneider

CoRR, 2016

Parallel algorithms for select and partition with noisy comparisons.

Mark Braverman, Jieming Mao, 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.

Mark Braverman, Jieming Mao, S. Matthew Weinberg

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

2015

Near-optimal bounds on bounded-round quantum communication complexity of disjointness.

Mark Braverman, Ankit Garg, Young Kun-Ko, Jieming Mao, Dave Touchette

Electron. Colloquium Comput. Complex., 2015

2014

Simulating Noisy Channel Interaction.

Mark Braverman, Jieming Mao

Electron. Colloquium Comput. Complex., 2014

Tighter Relations Between Sensitivity and Other Complexity Measures.

Andris Ambainis, Mohammad Bavarian, Yihan Gao, Jieming Mao, Xiaoming Sun, Song Zuo

Electron. Colloquium Comput. Complex., 2014

2013

On the sensitivity complexity of bipartite graph properties.

Yihan Gao, Jieming Mao, Xiaoming Sun, Song Zuo

Theor. Comput. Sci., 2013

New upper bound on block sensitivity and certificate complexity in terms of sensitivity.

Andris Ambainis, Yihan Gao, Jieming Mao, Xiaoming Sun, Song Zuo

CoRR, 2013