Jieming Mao

According to our database1, Jieming Mao authored at least 41 papers between 2013 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2022
Regret Minimization with Noisy Observations.
CoRR, 2022

Approximately efficient bilateral trade.
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.
Proceedings of the EC '22: The 23rd ACM Conference on Economics and Computation, Boulder, CO, USA, July 11, 2022

Interactive Communication in Bilateral Trade.
Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

2021
Combinatorial Assortment Optimization.
ACM Trans. Economics and Comput., 2021

Shuffle Private Stochastic Convex Optimization.
CoRR, 2021

Optimal Pricing Schemes for an Impatient Buyer.
CoRR, 2021

Towards Efficient Auctions in an Auto-bidding World.
Proceedings of the WWW '21: The Web Conference 2021, 2021

Connecting Robust Shuffle Privacy and Pan-Privacy.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Welfare-maximizing Guaranteed Dashboard Mechanisms.
Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 2021

The Landscape of Auto-bidding Auctions: Value versus Utility Maximization.
Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 2021

Robust Auction Design in the Auto-bidding World.
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.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Incentivizing Exploration with Selective Data Disclosure.
Proceedings of the EC '20: The 21st ACM Conference on Economics and Computation, 2020

Smoothly Bounding User Contributions in Differential Privacy.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Pan-Private Uniformity Testing.
Proceedings of the Conference on Learning Theory, 2020

2019
Exponential Separations in Local Differential Privacy Through Communication Complexity.
CoRR, 2019

Diversity and Exploration in Social Learning.
Proceedings of the World Wide Web Conference, 2019

Bayesian Exploration with Heterogeneous Agents.
Proceedings of the World Wide Web Conference, 2019

Locally Private Gaussian Estimation.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Differentially Private Fair Learning.
Proceedings of the 36th International Conference on Machine Learning, 2019

The Role of Interactivity in Local Differential Privacy.
Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

Multi-armed Bandit Problems with Strategic Arms.
Proceedings of the Conference on Learning Theory, 2019

Sorted Top-k in Rounds.
Proceedings of the Conference on Learning Theory, 2019

2018
Optimal Instance Adaptive Algorithm for the Top-K Ranking Problem.
IEEE Trans. Inf. Theory, 2018

Incentivizing Exploration with Unbiased Histories.
CoRR, 2018

A Nearly Instance Optimal Algorithm for Top-<i>k</i> Ranking under the Multinomial Logit Model.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

On Simultaneous Two-player Combinatorial Auctions.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Selling to a No-Regret Buyer.
Proceedings of the 2018 ACM Conference on Economics and Computation, 2018

Contextual Pricing for Lipschitz Buyers.
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.
IEEE Trans. Inf. Theory, 2017

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

Competitive analysis of the top-<i>K</i> ranking problem.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

2016
Competitive analysis of the top-K ranking problem.
CoRR, 2016

Parallel algorithms for select and partition with noisy comparisons.
Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016

Interpolating Between Truthful and non-Truthful Mechanisms for Combinatorial Auctions.
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.
Electron. Colloquium Comput. Complex., 2015

2014
Simulating Noisy Channel Interaction.
Electron. Colloquium Comput. Complex., 2014

Tighter Relations Between Sensitivity and Other Complexity Measures.
Electron. Colloquium Comput. Complex., 2014

2013
On the sensitivity complexity of bipartite graph properties.
Theor. Comput. Sci., 2013

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


  Loading...