Biaoshuai Tao
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Biaoshuai Tao has a total of 50 co-authors. Here are the top co-authors by number of shared publications:
- Grant Schoenebeck
University of Michigan, Ann Arbor, MI, USA
12 shared publications - Shengxin Liu
Shenzhen Key Laboratory of Internet Information Collaboration, School of Computer Science and Technology, Harbin Institute of Technology, Shenzhen, Shenzhen, China
9 shared publications - Zihao Li
Institute of Operations Research and Analytics, National University of Singapore, Singapore 119077
9 shared publications - Lirong Xia
Rutgers University, New Brunswick, NJ, USA
8 shared publications - Mingwei Yang
Stanford University
5 shared publications - Qishen Han
Rutgers University, New Brunswick, NJ, USA
5 shared publications
Latest Publications
- 15 July 2026
- Published by Springer Nature
- p. 423-436
Algorithms and Complexity of Influence Maximization on Directed Acyclic Graphs
- 15 July 2026
- Published by Springer Nature
- p. 423-436
Algorithms and Complexity of Influence Maximization on Directed Acyclic Graphs
- 1 May 2026
- Published by Springer Nature
- p. 521-537
On Pareto-Optimal and Fair Allocations with Personalized Bi-Valued Utilities
- 1 May 2026
- Published by Springer Nature
- p. 521-537
On Pareto-Optimal and Fair Allocations with Personalized Bi-Valued Utilities
- 1 May 2026
- Published by Springer Nature
- p. 669-685
New Concentration Bounds and Their Applications in Online Resource Allocation
- 1 May 2026
- Published by Springer Nature
- p. 669-685
New Concentration Bounds and Their Applications in Online Resource Allocation
- 1 May 2026
- Published by Springer Nature
- p. 392-410
Incentive Analysis of Collusion in Fair Division
- Open Access
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 123-134
Aggregating Information and Preferences under Different Coordination Ability
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 123-134
Open AccessAggregating Information and Preferences under Different Coordination Ability
- Open Access
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 135-145
The Art of Two-Round Voting
We study the voting problem with two alternatives where voters' preferences depend on a not-directly-observable state variable. While equilibria in the one-round voting mechanisms lead to a good decision, they are usually hard to compute and follow. We consider the two-round voting mechanism where the first round serves as a polling stage and the winning alternative only depends on the outcome of the second round. We show that the two-round voting mechanism is a powerful tool for making collective decisions. Firstly, every (approximated) equilibrium in the two-round voting mechanisms (asymptotically) leads to the decision preferred by the majority as if the state of the world were revealed to the voters. Moreover, there exist natural equilibria in the two-round game following intuitive behaviors such as informative voting, sincere voting, and surprisingly popular strategies. This sharply contrasts with the one-round voting mechanisms in the previous literature, where no simple equilibrium is known. Finally, we show that every equilibrium in the standard one-round majority vote mechanism gives an equilibrium in the two-round mechanisms that is not more complicated. Therefore, the two-round voting mechanism provides a natural equilibrium in every instance, including those where one-round voting fails, and it can reach an informed majority decision whenever one-round voting can. Our experiments on LLM voters also imply that two-round voting leads to the correct outcome more often than one-round voting under some circumstances.
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 135-145
Open AccessThe Art of Two-Round Voting
We study the voting problem with two alternatives where voters' preferences depend on a not-directly-observable state variable. While equilibria in the one-round voting mechanisms lead to a good decision, they are usually hard to compute and follow. We consider the two-round voting mechanism where the first round serves as a polling stage and the winning alternative only depends on the outcome of the second round. We show that the two-round voting mechanism is a powerful tool for making collective decisions. Firstly, every (approximated) equilibrium in the two-round voting mechanisms (asymptotically) leads to the decision preferred by the majority as if the state of the world were revealed to the voters. Moreover, there exist natural equilibria in the two-round game following intuitive behaviors such as informative voting, sincere voting, and surprisingly popular strategies. This sharply contrasts with the one-round voting mechanisms in the previous literature, where no simple equilibrium is known. Finally, we show that every equilibrium in the standard one-round majority vote mechanism gives an equilibrium in the two-round mechanisms that is not more complicated. Therefore, the two-round voting mechanism provides a natural equilibrium in every instance, including those where one-round voting fails, and it can reach an informed majority decision whenever one-round voting can. Our experiments on LLM voters also imply that two-round voting leads to the correct outcome more often than one-round voting under some circumstances.
- 26 January 2026
- Published by Elsevier in Information and Computation
- Vol. 309
Fair division with prioritized agents
- 26 January 2026
- Published by Elsevier in Information and Computation
- Vol. 309
Fair division with prioritized agents
- 2 January 2026
- Published by Springer Nature
- p. 348-365
Logarithmic Comparison-Based Query Complexity for Fair Division of Indivisible Goods
- 2 January 2026
- Published by Springer Nature
- p. 348-365
Logarithmic Comparison-Based Query Complexity for Fair Division of Indivisible Goods
- 2 January 2026
- Published by Springer Nature
- p. 3-21
Aggregation of Antagonistic Contingent Preferences: When Is It Possible?
- 2 January 2026
- Published by Springer Nature
- p. 3-21
Aggregation of Antagonistic Contingent Preferences: When Is It Possible?
- 2 January 2026
- Published by Springer Nature
- p. 277-294
Best-of-Both-Worlds Fair Allocation of Indivisible and Mixed Goods
- 2 January 2026
- Published by Springer Nature
- p. 277-294
Best-of-Both-Worlds Fair Allocation of Indivisible and Mixed Goods