I received my Ph.D. in the Computer Science and Engineering Division at the University of Michigan, Ann Arbor. My advisor was Professor Grant Schoenebeck. I received my bachelor degree in mathematics from Nanyang Technological University.
My research interests are mainly in the interdisciplinary area between theoretical computer science and economics, including social network analyses, resource allocation problems and algorithmic game theory.
Panfeng Liu (2022)
Jiarong Jin (2023)
Xiaolin Bu (2025)
Ex: Jiaxin Song (Now Ph.D. student at UIUC), Yichen Tao (Now Ph.D. student at UMich), Ziqi Yu (Now Ph.D. student at UToronto), Jiayin Chen (Now Ph.D. student at SJTU)
Senior: Cheng Peng, Chengkai Zhang
AI2615: Design and Analysis of Algorithms (算法设计与分析): 2021 Fall (jointly with Professor Yuhao Zhang), 2022 Spring, 2022 Fall (jointly with Professor Yuhao Zhang), 2023 Spring, 2023 Fall, 2024 Spring, 2024 Fall.
CS3330: Combinatorics (组合数学): 2022 Fall (jointly with Professor Shuai Li), 2023 Fall.
CS1212: Introduction to Theoretical Computer Science (jointly with Professor Kuan Yang, Professor Yu Yu, Professor Chihao Zhang, and Professor Yuhao Zhang): 2022 Fall, 2023 Fall, 2024 Fall.
Track/Session Chair: IJTCS'21, IJTCS-FAW'22, IJTCS-FAW'23, IJTCS-FAW'24,
SPC Member: WINE'24
PC Member: AAAI'21, AAAI'22, WINE'22, AAAI'23, IJCAI'23, EC'23, WINE'23, AAAI'24, IJCAI'24, EC'24, AAAI'25, IJCAI'25, EC'25,
Local Organizor: WINE'23
Truthful and Almost Envy-Free Mechanism of Allocating Indivisible Goods: the Power of Randomness
*Xiaolin Bu, Biaoshuai Tao
arXiv version
On the Complexity of Maximizing Social Welfare within Fair Allocations of Indivisible Goods
*Xiaolin Bu, Zihao Li, Shengxin Liu, Jiaxin Song, Biaoshuai Tao
arXiv version
Strong Equilibria in Bayesian Games with Bounded Group Size
*Qishen Han, Grant Schoenebeck, Biaoshuai Tao, Lirong Xia
WWW'25, arXiv version
The Degree of (Extended) Justified Representation and Its Optimization
*Biaoshuai Tao, Chengkai Zhang, Houyu Zhou
AAMAS'25, arXiv version
A Thorough Comparison Between Independent Cascade and Susceptible-Infected-Recovered Models
*Panfeng Liu, Guoliang Qiu, Biaoshuai Tao, Kuan Yang
AAAI'25, arXiv version
Aggregation of Antagonistic Contingent Preferences: When Is It Possible?
*Xiaotie Deng, Biaoshuai Tao, Ying Wang
WINE'24 [Best Paper Award], arXiv version
Best-of-Both-Worlds Fair Allocation of Indivisible and Mixed Goods
*Xiaolin Bu, Zihao Li, Shengxin Liu, Xinhang Lu, Biaoshuai Tao
WINE'24, arXiv version
Logarithmic Comparison-Based Query Complexity for Fair Division of Indivisible Goods
*Xiaolin Bu, Zihao Li, Shengxin Liu, Jiaxin Song, Biaoshuai Tao
WINE'24, arXiv version
Fair and Almost Truthful Mechanisms for Additive Valuations and Beyond
*Biaoshuai Tao, Mingwei Yang
WINE'24, arXiv version
On the Existence of EFX (and Pareto-Optimal) Allocations for Binary Chores
*Biaoshuai Tao, Xiaowei Wu, Ziqi Yu, Shengwei Zhou
IJTCS'24, arXiv version
A Complete Landscape for the Price of Envy-Freeness
*Zihao Li, Shengxin Liu, Xinhang Lu, Biaoshuai Tao, Yichen Tao
AAMAS'24
Fair Allocation of Items in Multiple Regions
*Houyu Zhou, Tianze Wei, Biaoshuai Tao, Minming Li (authors ordered reverse alphabetically)
AAAI'24
Fair Division with Allocator's Preference
*Xiaolin Bu, Zihao Li, Shengxin Liu, Jiaxin Song, Biaoshuai Tao
WINE'23, arXiv version
The Incentive Guarantees Behind Nash Welfare in Divisible Resources Allocation
*Xiaohui Bei, Biaoshuai Tao, Jiajun Wu, Mingwei Yang
WINE'23, arXiv version
Average Envy-freeness for Indivisible Items
*Qishen Han, Biaoshuai Tao, Lirong Xia
EAAMO'23, arXiv version
The Wisdom of Strategic Voting
*Qishen Han, Grant Schoenebeck, Biaoshuai Tao, Lirong Xia
EC'23, arXiv version
Truthful Fair Mechanisms for Allocating Mixed Divisible and Indivisible Goods
*Zihao Li, Shengxin Liu, Xinhang Lu, Biaoshuai Tao
IJCAI'23, arXiv version
On Existence of Truthful Fair Cake Cutting Mechanisms
*Xiaolin Bu, Jiaxin Song, Biaoshuai Tao
Artificial Intelligence 2023 (Journal Version), arXiv version
Fair Division with Prioritized Agents
*Xiaolin Bu, Zihao Li, Shengxin Liu, Jiaxin Song, Biaoshuai Tao
AAAI'23, arXiv version
On Existence of Truthful Fair Cake Cutting Mechanisms
*Biaoshuai Tao
EC'22
Think Globally, Act Locally: On the Optimal Seeding for Nonsubmodular Influence Maximization
*Grant Schoenebeck, Biaoshuai Tao, Fang-Yi Yu
Information and Computation 2022
Adaptive Greedy versus Non-adaptive Greedy for Influence Maximization
*Wei Chen, Binghui Peng, Grant Schoenebeck, Biaoshuai Tao
JAIR'22,
arXiv version
Wisdom of the Crowd Voting: Truthful Aggregation of Voter Information and Preferences
*Grant Schoenebeck, Biaoshuai Tao
NeurIPS'21, arXiv full version
Designing a Combinatorial Financial Options Market
Xintong Wang, David Pennock, Nikhil R. Devanur, David Rothschild, Biaoshuai Tao, Michael Wellman
EC'21, arXiv full version
Cooperation in Threshold Public Projects with Binary Actions
*Yiling Chen, Biaoshuai Tao, Fang-Yi Yu
IJCAI'21,
arXiv full version
Influence Maximization on Undirected Graphs: Towards Closing the (1-1/e) Gap
*Grant Schoenebeck, Biaoshuai Tao
TEAC'20 (journal full version), EC'19 (conference version),
video presentation
Limitations of Greed: Influence Maximization in Undirected Networks Re-visited
*Grant Schoenebeck, Biaoshuai Tao, Fang-Yi Yu
AAMAS'20,
arXiv full version
Adaptive Greedy versus Non-adaptive Greedy for Influence Maximization
*Wei Chen, Binghui Peng, Grant Schoenebeck, Biaoshuai Tao
AAAI'20
Information Elicitation Mechanisms for Statistical Estimation
*Yuqing Kong, Grant Schoenebeck, Biaoshuai Tao, Fang-Yi Yu
AAAI'20
Outsourcing Computation: the Minimal Refereed Mechanism
*Yuqing Kong, Chris Peikert, Grant Schoenebeck, Biaoshuai Tao
WINE'19,
arXiv full version
Think Globally, Act Locally: On the Optimal Seeding for Nonsubmodular Influence Maximization
*Grant Schoenebeck, Biaoshuai Tao, Fang-Yi Yu
RANDOM'19,
arXiv full version
Beyond Worst-Case (In)approximability of Nonsubmodular Influence Maximization
*Grant Schoenebeck, Biaoshuai Tao
TOCT'19 (journal full version),
WINE'17 (conference version),
arXiv version
Improving K-Subspaces via Coherence Pursuit
Andrew Gitlin, Biaoshuai Tao, Laura Balzano, John Lipor
IEEE: Journal of Selected Topics in Signal Processing, 2018; Technical report appendix: "On the Hardness of K-Subspaces", by Biaoshuai Tao and Laura Balzano
Cake Cutting: Envy and Truth
*Xiaohui Bei, Ning Chen, Guangda Huzhang, Biaoshuai Tao, Jiajun Wu
IJCAI'17
Improving the Biclique Cryptanalysis of AES
Biaoshuai Tao, Hongjun Wu
ACISP'15
On Computational Complexity of Plane Curve Invariants
*Fedor Duzhin, Biaoshuai Tao
Online Journal of Analytic Combinatorics, 2014
Optimal Proportional Cake Cutting with Connected Pieces
*Xiaohui Bei, Ning Chen, Xia Hua, Biaoshuai Tao, Endong Yang
AAAI'12