Follow
Biaoshuai Tao
Biaoshuai Tao
John Hopcroft Center for Computer Science, Shanghai Jiao Tong University
Verified email at sjtu.edu.cn - Homepage
Title
Cited by
Cited by
Year
Optimal proportional cake cutting with connected pieces
X Bei, N Chen, X Hua, B Tao, E Yang
Proceedings of the AAAI Conference on Artificial Intelligence 26 (1), 1263-1269, 2012
932012
Improving the biclique cryptanalysis of AES
B Tao, H Wu
Information Security and Privacy: 20th Australasian Conference, ACISP 2015 …, 2015
672015
Cake Cutting: Envy and Truth.
X Bei, N Chen, G Huzhang, B Tao, J Wu
IJCAI, 3625-3631, 2017
382017
Adaptive greedy versus non-adaptive greedy for influence maximization
W Chen, B Peng, G Schoenebeck, B Tao
Journal of Artificial Intelligence Research 74, 303-351, 2022
272022
On existence of truthful fair cake cutting mechanisms
B Tao
Proceedings of the 23rd ACM Conference on Economics and Computation, 404-434, 2022
252022
Beyond worst-case (in)approximability of nonsubmodular influence maximization
G Schoenebeck, B Tao
ACM Transactions on Computation Theory (TOCT) 11 (3), 12, 2019
232019
Beyond Worst-Case (In)approximability of Nonsubmodular Influence Maximization
G Schoenebeck, B Tao
WINE 2017: The 13th Conference on Web and Internet Economics 10660 (Lecture …, 2017
232017
Information elicitation mechanisms for statistical estimation
Y Kong, G Schoenebeck, B Tao, FY Yu
Proceedings of the AAAI Conference on Artificial Intelligence 34 (02), 2095-2102, 2020
222020
Improving -Subspaces via Coherence Pursuit
A Gitlin, B Tao, L Balzano, J Lipor
IEEE Journal of Selected Topics in Signal Processing 12 (6), 1575-1588, 2018
192018
Influence maximization on undirected graphs: Toward closing the (1-1/e) gap
G Schoenebeck, B Tao
ACM Transactions on Economics and Computation (TEAC) 8 (4), 1-36, 2020
162020
Think Globally, Act Locally: On the Optimal Seeding for Nonsubmodular Influence Maximization
G Schoenebeck, B Tao, FY Yu
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2019
112019
Truthful fair mechanisms for allocating mixed divisible and indivisible goods
Z Li, S Liu, X Lu, B Tao
arXiv preprint arXiv:2305.09206, 2023
102023
On the complexity of maximizing social welfare within fair allocations of indivisible goods
X Bu, Z Li, S Liu, J Song, B Tao
arXiv preprint arXiv:2205.14296, 2022
102022
Wisdom of the crowd voting: Truthful aggregation of voter information and preferences
G Schoenebeck, B Tao
Advances in Neural Information Processing Systems 34, 1872-1883, 2021
92021
Limitations of greed: Influence maximization in undirected networks re-visited
G Schoenebeck, B Tao, FY Yu
arXiv preprint arXiv:2002.11679, 2020
92020
Outsourcing computation: the minimal refereed mechanism
Y Kong, C Peikert, G Schoenebeck, B Tao
International Conference on Web and Internet Economics, 256-270, 2019
42019
A complete landscape for the price of envy-freeness
Z Li, S Liu, X Lu, B Tao, Y Tao
arXiv preprint arXiv:2401.01516, 2024
32024
Fair division with allocator’s preference
X Bu, Z Li, S Liu, J Song, B Tao
International Conference on Web and Internet Economics, 77-94, 2023
32023
Designing a Combinatorial Financial Options Market
X Wang, DM Pennock, NR Devanur, DM Rothschild, B Tao, MP Wellman
Proceedings of the 22nd ACM Conference on Economics and Computation, 864-883, 2021
32021
Cooperation in threshold public projects with binary actions
Y Chen, B Tao, FY Yu
arXiv preprint arXiv:2105.08572, 2021
32021
The system can't perform the operation now. Try again later.
Articles 1–20