Optimal Proportional Cake Cutting with Connected Pieces. - Xiaohui Bei; Ning Chen 005; Xia Hua; Biaoshuai Tao; Endong Yang (AAAI, 2012)

Improving the Biclique Cryptanalysis of AES. - Biaoshuai Tao; Hongjun Wu 001 (ACISP, 2015)

Cake Cutting: Envy and Truth. - Xiaohui Bei; Ning Chen 005; Guangda Huzhang; Biaoshuai Tao; Jiajun Wu 003 (IJCAI, 2017)

Improving K-Subspaces via Coherence Pursuit. - Andrew Gitlin; Biaoshuai Tao; Laura Balzano; John Lipor (IEEE J. Sel. Top. Signal Process., 2018)

Influence Maximization on Undirected Graphs: Towards Closing the (1-1/e) Gap. - Grant Schoenebeck; Biaoshuai Tao (EC, 2019)

Outsourcing Computation: The Minimal Refereed Mechanism. - Yuqing Kong; Chris Peikert; Grant Schoenebeck; Biaoshuai Tao (WINE, 2019)

Beyond Worst-case (In)approximability of Nonsubmodular Influence Maximization. - Grant Schoenebeck; Biaoshuai Tao (ACM Trans. Comput. Theory, 2019)

Information Elicitation Mechanisms for Statistical Estimation. - Yuqing Kong; Grant Schoenebeck; Biaoshuai Tao; Fang-Yi Yu (AAAI, 2020)

Limitations of Greed: Influence Maximization in Undirected Networks Re-visited. - Grant Schoenebeck; Biaoshuai Tao; Fang-Yi Yu (AAMAS, 2020)

Influence Maximization on Undirected Graphs: Toward Closing the (1-1/e) Gap. - Grant Schoenebeck; Biaoshuai Tao (ACM Trans. Economics and Comput., 2020)

Complexity, Algorithms, and Heuristics of Influence Maximization. - Biaoshuai Tao (2020)

Cooperation in Threshold Public Projects with Binary Actions. - Yiling Chen 001; Biaoshuai Tao; Fang-Yi Yu (IJCAI, 2021)

Wisdom of the Crowd Voting: Truthful Aggregation of Voter Information and Preferences. - Grant Schoenebeck; Biaoshuai Tao (NeurIPS, 2021)

Designing a Combinatorial Financial Options Market. - Xintong Wang 002; David M. Pennock; Nikhil R. Devanur; David M. Rothschild; Biaoshuai Tao; Michael P. Wellman (EC, 2021)

On Existence of Truthful Fair Cake Cutting Mechanisms. - Biaoshuai Tao (EC, 2022)

On the Complexity of Maximizing Social Welfare within Fair Allocations of Indivisible Goods. - Xiaolin Bu; Zihao Li 002; Shengxin Liu; Jiaxin Song; Biaoshuai Tao (CoRR, 2022)

Think globally, act locally: On the optimal seeding for nonsubmodular influence maximization. - Grant Schoenebeck; Biaoshuai Tao; Fang-Yi Yu (Inf. Comput., 2022)

Adaptive Greedy versus Non-adaptive Greedy for Influence Maximization. - Wei Chen 013; Binghui Peng; Grant Schoenebeck; Biaoshuai Tao (J. Artif. Intell. Res., 2022)

Fair Division with Prioritized Agents. - Xiaolin Bu; Zihao Li 002; Shengxin Liu; Jiaxin Song; Biaoshuai Tao (AAAI, 2023)

Average Envy-freeness for Indivisible Items. - Qishen Han; Biaoshuai Tao; Lirong Xia (EAAMO, 2023)

Truthful Fair Mechanisms for Allocating Mixed Divisible and Indivisible Goods. - Zihao Li 002; Shengxin Liu; Xinhang Lu; Biaoshuai Tao (IJCAI, 2023)

The Wisdom of Strategic Voting. - Qishen Han; Grant Schoenebeck; Biaoshuai Tao; Lirong Xia (EC, 2023)

