Biaoshuai Tao
机构: John Hopcroft Center for Computer Science, Shanghai Jiao Tong University
主页: sjtu.edu.cn
每年引用次数
引用次数
引用: 401
H-指数: 10
I10-指数 : 12
出版物: 31
Incentive Ratios for Fairly Allocating Indivisible Goods: Simple Mechanisms Prevail
Biaoshuai Tao , Mingwei Yang
arXiv preprint arXiv:2306.15920
1
2023
Cooperation in threshold public projects with binary actions
Yiling Chen , Biaoshuai Tao , Fang-Yi Yu
arXiv preprint arXiv:2105.08572
3
2021
Improving the biclique cryptanalysis of AES
Biaoshuai Tao , Hongjun Wu
Information Security and Privacy: 20th Australasian Conference, ACISP 2015, Brisbane, QLD, Australia, June 29--July 1, 2015, Proceedings 20 39 -56
67
2015
On existence of truthful fair cake cutting mechanisms
Biaoshuai Tao
404 -434
25
2022
Beyond Worst-Case (In)approximability of Nonsubmodular Influence Maximization
Grant Schoenebeck , Biaoshuai Tao
WINE 2017: The 13th Conference on Web and Internet Economics 10660 ( Lecture Notes in Computer Science) 368 -382
23
2017
Truthful fair mechanisms for allocating mixed divisible and indivisible goods
Zihao Li , Shengxin Liu , Xinhang Lu , Biaoshuai Tao
arXiv preprint arXiv:2305.09206
10
2023
On the complexity of maximizing social welfare within fair allocations of indivisible goods
Xiaolin Bu , Zihao Li , Shengxin Liu , Jiaxin Song
arXiv preprint arXiv:2205.14296
10
2022
A complete landscape for the price of envy-freeness
Zihao Li , Shengxin Liu , Xinhang Lu , Biaoshuai Tao
arXiv preprint arXiv:2401.01516
3
2024
Fair division with allocator’s preference
Xiaolin Bu , Zihao Li , Shengxin Liu , Jiaxin Song
Springer Nature Switzerland 77 -94
3
2023
Fair Division of Indivisible Goods with Comparison-Based Queries
Xiaolin Bu , Zihao Li , Shengxin Liu , Jiaxin Song
arXiv preprint arXiv:2404.18133
2024
Fair division with prioritized agents
Xiaolin Bu , Zihao Li , Shengxin Liu , Jiaxin Song
Proceedings of the AAAI Conference on Artificial Intelligence 37 ( 5) 5540 -5548
2023