Follow
Mingfei Zhao
Mingfei Zhao
Verified email at google.com
Title
Cited by
Cited by
Year
Robust influence maximization
W Chen, T Lin, Z Tan, M Zhao, X Zhou
Proceedings of the 22nd ACM SIGKDD international conference on Knowledge …, 2016
2342016
Simple mechanisms for subadditive buyers via duality
Y Cai, M Zhao
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017
1292017
Approximating gains from trade in two-sided markets via simple mechanisms
J Brustle, Y Cai, F Wu, M Zhao
Proceedings of the 2017 ACM Conference on Economics and Computation, 589-590, 2017
702017
The best of both worlds: Asymptotically efficient mechanisms with a guarantee on the expected gains-from-trade
M Babaioff, Y Cai, YA Gonczarowski, M Zhao
arXiv preprint arXiv:1802.08023, 2018
292018
An Efficient -BIC to BIC Transformation and Its Application to Black-Box Reduction in Revenue Maximization
Y Cai, A Oikonomou, G Velegkas, M Zhao
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
212021
On multi-dimensional gains from trade maximization
Y Cai, K Goldner, S Ma, M Zhao
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
122021
Is Selling Complete Information (Approximately) Optimal?
D Bergemann, Y Cai, G Velegkas, M Zhao
Proceedings of the 23rd ACM Conference on Economics and Computation, 608-663, 2022
92022
An Efficient -BIC to BIC Transformation and Its Application to Black-Box Reduction in Revenue Maximization
Y Cai, A Oikonomou, G Velegkas, M Zhao
arXiv preprint arXiv:1911.10172, 2019
82019
Simple mechanisms for profit maximization in multi-item auctions
Y Cai, M Zhao
Proceedings of the 2019 ACM Conference on Economics and Computation, 217-236, 2019
62019
Computing simple mechanisms: Lift-and-round over marginal reduced forms
Y Cai, A Oikonomou, M Zhao
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022
52022
Tight Bound on Randomness for Violating the Clauser–Horne–Shimony–Holt Inequality
Y Teng, S Yang, S Wang, M Zhao
IEEE Transactions on Information Theory 62 (4), 1748-1757, 2016
22016
No-Regret Algorithms in non-Truthful Auctions with Budget and ROI Constraints
G Aggarwal, G Fikioris, M Zhao
arXiv preprint arXiv:2404.09832, 2024
12024
The Power of Two-sided Recruitment in Two-sided Markets
Y Cai, C Liaw, A Mehta, M Zhao
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 201-212, 2024
2024
Platform Competition in the Autobidding World
G Aggarwal, A Perlroth, A Schvartzman, M Zhao
arXiv preprint arXiv:2405.02699, 2024
2024
Worst-Case Welfare of Item Pricing in the Tollbooth Problem
Z Tan, Y Teng, M Zhao
Proceedings of the ACM Web Conference 2023, 3508-3518, 2023
2023
Simple vs. Optimal Mechanism Design
M Zhao
Yale University, 2021
2021
Approximating gains from trade in two-sided markets via simple mechanisms
M Zhao
McGill University (Canada), 2017
2017
Robust Influence Maximization
Z Tan, M Zhao, X Zhou, T Lin, W Chen
2014
The system can't perform the operation now. Try again later.
Articles 1–18