| Tight approximation ratio of anonymous pricing Y Jin, P Lu, Q Qi, ZG Tang, T Xiao Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019 | 33 | 2019 |
| Tight Revenue Gaps among Simple Mechanisms Y Jin, P Lu, ZG Tang, T Xiao Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019 | 31 | 2019 |
| Improved efficiency guarantees in auctions with budgets P Lu, T Xiao Proceedings of the Sixteenth ACM Conference on Economics and Computation …, 2015 | 18 | 2015 |
| Liquid welfare maximization in auctions with multiple items P Lu, T Xiao International Symposium on Algorithmic Game Theory, 41-52, 2017 | 13 | 2017 |
| Learn to play maximum revenue auction X Deng, T Xiao, K Zhu IEEE Transactions on Cloud Computing, 2017 | 13 | 2017 |
| On the Complexity of Sequential Posted Pricing T Xiao, Z Liu, W Huang | 7* | |
| Learning Reserve Prices in Second-Price Auctions Y Jin, P Lu, T Xiao arXiv preprint arXiv:1912.10069, 2019 | 6 | 2019 |
| Private Data Manipulation in Optimal Sponsored Search Auction X Deng, T Lin, T Xiao Proceedings of The Web Conference 2020, 2676-2682, 2020 | 5 | 2020 |
| Nearly tight bounds for sandpile transience on the grid D Durfee, M Fahrbach, Y Gao, T Xiao Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018 | 5 | 2018 |
| Tight Revenue Gaps among Simple and Optimal Mechanisms Y JIN, P LU, QI QI, ZG TANG, TAO XIAO NICOLE IMMORLICA, SCOTT DUKE KOMINERS, and KATRINA LIGETT, 54, 0 | 2* | |
| Learn to Play Maximum Revenue Auction X Deng, T Xiao, K Zhu IEEE Annals of the History of Computing 53 (06), 7-8, 2020 | | 2020 |
| Size-Relaxed Committee Selection under the Chamberlin-Courant Rule T Xiao, S Sikdar Proceedings of the 19th International Conference on Autonomous Agents and …, 2020 | | 2020 |
Pinyan LuITCS, Shanghai University of Finance and EconomicsDirección de correo verificada de mail.shufe.edu.cn