Fair Division with Allocator's Preference. - Xiaolin Bu; Zihao Li 002; Shengxin Liu; Jiaxin Song; Biaoshuai Tao (WINE, 2023)

Incentive Ratios for Fairly Allocating Indivisible Goods: Simple Mechanisms Prevail. - Biaoshuai Tao; Mingwei Yang 002 (CoRR, 2023)

On existence of truthful fair cake cutting mechanisms. - Xiaolin Bu; Jiaxin Song; Biaoshuai Tao (Artif. Intell., 2023)

Fair Allocation of Items in Multiple Regions. - Houyu Zhou; Tianze Wei; Biaoshuai Tao; Minming Li (AAAI, 2024)

A Complete Landscape for the Price of Envy-Freeness. - Zihao Li 002; Shengxin Liu; Xinhang Lu; Biaoshuai Tao; Yichen Tao (AAMAS, 2024)

Fair Division of Indivisible Goods with Comparison-Based Queries. - Xiaolin Bu; Zihao Li 002; Shengxin Liu; Jiaxin Song; Biaoshuai Tao (CoRR, 2024)

Truthful and Almost Envy-Free Mechanism of Allocating Indivisible Goods: the Power of Randomness. - Xiaolin Bu; Biaoshuai Tao (CoRR, 2024)

Best-of-Both-Worlds Fair Allocation of Indivisible and Mixed Goods. - Xiaolin Bu; Zihao Li 002; Shengxin Liu; Xinhang Lu; Biaoshuai Tao (CoRR, 2024)

Aggregation of Antagonistic Contingent Preferences: When Is It Possible? - Xiaotie Deng; Biaoshuai Tao; Ying Wang (CoRR, 2024)

A Thorough Comparison Between Independent Cascade and Susceptible-Infected-Recovered Models. - Panfeng Liu; Guoliang Qiu 001; Biaoshuai Tao; Kuan Yang 001 (AAAI, 2025)

Parameterized Complexity of Influence Maximization. - Panfeng Liu; Biaoshuai Tao (COCOON (2), 2025)

The Degree of (Extended) Justified Representation and Its Optimization. - Biaoshuai Tao; Chengkai Zhang; Houyu Zhou (AAMAS, 2025)

When is Truthfully Allocating Chores No Harder Than Goods? - Bo Li 037; Biaoshuai Tao; Fangxiao Wang 002; Xiaowei Wu 001; Mingwei Yang 002; Shengwei Zhou 002 (SAGT, 2025)

Approximability Landscape of Welfare Maximization within Fair Allocations. - Xiaolin Bu; Zihao Li 002; Shengxin Liu; Jiaxin Song; Biaoshuai Tao (EC, 2025)

It's Not All Black and White: Degree of Truthfulness for Risk-Avoiding Agents. - Eden Hartman; Erel Segal-Halevi; Biaoshuai Tao (EC, 2025)

Strong Equilibria in Bayesian Games with Bounded Group Size. - Qishen Han; Grant Schoenebeck; Biaoshuai Tao; Lirong Xia (WWW, 2025)

The incentive guarantees behind Nash welfare in divisible resources allocation. - Xiaohui Bei; Biaoshuai Tao; Jiajun Wu 003; Mingwei Yang 002 (Artif. Intell., 2025)

On the existence of EFX (and Pareto-optimal) allocations for binary chores. - Biaoshuai Tao; Xiaowei Wu 001; Ziqi Yu; Shengwei Zhou 002 (Theor. Comput. Sci., 2025)

The Art of Two-Round Voting. - Qishen Han; Grant Schoenebeck; Biaoshuai Tao; Lirong Xia (CoRR, 2025)

Aggregating Information and Preferences with Bounded-Size Deviations. - Qishen Han; Grant Schoenebeck; Biaoshuai Tao; Lirong Xia (CoRR, 2025)

Online MMS Allocation for Chores. - Jiaxin Song; Biaoshuai Tao; Wenqian Wang; Yuhao Zhang (CoRR, 2025)

On Pareto-Optimal and Fair Allocations with Personalized Bi-Valued Utilities. - Jiarong Jin; Biaoshuai Tao (CoRR, 2025)