Biaoshuai Tao

According to our database, Biaoshuai Tao authored at least 34 papers between 2012 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

Aggregation of Antagonistic Contingent Preferences: When Is It Possible?

Xiaotie Deng, Biaoshuai Tao, Ying Wang

CoRR, 2024

Best-of-Both-Worlds Fair Allocation of Indivisible and Mixed Goods.

Xiaolin Bu, Zihao Li, Shengxin Liu, Xinhang Lu, Biaoshuai Tao

CoRR, 2024

A Thorough Comparison Between Independent Cascade and Susceptible-Infected-Recovered Models.

Panfeng Liu, Guoliang Qiu, Biaoshuai Tao, Kuan Yang

CoRR, 2024

Truthful and Almost Envy-Free Mechanism of Allocating Indivisible Goods: the Power of Randomness.

Xiaolin Bu, Biaoshuai Tao

CoRR, 2024

Fair Division of Indivisible Goods with Comparison-Based Queries.

Xiaolin Bu, Zihao Li, Shengxin Liu, Jiaxin Song, Biaoshuai Tao

CoRR, 2024

A Complete Landscape for the Price of Envy-Freeness.

Zihao Li, Shengxin Liu, Xinhang Lu, Biaoshuai Tao, Yichen Tao

Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, 2024

Fair Allocation of Items in Multiple Regions.

Houyu Zhou, Tianze Wei, Biaoshuai Tao, Minming Li

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023

On existence of truthful fair cake cutting mechanisms.

Xiaolin Bu, Jiaxin Song, Biaoshuai Tao

Artif. Intell., June, 2023

On the Existence of EFX (and Pareto-Optimal) Allocations for Binary Chores.

Biaoshuai Tao, Xiaowei Wu, Ziqi Yu, Shengwei Zhou

CoRR, 2023

The Incentive Guarantees Behind Nash Welfare in Divisible Resources Allocation.

Xiaohui Bei, Biaoshuai Tao, Jiajun Wu, Mingwei Yang

CoRR, 2023

Incentive Ratios for Fairly Allocating Indivisible Goods: Simple Mechanisms Prevail.

Biaoshuai Tao, Mingwei Yang

CoRR, 2023

Fair Division with Allocator's Preference.

Xiaolin Bu, Zihao Li, Shengxin Liu, Jiaxin Song, Biaoshuai Tao

Proceedings of the Web and Internet Economics - 19th International Conference, 2023

The Wisdom of Strategic Voting.

Qishen Han, Grant Schoenebeck, Biaoshuai Tao, Lirong Xia

Proceedings of the 24th ACM Conference on Economics and Computation, 2023

Truthful Fair Mechanisms for Allocating Mixed Divisible and Indivisible Goods.

Zihao Li, Shengxin Liu, Xinhang Lu, Biaoshuai Tao

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

Average Envy-freeness for Indivisible Items.

Qishen Han, Biaoshuai Tao, Lirong Xia

Proceedings of the 3rd ACM Conference on Equity and Access in Algorithms, 2023

Fair Division with Prioritized Agents.

Xiaolin Bu, Zihao Li, Shengxin Liu, Jiaxin Song, Biaoshuai Tao

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

Adaptive Greedy versus Non-adaptive Greedy for Influence Maximization.

Wei Chen, Binghui Peng, Grant Schoenebeck, Biaoshuai Tao

J. Artif. Intell. Res., 2022

Think globally, act locally: On the optimal seeding for nonsubmodular influence maximization.

Grant Schoenebeck, Biaoshuai Tao, Fang-Yi Yu

Inf. Comput., 2022

On the Complexity of Maximizing Social Welfare within Fair Allocations of Indivisible Goods.

Xiaolin Bu, Zihao Li, Shengxin Liu, Jiaxin Song, Biaoshuai Tao

CoRR, 2022

On Existence of Truthful Fair Cake Cutting Mechanisms.

Biaoshuai Tao

Proceedings of the EC '22: The 23rd ACM Conference on Economics and Computation, Boulder, CO, USA, July 11, 2022

2021

Designing a Combinatorial Financial Options Market.

Xintong Wang, David M. Pennock, Nikhil R. Devanur, David M. Rothschild, Biaoshuai Tao, Michael P. Wellman

Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 2021

Wisdom of the Crowd Voting: Truthful Aggregation of Voter Information and Preferences.

Grant Schoenebeck, Biaoshuai Tao

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Cooperation in Threshold Public Projects with Binary Actions.

Yiling Chen, Biaoshuai Tao, Fang-Yi Yu

Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

2020

Complexity, Algorithms, and Heuristics of Influence Maximization.

Biaoshuai Tao

PhD thesis, 2020

Influence Maximization on Undirected Graphs: Toward Closing the (1-1/e) Gap.

Grant Schoenebeck, Biaoshuai Tao

ACM Trans. Economics and Comput., 2020

Limitations of Greed: Influence Maximization in Undirected Networks Re-visited.

Grant Schoenebeck, Biaoshuai Tao, Fang-Yi Yu

Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020

Information Elicitation Mechanisms for Statistical Estimation.

Yuqing Kong, Grant Schoenebeck, Biaoshuai Tao, Fang-Yi Yu

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019

Beyond Worst-case (In)approximability of Nonsubmodular Influence Maximization.

Grant Schoenebeck, Biaoshuai Tao

ACM Trans. Comput. Theory, 2019

Outsourcing Computation: The Minimal Refereed Mechanism.

Yuqing Kong, Chris Peikert, Grant Schoenebeck, Biaoshuai Tao

Proceedings of the Web and Internet Economics - 15th International Conference, 2019

Influence Maximization on Undirected Graphs: Towards Closing the (1-1/e) Gap.

Grant Schoenebeck, Biaoshuai Tao

Proceedings of the 2019 ACM Conference on Economics and Computation, 2019

2018

Improving K-Subspaces via Coherence Pursuit.

Andrew Gitlin, Biaoshuai Tao, Laura Balzano, John Lipor

IEEE J. Sel. Top. Signal Process., 2018

2017

Cake Cutting: Envy and Truth.

Xiaohui Bei, Ning Chen, Guangda Huzhang, Biaoshuai Tao, Jiajun Wu

Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

2015

Improving the Biclique Cryptanalysis of AES.

Biaoshuai Tao, Hongjun Wu

Proceedings of the Information Security and Privacy - 20th Australasian Conference, 2015

2012

Optimal Proportional Cake Cutting with Connected Pieces.

Xiaohui Bei, Ning Chen, Xia Hua, Biaoshuai Tao, Endong Yang

Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012