Biaoshuai Tao

Orcid: 0000-0003-4098-844X

According to our database1, Biaoshuai Tao authored at least 51 papers between 2012 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Fair division with prioritized agents.
Inf. Comput., 2026

The Art of Two-Round Voting.
Proceedings of the ACM Web Conference 2026, 2026

Aggregating Information and Preferences under Different Coordination Ability.
Proceedings of the ACM Web Conference 2026, 2026

Likelihood of the Existence of Average Justified Representation.
Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, 2026

2025
Online MMS Allocation for Chores.
CoRR, July, 2025

Aggregating Information and Preferences with Bounded-Size Deviations.
CoRR, May, 2025

The incentive guarantees behind Nash welfare in divisible resources allocation.
Artif. Intell., 2025

Strong Equilibria in Bayesian Games with Bounded Group Size.
Proceedings of the ACM on Web Conference 2025, 2025

New Concentration Bounds and Their Applications in Online Resource Allocation.
Proceedings of the Web and Internet Economics - 21st International Conference, 2025

On Pareto-Optimal and Fair Allocations with Personalized Bi-Valued Utilities.
Proceedings of the Web and Internet Economics - 21st International Conference, 2025

Incentive Analysis of Collusion in Fair Division.
Proceedings of the Web and Internet Economics - 21st International Conference, 2025

It's Not All Black and White: Degree of Truthfulness for Risk-Avoiding Agents.
Proceedings of the 26th ACM Conference on Economics and Computation, 2025

Approximability Landscape of Welfare Maximization within Fair Allocations.
Proceedings of the 26th ACM Conference on Economics and Computation, 2025

When is Truthfully Allocating Chores No Harder Than Goods?
Proceedings of the Algorithmic Game Theory - 18th International Symposium, 2025

The Degree of (Extended) Justified Representation and Its Optimization.
Proceedings of the 24th International Conference on Autonomous Agents and Multiagent Systems, 2025

Truthful and Almost Envy-Free Mechanism of Allocating Indivisible Goods: the Power of Randomness.
Proceedings of the 66th IEEE Annual Symposium on Foundations of Computer Science, 2025

Parameterized Complexity of Influence Maximization.
Proceedings of the Computing and Combinatorics, 2025

A Thorough Comparison Between Independent Cascade and Susceptible-Infected-Recovered Models.
Proceedings of the Thirty-Ninth AAAI Conference on Artificial Intelligence, 2025

2024
Fair Division of Indivisible Goods with Comparison-Based Queries.
CoRR, 2024

Fair and Almost Truthful Mechanisms for Additive Valuations and Beyond.
Proceedings of the Web and Internet Economics - 20th International Conference, 2024

Aggregation of Antagonistic Contingent Preferences: When Is It Possible?
Proceedings of the Web and Internet Economics - 20th International Conference, 2024

Logarithmic Comparison-Based Query Complexity for Fair Division of Indivisible Goods.
Proceedings of the Web and Internet Economics - 20th International Conference, 2024

Best-of-Both-Worlds Fair Allocation of Indivisible and Mixed Goods.
Proceedings of the Web and Internet Economics - 20th International Conference, 2024

On the Existence of EFX (and Pareto-Optimal) Allocations for Binary Chores.
Proceedings of the Frontiers of Algorithmics - 18th International Joint Conference, 2024

A Complete Landscape for the Price of Envy-Freeness.
Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, 2024

Fair Allocation of Items in Multiple Regions.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
On existence of truthful fair cake cutting mechanisms.
Artif. Intell., June, 2023

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

Fair Division with Allocator's Preference.
Proceedings of the Web and Internet Economics - 19th International Conference, 2023

The Wisdom of Strategic Voting.
Proceedings of the 24th ACM Conference on Economics and Computation, 2023

Truthful Fair Mechanisms for Allocating Mixed Divisible and Indivisible Goods.
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

Average Envy-freeness for Indivisible Items.
Proceedings of the 3rd ACM Conference on Equity and Access in Algorithms, 2023

Fair Division with Prioritized Agents.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

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

On Existence of Truthful Fair Cake Cutting Mechanisms.
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.
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.
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.
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

2020
Complexity, Algorithms, and Heuristics of Influence Maximization.
PhD thesis, 2020

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

Limitations of Greed: Influence Maximization in Undirected Networks Re-visited.
Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020

Information Elicitation Mechanisms for Statistical Estimation.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

Adaptive Greedy versus Non-Adaptive Greedy for Influence Maximization.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019
Outsourcing Computation: The Minimal Refereed Mechanism.
Proceedings of the Web and Internet Economics - 15th International Conference, 2019

Influence Maximization on Undirected Graphs: Towards Closing the (1-1/e) Gap.
Proceedings of the 2019 ACM Conference on Economics and Computation, 2019

Think Globally, Act Locally: On the Optimal Seeding for Nonsubmodular Influence Maximization.
Proceedings of the Approximation, 2019

2018
Improving K-Subspaces via Coherence Pursuit.
IEEE J. Sel. Top. Signal Process., 2018

2017
Beyond Worst-Case (In)approximability of Nonsubmodular Influence Maximization.
Proceedings of the Web and Internet Economics - 13th International Conference, 2017

Cake Cutting: Envy and Truth.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

2015
Improving the Biclique Cryptanalysis of AES.
Proceedings of the Information Security and Privacy - 20th Australasian Conference, 2015

2012
Optimal Proportional Cake Cutting with Connected Pieces.
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012


  Loading...