Get started
Author

Biaoshuai Tao

Observed name: Tao, Biaoshuai
ORCID: 0000-0003-4098-844X
Observed ORCID: 0000-0003-4098-844X
OpenAlex ID: A5035538983
Optimal Proportional Cake Cutting with Connected Pieces
2021 · Xiaohui Bei, Ning Chen, et al. · Proceedings of the AAAI Conference on Artificial Intelligence · 74
Improving the Biclique Cryptanalysis of AES
2015 · Biaoshuai Tao, Hongjun Wu · Lecture notes in computer science · 47
Cake Cutting: Envy and Truth
2017 · Xiaohui Bei, Ning Chen, et al. · International Joint Conference on Artificial Intelligence · 33
PDF
On existence of truthful fair cake cutting mechanisms
2023 · Xiaolin Bu, Jiaxin Song, et al. · Artificial Intelligence · 19
Adaptive Greedy versus Non-adaptive Greedy for Influence Maximization
2022 · Wei Chen, Binghui Peng, et al. · Journal of Artificial Intelligence Research · 18
PDF
Improving $K$-Subspaces via Coherence Pursuit
2018 · Andrew Gitlin, Biaoshuai Tao, et al. · IEEE Journal of Selected Topics in Signal Processing · 18
Influence Maximization on Undirected Graphs
2020 · Grant Schoenebeck, Biaoshuai Tao · ACM Transactions on Economics and Computation · 14
A Complete Landscape for the Price of Envy-Freeness
2024 · Zihao Li, Shengxin Liu, et al. · Adaptive Agents and Multi-Agents Systems · 13
PDF
Adaptive Greedy versus Non-Adaptive Greedy for Influence Maximization
2020 · Wei Chen, Binghui Peng, et al. · Proceedings of the AAAI Conference on Artificial Intelligence · 13
Information Elicitation Mechanisms for Statistical Estimation
2020 · Yuqing Kong, Grant Schoenebeck, et al. · Proceedings of the AAAI Conference on Artificial Intelligence · 12
Beyond Worst-Case (In)approximability of Nonsubmodular Influence Maximization
2017 · Grant Schoenebeck, Biaoshuai Tao · Lecture notes in computer science · 12
Approximability Landscape of Welfare Maximization within Fair Allocations
2025 · Xiaolin Bu, Zihao Li, et al. · ACM Conference on Economics and Computation (EC) · 11
PDF
On Existence of Truthful Fair Cake Cutting Mechanisms
2022 · Biaoshuai Tao · ACM Conference on Economics and Computation (EC) · 11
PDF
Truthful Fair Mechanisms for Allocating Mixed Divisible and Indivisible Goods
2023 · Zihao Li, Shengxin Liu, et al. · International Joint Conference on Artificial Intelligence · 9
PDF
Think globally, act locally: On the optimal seeding for nonsubmodular influence maximization
2022 · Grant Schoenebeck, Biaoshuai Tao, et al. · Information and Computation · 9
EFX for Additive Chores: Nonexistence, Pareto Incompatibility, and Bi-Valued Existence
2026 · He, Wentao, Tao, Biaoshuai · arXiv (Cornell University) · 8
PDF
A Thorough Comparison Between Independent Cascade and Susceptible-Infected-Recovered Models
2025 · Panfeng Liu, Guoliang Qiu, et al. · Proceedings of the AAAI Conference on Artificial Intelligence · 8
PDF
Fair Division with Allocator’s Preference
2023 · Xiaolin Bu, Zihao Li, et al. · Lecture notes in computer science · 8
PDF
Designing a Combinatorial Financial Options Market
2021 · Xintong Wang, David M. Pennock, et al. · ACM Conference on Economics and Computation (EC) · 7
PDF
Limitations of Greed: Influence Maximization in Undirected Networks Re-visited
2020 · Grant Schoenebeck, Biaoshuai Tao, et al. · Adaptive Agents and Multi-Agents Systems · 7
PDF
The Wisdom of Strategic Voting
2023 · Qishen Han, Grant Schoenebeck, et al. · ACM Conference on Economics and Computation (EC) · 6
PDF
Influence Maximization on Undirected Graphs
2019 · Grant Schoenebeck, Biaoshuai Tao · ACM Conference on Economics and Computation (EC) · 6
PDF
Logarithmic Comparison-Based Query Complexity for Fair Division of Indivisible Goods
2026 · Xiaolin Bu, Zihao Li, et al. · Lecture notes in computer science · 5
PDF
Truthful and Almost Envy-Free Mechanism of Allocating Indivisible Goods: the Power of Randomness
2025 · Xiaolin Bu, Biaoshuai Tao · Annual Symposium on Foundations of Computer Science · 5
PDF
Wisdom of the Crowd Voting: Truthful Aggregation of Voter Information and Preferences
2021 · Schoenebeck, Grant, Tao, Biaoshuai · arXiv (Cornell University) · 5
PDF
Works count: 72
Citation count: 429
H-index: 11
I10-index: 13
Year
Topic
Type