Jieming Mao (毛杰明)

I am currently a Warren Center Postdoctoral Fellow at University of Pennsylvania, hosted by Michael Kearns, Aaron Roth and Rakesh Vohra. I recently graduated with a PhD from Computer Science Department at Princeton University, advised by Mark Braverman.

Email: jiemingm@seas.upenn.edu

Publications:

  • Contextual Pricing for Lipschitz Buyers

with Renato Paes Leme and Jon Schneider. NIPS 2018

  • Combinatorial Assortment Optimization

with Nicole Immorlica, Brendan Lucier, Vasilis Syrgkanis and Christos Tzamos. WINE 2018 [arXiv]

  • Selling to a No-Regret Buyer

with Mark Braverman, Jon Schneider and Matthew Weinberg. EC 2018 [arXiv]

Best Full Paper Award and Best Paper with a Student Lead Author

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

with Xi Chen and Yuanzhi Li. SODA 2018 [arXiv]

  • On Simultaneous Two-player Combinatorial Auctions

with Mark Braverman and Matthew Weinberg. SODA 2018 [arXiv]

  • Competitive Analysis of the Top-K Ranking Problem

with Xi Chen, Sivakanth Gopi and Jon Schneider. SODA 2017 [arXiv]

  • Parallel Algoirithms for Select and Partition with Noisy Comparisons

with Mark Braverman and Matthew Weinberg. STOC 2016 [arXiv]

  • Coding for Interactive Communication Correcting Insertions and Deletions

with Mark Braverman, Ran Gelles and Rafail Ostrovsky. ICALP 2016 [arXiv]

  • Interpolating Between Truthful and Non-truthful Mechanisms for Combinatorial Auctions

with Mark Braverman and Matthew Weinberg. SODA 2016 [arXiv]

  • Near-optimal Bounds on Bounded-round Quantum Communication Complexity of Disjointness

with Mark Braverman, Ankit Garg, Young Kun Ko and Dave Touchette. FOCS 2015, QIP 2016 [ECCC]

  • Simulating Noisy Channel Interaction

with Mark Braverman. ITCS 2015 [ECCC]

  • Tighter Relations Between Sensitivity and Other Complexity Measures

with Andris Ambainis, Mohammad Bavarian, Yihan Gao, Xiaoming Sun and Song Zuo. ICALP 2014 [ECCC]

  • On the Sensitivity Complexity of Bipartite Graph Properties

with Yihan Gao, Xiaoming Sun and Song Zuo. Theor. Comput. Sci. 468: 83-91 (2013)

Manuscripts:

  • Incentivizing Exploration with Unbiased Histories

with Nicole Immorlica, Aleksandrs Slivkins and Zhiwei Steven Wu. Manuscript [arXiv]

  • Multi-armed Bandit Problems with Strategic Arms

with Mark Braverman, Jon Schneider and Matthew Weinberg. Manuscript [arXiv]