default search action
Jieming Mao
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c38]Yuan Deng
, Mohammad Mahdian
Efficiency of the Generalized Second-Price Auction for Value Maximizers. WWW 2024: 46-56 - [c37]Yuan Deng
Non-uniform Bid-scaling and Equilibria for Different Auctions: An Empirical Study. WWW 2024: 256-266 - [i41]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 abs/2406.11206 (2024) - [i40]Gagan Aggarwal, Ashwinkumar Badanidiyuru, Santiago R. Balseiro, Kshipra Bhawalkar, Yuan Deng, Zhe Feng, Gagan Goel, Christopher Liaw, Haihao Lu, Mohammad Mahdian, Jieming Mao, Aranyak Mehta, Vahab Mirrokni, Renato Paes Leme, Andrés Perlroth, Georgios Piliouras, Jon Schneider, Ariel Schvartzman, Balasubramanian Sivan, Kelly Spendlove, Yifeng Teng, Di Wang, Hanrui Zhang, Mingfei Zhao, Wennan Zhu, Song Zuo:
Auto-bidding and Auctions in Online Advertising: A Survey. CoRR abs/2408.07685 (2024) - 2023
- [c36]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: 48:1-48:24 - [c35]Mohammad Mahdian
Regret Minimization with Noisy Observations. EC 2023: 963 - [c34]Yuan Deng, Jieming Mao, Balasubramanian Sivan, Kangning Wang:
Optimal Pricing Schemes for an Impatient Buyer. SODA 2023: 382-398 - [c33]Yuan Deng
Autobidding Auctions in the Presence of User Costs. WWW 2023: 3428-3435 - [i39]Alessandro Epasto, Jieming Mao, Andres Muñoz Medina, Vahab Mirrokni, Sergei Vassilvitskii, Peilin Zhong:
Differentially Private Continual Releases of Streaming Frequency Moment Estimations. CoRR abs/2301.05605 (2023) - [i38]Yuan Deng, Jieming Mao, Vahab Mirrokni, Hanrui Zhang, Song Zuo:
Autobidding Auctions in the Presence of User Costs. CoRR abs/2302.00377 (2023) - [i37]Yangsibo Huang, Haotian Jiang, Daogao Liu, Mohammad Mahdian, Jieming Mao, Vahab Mirrokni:
Learning across Data Owners with Joint Differential Privacy. CoRR abs/2305.15723 (2023) - [i36]Yuan Deng, Mohammad Mahdian, Jieming Mao, Vahab Mirrokni, Hanrui Zhang, Song Zuo:
Efficiency of the Generalized Second-Price Auction for Value Maximizers. CoRR abs/2310.03105 (2023) - [i35]Yuan Deng, Jieming Mao, Vahab Mirrokni, Yifeng Teng, Song Zuo:
Non-uniform Bid-scaling and Equilibria for Different Auctions: An Empirical Study. CoRR abs/2311.10679 (2023) - 2022
- [j6]Matthew Joseph
Exponential Separations in Local Privacy. ACM Trans. Algorithms 18(4): 32:1-32:17 (2022) - [c32]Albert Cheu, Matthew Joseph, Jieming Mao, Binghui Peng:
Shuffle Private Stochastic Convex Optimization. ICLR 2022 - [c31]Jieming Mao, Renato Paes Leme, Kangning Wang
Interactive Communication in Bilateral Trade. ITCS 2022: 105:1-105:21 - [c30]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: 475 - [c29]Yuan Deng, Jieming Mao, Balasubramanian Sivan, Kangning Wang
Approximately efficient bilateral trade. STOC 2022: 718-721 - [i34]Mohammad Mahdian, Jieming Mao, Kangning Wang
Regret Minimization with Noisy Observations. CoRR abs/2207.09435 (2022) - [i33]Yuan Deng, Jieming Mao, Vahab Mirrokni, Hanrui Zhang, Song Zuo:
Efficiency of the First-Price Auction in the Autobidding World. CoRR abs/2208.10650 (2022) - 2021
- [j5]Nicole Immorlica, Brendan Lucier, Jieming Mao, Vasilis Syrgkanis, Christos Tzamos
Combinatorial Assortment Optimization. ACM Trans. Economics and Comput. 9(1): 5:1-5:34 (2021) - [c28]Santiago R. Balseiro, Yuan Deng, Jieming Mao, Vahab S. Mirrokni, Song Zuo:
Robust Auction Design in the Auto-bidding World. NeurIPS 2021: 17777-17788 - [c27]Santiago R. Balseiro, Yuan Deng, Jieming Mao, Vahab S. Mirrokni, Song Zuo:
The Landscape of Auto-bidding Auctions: Value versus Utility Maximization. EC 2021: 132-133 - [c26]Yuan Deng, Jason D. Hartline, Jieming Mao, Balasubramanian Sivan:
Welfare-maximizing Guaranteed Dashboard Mechanisms. EC 2021: 370 - [c25]Victor Balcer, Albert Cheu, Matthew Joseph, Jieming Mao:
Connecting Robust Shuffle Privacy and Pan-Privacy. SODA 2021: 2384-2403 - [c24]Yuan Deng, Jieming Mao, Vahab S. Mirrokni, Song Zuo:
Towards Efficient Auctions in an Auto-bidding World. WWW 2021: 3965-3973 - [i32]Yuan Deng, Jieming Mao, Vahab S. Mirrokni, Song Zuo:
Towards Efficient Auctions in an Auto-bidding World. CoRR abs/2103.13356 (2021) - [i31]Yuan Deng, Jieming Mao, Balasubramanian Sivan, Kangning Wang:
Optimal Pricing Schemes for an Impatient Buyer. CoRR abs/2106.02149 (2021) - [i30]Jieming Mao, Renato Paes Leme, Kangning Wang:
Interactive Communication in Bilateral Trade. CoRR abs/2106.02150 (2021) - [i29]Albert Cheu, Matthew Joseph, Jieming Mao, Binghui Peng:
Shuffle Private Stochastic Convex Optimization. CoRR abs/2106.09805 (2021) - [i28]Santiago R. Balseiro, Yuan Deng, Jieming Mao, Vahab S. Mirrokni, Song Zuo:
Robust Auction Design in the Auto-bidding World. CoRR abs/2111.02468 (2021) - [i27]Yuan Deng, Jieming Mao, Balasubramanian Sivan, Kangning Wang:
Approximately Efficient Bilateral Trade. CoRR abs/2111.03611 (2021) - 2020
- [c23]Kareem Amin, Matthew Joseph, Jieming Mao:
Pan-Private Uniformity Testing. COLT 2020: 183-218 - [c22]Alessandro Epasto, Mohammad Mahdian, Jieming Mao, Vahab S. Mirrokni, Lijie Ren:
Smoothly Bounding User Contributions in Differential Privacy. NeurIPS 2020 - [c21]Nicole Immorlica, Jieming Mao, Aleksandrs Slivkins, Zhiwei Steven Wu:
Incentivizing Exploration with Selective Data Disclosure. EC 2020: 647-648 - [c20]Matthew Joseph, Jieming Mao, Aaron Roth:
Exponential Separations in Local Differential Privacy. SODA 2020: 515-527 - [i26]Victor Balcer, Albert Cheu, Matthew Joseph, Jieming Mao:
Connecting Robust Shuffle Privacy and Pan-Privacy. CoRR abs/2004.09481 (2020)
2010 – 2019
- 2019
- [c19]Mark Braverman, Jieming Mao, Yuval Peres:
Sorted Top-k in Rounds. COLT 2019: 342-382 - [c18]Mark Braverman, Jieming Mao, Jon Schneider, S. Matthew Weinberg
Multi-armed Bandit Problems with Strategic Arms. COLT 2019: 383-416 - [c17]Matthew Joseph, Jieming Mao, Seth Neel, Aaron Roth
The Role of Interactivity in Local Differential Privacy. FOCS 2019: 94-105 - [c16]Matthew Jagielski, Michael J. Kearns, Jieming Mao, Alina Oprea, Aaron Roth, Saeed Sharifi-Malvajerdi, Jonathan R. Ullman:
Differentially Private Fair Learning. ICML 2019: 3000-3008 - [c15]Matthew Joseph, Janardhan Kulkarni, Jieming Mao, Zhiwei Steven Wu:
Locally Private Gaussian Estimation. NeurIPS 2019: 2980-2989 - [c14]Nicole Immorlica, Jieming Mao, Aleksandrs Slivkins, Zhiwei Steven Wu
Bayesian Exploration with Heterogeneous Agents. WWW 2019: 751-761 - [c13]Nicole Immorlica, Jieming Mao, Christos Tzamos
Diversity and Exploration in Social Learning. WWW 2019: 762-772 - [i25]Nicole Immorlica, Jieming Mao, Aleksandrs Slivkins, Zhiwei Steven Wu:
Bayesian Exploration with Heterogeneous Agents. CoRR abs/1902.07119 (2019) - [i24]Matthew Joseph, Jieming Mao, Seth Neel, Aaron Roth:
The Role of Interactivity in Local Differential Privacy. CoRR abs/1904.03564 (2019) - [i23]Nicole Immorlica, Jieming Mao, Christos Tzamos:
Diversity and Exploration in Social Learning. CoRR abs/1905.05213 (2019) - [i22]Mark Braverman, Jieming Mao, Yuval Peres:
Sorted Top-k in Rounds. CoRR abs/1906.05208 (2019) - [i21]Matthew Joseph, Jieming Mao, Aaron Roth:
Exponential Separations in Local Differential Privacy Through Communication Complexity. CoRR abs/1907.00813 (2019) - [i20]Kareem Amin, Matthew Joseph, Jieming Mao:
Pan-Private Uniformity Testing. CoRR abs/1911.01452 (2019) - 2018
- [b1]Jieming Mao:
Algorithms in Strategic or Noisy Environments. Princeton University, USA, 2018 - [j4]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): 2277-2314 (2018) - [j3]Xi Chen
Optimal Instance Adaptive Algorithm for the Top-K Ranking Problem. IEEE Trans. Inf. Theory 64(9): 6139-6160 (2018) - [c12]Jieming Mao, Renato Paes Leme, Jon Schneider:
Contextual Pricing for Lipschitz Buyers. NeurIPS 2018: 5648-5656 - [c11]Mark Braverman, Jieming Mao, Jon Schneider, S. Matthew Weinberg
Selling to a No-Regret Buyer. EC 2018: 523-538 - [c10]Mark Braverman, Jieming Mao, S. Matthew Weinberg
On Simultaneous Two-player Combinatorial Auctions. SODA 2018: 2256-2273 - [c9]Xi Chen, Yuanzhi Li, Jieming Mao:
A Nearly Instance Optimal Algorithm for Top-k Ranking under the Multinomial Logit Model. SODA 2018: 2504-2522 - [c8]Nicole Immorlica, Brendan Lucier, Jieming Mao, Vasilis Syrgkanis, Christos Tzamos
Combinatorial Assortment Optimization. WINE 2018: 218-231 - [i19]Nicole Immorlica, Jieming Mao, Aleksandrs Slivkins, Zhiwei Steven Wu:
Incentivizing Exploration with Unbiased Histories. CoRR abs/1811.06026 (2018) - [i18]Matthew Joseph, Janardhan Kulkarni, Jieming Mao, Zhiwei Steven Wu:
Locally Private Gaussian Estimation. CoRR abs/1811.08382 (2018) - [i17]Matthew Jagielski, Michael J. Kearns, Jieming Mao, Alina Oprea, Aaron Roth, Saeed Sharifi-Malvajerdi, Jonathan R. Ullman:
Differentially Private Fair Learning. CoRR abs/1812.02696 (2018) - 2017
- [j2]Mark Braverman, Ran Gelles
Coding for Interactive Communication Correcting Insertions and Deletions. IEEE Trans. Inf. Theory 63(10): 6256-6270 (2017) - [c7]Xi Chen, Sivakanth Gopi, Jieming Mao, Jon Schneider:
Competitive analysis of the top-K ranking problem. SODA 2017: 1245-1264 - [i16]Mark Braverman, Jieming Mao, S. Matthew Weinberg:
On Simultaneous Two-player Combinatorial Auctions. CoRR abs/1704.03547 (2017) - [i15]Mark Braverman, Jieming Mao, Jon Schneider, S. Matthew Weinberg:
Multi-armed Bandit Problems with Strategic Arms. CoRR abs/1706.09060 (2017) - [i14]Xi Chen, Yuanzhi Li, Jieming Mao:
A Nearly Instance Optimal Algorithm for Top-k Ranking under the Multinomial Logit Model. CoRR abs/1707.08238 (2017) - [i13]Nicole Immorlica, Brendan Lucier, Jieming Mao, Vasilis Syrgkanis, Christos Tzamos:
Combinatorial Assortment Optimization. CoRR abs/1711.02601 (2017) - [i12]Mark Braverman, Jieming Mao, Jon Schneider, S. Matthew Weinberg:
Selling to a No-Regret Buyer. CoRR abs/1711.09176 (2017) - 2016
- [c6]Mark Braverman, Ran Gelles, Jieming Mao, Rafail Ostrovsky:
Coding for Interactive Communication Correcting Insertions and Deletions. ICALP 2016: 61:1-61:14 - [c5]Mark Braverman, Jieming Mao, S. Matthew Weinberg
Interpolating Between Truthful and non-Truthful Mechanisms for Combinatorial Auctions. SODA 2016: 1444-1457 - [c4]Mark Braverman, Jieming Mao, S. Matthew Weinberg
Parallel algorithms for select and partition with noisy comparisons. STOC 2016: 851-862 - [i11]Mark Braverman, Jieming Mao, S. Matthew Weinberg:
Parallel Algorithms for Select and Partition with Noisy Comparisons. CoRR abs/1603.04941 (2016) - [i10]Xi Chen, Sivakanth Gopi, Jieming Mao, Jon Schneider:
Competitive analysis of the top-K ranking problem. CoRR abs/1605.03933 (2016) - 2015
- [c3]Mark Braverman, Ankit Garg, Young Kun-Ko, Jieming Mao, Dave Touchette:
Near-Optimal Bounds on Bounded-Round Quantum Communication Complexity of Disjointness. FOCS 2015: 773-791 - [c2]Mark Braverman, Jieming Mao:
Simulating Noisy Channel Interaction. ITCS 2015: 21-30 - [i9]Mark Braverman, Ankit Garg, Young Kun-Ko, Jieming Mao, Dave Touchette:
Near-optimal bounds on bounded-round quantum communication complexity of disjointness. CoRR abs/1505.03110 (2015) - [i8]Mark Braverman, Ran Gelles, Jieming Mao, Rafail Ostrovsky:
Coding for interactive communication correcting insertions and deletions. CoRR abs/1508.00514 (2015) - [i7]Mark Braverman, Jieming Mao, S. Matthew Weinberg:
Interpolating Between Truthful and non-Truthful Mechanisms for Combinatorial Auctions. CoRR abs/1511.02831 (2015) - [i6]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. TR15 (2015) - 2014
- [c1]Andris Ambainis, Mohammad Bavarian, Yihan Gao, Jieming Mao, Xiaoming Sun, Song Zuo:
Tighter Relations between Sensitivity and Other Complexity Measures. ICALP (1) 2014: 101-113 - [i5]Mark Braverman, Jieming Mao:
Simulating Noisy Channel Interaction. CoRR abs/1409.4290 (2014) - [i4]Andris Ambainis, Mohammad Bavarian, Yihan Gao, Jieming Mao, Xiaoming Sun, Song Zuo:
Tighter Relations Between Sensitivity and Other Complexity Measures. CoRR abs/1411.3419 (2014) - [i3]Andris Ambainis, Mohammad Bavarian, Yihan Gao, Jieming Mao, Xiaoming Sun, Song Zuo:
Tighter Relations Between Sensitivity and Other Complexity Measures. Electron. Colloquium Comput. Complex. TR14 (2014) - [i2]Mark Braverman, Jieming Mao:
Simulating Noisy Channel Interaction. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [j1]Yihan Gao, Jieming Mao, Xiaoming Sun
On the sensitivity complexity of bipartite graph properties. Theor. Comput. Sci. 468: 83-91 (2013) - [i1]Andris Ambainis, Yihan Gao, Jieming Mao, Xiaoming Sun, Song Zuo:
New upper bound on block sensitivity and certificate complexity in terms of sensitivity. CoRR abs/1306.4466 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-16 21:27 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: