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

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

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

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

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

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

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

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

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

When is Truthfully Allocating Chores no Harder than Goods? - Li, Bo; Tao, Biaoshuai; Wang, Fangxiao; Wu, Xiaowei; Yang, Mingwei; Zhou, Shengwei (CoRR, 2025)

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

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

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

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

On the Existence of EFX (and Pareto-Optimal) Allocations for Binary Chores. - Tao, Biaoshuai; Wu, Xiaowei; Yu, Ziqi; Zhou, Shengwei (2024)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

The Incentive Guarantees Behind Nash Welfare in Divisible Resources Allocation. - Bei, Xiaohui; Tao, Biaoshuai; Wu, Jiajun; Yang, Mingwei (CoRR, 2023)

On the Existence of EFX (and Pareto-Optimal) Allocations for Binary Chores. - Tao, Biaoshuai; Wu, Xiaowei; Yu, Ziqi; Zhou, Shengwei (CoRR, 2023)

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

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

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

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

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

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

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

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

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

On Existence of Truthful Fair Cake Cutting Mechanisms. - Tao, Biaoshuai (CoRR, 2021)

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

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

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

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

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

Adaptive Greedy versus Non-Adaptive Greedy for Influence Maximization. - Chen, Wei; Peng, Binghui; Schoenebeck, Grant; Tao, Biaoshuai (2020)

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

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

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

Think Globally, Act Locally: On the Optimal Seeding for Nonsubmodular Influence Maximization. - Schoenebeck, Grant; Tao, Biaoshuai; Yu, Fang-Yi (CoRR, 2020)

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

Think Globally, Act Locally: On the Optimal Seeding for Nonsubmodular Influence Maximization. - Schoenebeck, Grant; Tao, Biaoshuai; Yu, Fang-Yi (2019)

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

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

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

Adaptive Greedy versus Non-adaptive Greedy for Influence Maximization. - Chen, Wei; Peng, Binghui; Schoenebeck, Grant; Tao, Biaoshuai (CoRR, 2019)

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

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

Beyond Worst-Case (In)approximability of Nonsubmodular Influence Maximization. - Schoenebeck, Grant; Tao, Biaoshuai (2017)

Beyond Worst-Case (In)approximability of Nonsubmodular Influence Maximization. - Schoenebeck, Grant; Tao, Biaoshuai (CoRR, 2017)

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

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