Jieming Mao

Publication Activity (10 Years)

Years Active: 2013-2024
Publications (10 Years): 71

Top Topics

Noisy Observations

Differential Privacy

Combinatorial Auctions

Top Venues

Publications

Rudrajit Das, Inderjit S. Dhillon, Alessandro Epasto, Adel Javanmard, Jieming Mao, Vahab Mirrokni, Sujay Sanghavi, Peilin Zhong
Retraining with Predicted Hard Labels Provably Increases Model Accuracy. CoRR (2024)
Yuan Deng, Mohammad Mahdian, Jieming Mao, Vahab Mirrokni, Hanrui Zhang, Song Zuo
Efficiency of the Generalized Second-Price Auction for Value Maximizers. WWW (2024)
Yuan Deng, Jieming Mao, Vahab Mirrokni, Yifeng Teng, Song Zuo
Non-uniform Bid-scaling and Equilibria for Different Auctions: An Empirical Study. WWW (2024)
Alessandro Epasto, Jieming Mao, Andres Muñoz Medina, Vahab Mirrokni, Sergei Vassilvitskii, Peilin Zhong
Differentially Private Continual Releases of Streaming Frequency Moment Estimations. CoRR (2023)
Yuan Deng, Jieming Mao, Vahab Mirrokni, Hanrui Zhang, Song Zuo
Autobidding Auctions in the Presence of User Costs. CoRR (2023)
Yuan Deng, Mohammad Mahdian, Jieming Mao, Vahab Mirrokni, Hanrui Zhang, Song Zuo
Efficiency of the Generalized Second-Price Auction for Value Maximizers. CoRR (2023)
Mohammad Mahdian, Jieming Mao, Kangning Wang
Regret Minimization with Noisy Observations. EC (2023)
Alessandro Epasto, Jieming Mao, Andres Muñoz Medina, Vahab Mirrokni, Sergei Vassilvitskii, Peilin Zhong
Differentially Private Continual Releases of Streaming Frequency Moment Estimations. ITCS (2023)
Yuan Deng, Jieming Mao, Vahab Mirrokni, Hanrui Zhang, Song Zuo
Autobidding Auctions in the Presence of User Costs. WWW (2023)
Yangsibo Huang, Haotian Jiang, Daogao Liu, Mohammad Mahdian, Jieming Mao, Vahab Mirrokni
Learning across Data Owners with Joint Differential Privacy. CoRR (2023)
Yuan Deng, Jieming Mao, Balasubramanian Sivan, Kangning Wang
Optimal Pricing Schemes for an Impatient Buyer. SODA (2023)
Yuan Deng, Jieming Mao, Vahab Mirrokni, Yifeng Teng, Song Zuo
Non-uniform Bid-scaling and Equilibria for Different Auctions: An Empirical Study. CoRR (2023)
Yuan Deng, Jieming Mao, Balasubramanian Sivan, Kangning Wang
Approximately efficient bilateral trade. STOC (2022)
Yuan Deng, Jieming Mao, Vahab Mirrokni, Hanrui Zhang, Song Zuo
Efficiency of the First-Price Auction in the Autobidding World. CoRR (2022)
Santiago R. Balseiro, Yuan Deng, Jieming Mao, Vahab S. Mirrokni, Song Zuo
Optimal Mechanisms for Value Maximizers with Budget Constraints via Target Clipping. EC (2022)
Jieming Mao, Renato Paes Leme, Kangning Wang
Interactive Communication in Bilateral Trade. ITCS (2022)
Mohammad Mahdian, Jieming Mao, Kangning Wang
Regret Minimization with Noisy Observations. CoRR (2022)
Albert Cheu, Matthew Joseph, Jieming Mao, Binghui Peng
Shuffle Private Stochastic Convex Optimization. ICLR (2022)
Matthew Joseph, Jieming Mao, Aaron Roth
Exponential Separations in Local Privacy. ACM Trans. Algorithms 18 (4) (2022)
Yuan Deng, Jieming Mao, Balasubramanian Sivan, Kangning Wang
Approximately Efficient Bilateral Trade. CoRR (2021)
Santiago R. Balseiro, Yuan Deng, Jieming Mao, Vahab S. Mirrokni, Song Zuo
Robust Auction Design in the Auto-bidding World. NeurIPS (2021)
Santiago R. Balseiro, Yuan Deng, Jieming Mao, Vahab S. Mirrokni, Song Zuo
Robust Auction Design in the Auto-bidding World. CoRR (2021)
Jieming Mao, Renato Paes Leme, Kangning Wang
Interactive Communication in Bilateral Trade. CoRR (2021)
Yuan Deng, Jieming Mao, Balasubramanian Sivan, Kangning Wang
Optimal Pricing Schemes for an Impatient Buyer. CoRR (2021)
Nicole Immorlica, Brendan Lucier, Jieming Mao, Vasilis Syrgkanis, Christos Tzamos
Combinatorial Assortment Optimization. ACM Trans. Economics and Comput. 9 (1) (2021)
Yuan Deng, Jieming Mao, Vahab S. Mirrokni, Song Zuo
Towards Efficient Auctions in an Auto-bidding World. CoRR (2021)
Santiago R. Balseiro, Yuan Deng, Jieming Mao, Vahab S. Mirrokni, Song Zuo
The Landscape of Auto-bidding Auctions: Value versus Utility Maximization. EC (2021)
Yuan Deng, Jieming Mao, Vahab S. Mirrokni, Song Zuo
Towards Efficient Auctions in an Auto-bidding World. WWW (2021)
Victor Balcer, Albert Cheu, Matthew Joseph, Jieming Mao
Connecting Robust Shuffle Privacy and Pan-Privacy. SODA (2021)
Albert Cheu, Matthew Joseph, Jieming Mao, Binghui Peng
Shuffle Private Stochastic Convex Optimization. CoRR (2021)
Yuan Deng, Jason D. Hartline, Jieming Mao, Balasubramanian Sivan
Welfare-maximizing Guaranteed Dashboard Mechanisms. EC (2021)
Kareem Amin, Matthew Joseph, Jieming Mao
Pan-Private Uniformity Testing. COLT (2020)
Matthew Joseph, Jieming Mao, Aaron Roth
Exponential Separations in Local Differential Privacy. SODA (2020)
Victor Balcer, Albert Cheu, Matthew Joseph, Jieming Mao
Connecting Robust Shuffle Privacy and Pan-Privacy. CoRR (2020)
Nicole Immorlica, Jieming Mao, Aleksandrs Slivkins, Zhiwei Steven Wu
Incentivizing Exploration with Selective Data Disclosure. EC (2020)
Alessandro Epasto, Mohammad Mahdian, Jieming Mao, Vahab S. Mirrokni, Lijie Ren
Smoothly Bounding User Contributions in Differential Privacy. NeurIPS (2020)
Mark Braverman, Jieming Mao, Yuval Peres
Sorted Top-k in Rounds. COLT (2019)
Matthew Joseph, Janardhan Kulkarni, Jieming Mao, Zhiwei Steven Wu
Locally Private Gaussian Estimation. NeurIPS (2019)
Matthew Joseph, Jieming Mao, Seth Neel, Aaron Roth
The Role of Interactivity in Local Differential Privacy. CoRR (2019)
Nicole Immorlica, Jieming Mao, Christos Tzamos
Diversity and Exploration in Social Learning. WWW (2019)
Nicole Immorlica, Jieming Mao, Aleksandrs Slivkins, Zhiwei Steven Wu
Bayesian Exploration with Heterogeneous Agents. CoRR (2019)
Mark Braverman, Jieming Mao, Jon Schneider, S. Matthew Weinberg
Multi-armed Bandit Problems with Strategic Arms. COLT (2019)
Matthew Joseph, Jieming Mao, Seth Neel, Aaron Roth
The Role of Interactivity in Local Differential Privacy. FOCS (2019)
Mark Braverman, Jieming Mao, Yuval Peres
Sorted Top-k in Rounds. CoRR (2019)
Kareem Amin, Matthew Joseph, Jieming Mao
Pan-Private Uniformity Testing. CoRR (2019)
Matthew Joseph, Jieming Mao, Aaron Roth
Exponential Separations in Local Differential Privacy Through Communication Complexity. CoRR (2019)
Nicole Immorlica, Jieming Mao, Christos Tzamos
Diversity and Exploration in Social Learning. CoRR (2019)
Nicole Immorlica, Jieming Mao, Aleksandrs Slivkins, Zhiwei Steven Wu
Bayesian Exploration with Heterogeneous Agents. WWW (2019)
Matthew Jagielski, Michael J. Kearns, Jieming Mao, Alina Oprea, Aaron Roth, Saeed Sharifi-Malvajerdi, Jonathan R. Ullman
Differentially Private Fair Learning. ICML (2019)
Xi Chen, Sivakanth Gopi, Jieming Mao, Jon Schneider
Optimal Instance Adaptive Algorithm for the Top-K Ranking Problem. IEEE Trans. Inf. Theory 64 (9) (2018)
Xi Chen, Yuanzhi Li, Jieming Mao
Ranking under the Multinomial Logit Model. SODA (2018)
Matthew Jagielski, Michael J. Kearns, Jieming Mao, Alina Oprea, Aaron Roth, Saeed Sharifi-Malvajerdi, Jonathan R. Ullman
Differentially Private Fair Learning. CoRR (2018)
Mark Braverman, Jieming Mao, S. Matthew Weinberg
On Simultaneous Two-player Combinatorial Auctions. SODA (2018)
Nicole Immorlica, Brendan Lucier, Jieming Mao, Vasilis Syrgkanis, Christos Tzamos
Combinatorial Assortment Optimization. WINE (2018)
Mark Braverman, Jieming Mao, Jon Schneider, S. Matthew Weinberg
Selling to a No-Regret Buyer. EC (2018)
Matthew Joseph, Janardhan Kulkarni, Jieming Mao, Zhiwei Steven Wu
Locally Private Gaussian Estimation. CoRR (2018)
Jieming Mao, Renato Paes Leme, Jon Schneider
Contextual Pricing for Lipschitz Buyers. NeurIPS (2018)
Nicole Immorlica, Jieming Mao, Aleksandrs Slivkins, Zhiwei Steven Wu
Incentivizing Exploration with Unbiased Histories. CoRR (2018)
Mark Braverman, Ankit Garg, Young Kun-Ko, Jieming Mao, Dave Touchette
Near-Optimal Bounds on the Bounded-Round Quantum Communication Complexity of Disjointness. SIAM J. Comput. 47 (6) (2018)
Mark Braverman, Jieming Mao, Jon Schneider, S. Matthew Weinberg
Multi-armed Bandit Problems with Strategic Arms. CoRR (2017)
Xi Chen, Yuanzhi Li, Jieming Mao
A Nearly Instance Optimal Algorithm for Top-k Ranking under the Multinomial Logit Model. CoRR (2017)
Nicole Immorlica, Brendan Lucier, Jieming Mao, Vasilis Syrgkanis, Christos Tzamos
Combinatorial Assortment Optimization. CoRR (2017)
Mark Braverman, Ran Gelles, Jieming Mao, Rafail Ostrovsky
Coding for Interactive Communication Correcting Insertions and Deletions. IEEE Trans. Inf. Theory 63 (10) (2017)
Mark Braverman, Jieming Mao, S. Matthew Weinberg
On Simultaneous Two-player Combinatorial Auctions. CoRR (2017)
Mark Braverman, Jieming Mao, Jon Schneider, S. Matthew Weinberg
Selling to a No-Regret Buyer. CoRR (2017)
Xi Chen, Sivakanth Gopi, Jieming Mao, Jon Schneider
ranking problem. SODA (2017)
Mark Braverman, Ran Gelles, Jieming Mao, Rafail Ostrovsky
Coding for Interactive Communication Correcting Insertions and Deletions. ICALP (2016)
Mark Braverman, Jieming Mao, S. Matthew Weinberg
Interpolating Between Truthful and non-Truthful Mechanisms for Combinatorial Auctions. SODA (2016)
Mark Braverman, Jieming Mao, S. Matthew Weinberg
Parallel algorithms for select and partition with noisy comparisons. STOC (2016)
Xi Chen, Sivakanth Gopi, Jieming Mao, Jon Schneider
Competitive analysis of the top-K ranking problem. CoRR (2016)
Mark Braverman, Jieming Mao, S. Matthew Weinberg
Parallel Algorithms for Select and Partition with Noisy Comparisons. CoRR (2016)
Mark Braverman, Ran Gelles, Jieming Mao, Rafail Ostrovsky
Coding for interactive communication correcting insertions and deletions. CoRR (2015)
Mark Braverman, Ankit Garg, Young Kun-Ko, Jieming Mao, Dave Touchette
Near-optimal bounds on bounded-round quantum communication complexity of disjointness. CoRR (2015)
Mark Braverman, Jieming Mao
Simulating Noisy Channel Interaction. ITCS (2015)
Mark Braverman, Ankit Garg, Young Kun-Ko, Jieming Mao, Dave Touchette
Near-optimal bounds on bounded-round quantum communication complexity of disjointness. Electron. Colloquium Comput. Complex. 22 (2015)
Mark Braverman, Jieming Mao, S. Matthew Weinberg
Interpolating Between Truthful and non-Truthful Mechanisms for Combinatorial Auctions. CoRR (2015)
Mark Braverman, Ankit Garg, Young Kun-Ko, Jieming Mao, Dave Touchette
Near-Optimal Bounds on Bounded-Round Quantum Communication Complexity of Disjointness. FOCS (2015)
Mark Braverman, Jieming Mao
Simulating Noisy Channel Interaction. CoRR (2014)
Andris Ambainis, Mohammad Bavarian, Yihan Gao, Jieming Mao, Xiaoming Sun, Song Zuo
Tighter Relations between Sensitivity and Other Complexity Measures. ICALP (1) (2014)
Andris Ambainis, Mohammad Bavarian, Yihan Gao, Jieming Mao, Xiaoming Sun, Song Zuo
Tighter Relations Between Sensitivity and Other Complexity Measures. Electron. Colloquium Comput. Complex. 21 (2014)
Mark Braverman, Jieming Mao
Simulating Noisy Channel Interaction. Electron. Colloquium Comput. Complex. 21 (2014)
Andris Ambainis, Mohammad Bavarian, Yihan Gao, Jieming Mao, Xiaoming Sun, Song Zuo
Tighter Relations Between Sensitivity and Other Complexity Measures. CoRR (2014)
Yihan Gao, Jieming Mao, Xiaoming Sun, Song Zuo
On the sensitivity complexity of bipartite graph properties. Theor. Comput. Sci. 468 (2013)
Andris Ambainis, Yihan Gao, Jieming Mao, Xiaoming Sun, Song Zuo
New upper bound on block sensitivity and certificate complexity in terms of sensitivity. CoRR (2013)