default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBiaoshuai Tao
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2020
[b1]Biaoshuai Tao:
Complexity, Algorithms, and Heuristics of Influence Maximization. University of Michigan, USA, 2020
Journal Articles
- 2023
- [j6]Xiaolin Bu, Jiaxin Song, Biaoshuai Tao:
On existence of truthful fair cake cutting mechanisms. Artif. Intell. 319: 103904 (2023) - 2022
- [j5]Grant Schoenebeck
, Biaoshuai Tao, Fang-Yi Yu:
Think globally, act locally: On the optimal seeding for nonsubmodular influence maximization. Inf. Comput. 285(Part): 104919 (2022) - [j4]Wei Chen, Binghui Peng, Grant Schoenebeck, Biaoshuai Tao:
Adaptive Greedy versus Non-adaptive Greedy for Influence Maximization. J. Artif. Intell. Res. 74: 303-351 (2022) - 2020
- [j3]Grant Schoenebeck, Biaoshuai Tao:
Influence Maximization on Undirected Graphs: Toward Closing the (1-1/e) Gap. ACM Trans. Economics and Comput. 8(4): 22:1-22:36 (2020) - 2019
- [j2]Grant Schoenebeck, Biaoshuai Tao:
Beyond Worst-case (In)approximability of Nonsubmodular Influence Maximization. ACM Trans. Comput. Theory 11(3): 12:1-12:56 (2019) - 2018
- [j1]Andrew Gitlin, Biaoshuai Tao, Laura Balzano, John Lipor:
Improving K-Subspaces via Coherence Pursuit. IEEE J. Sel. Top. Signal Process. 12(6): 1575-1588 (2018)
Conference and Workshop Papers
- 2024
- [c21]Houyu Zhou, Tianze Wei, Biaoshuai Tao, Minming Li:
Fair Allocation of Items in Multiple Regions. AAAI 2024: 9985-9992 - [c20]Zihao Li, Shengxin Liu, Xinhang Lu, Biaoshuai Tao, Yichen Tao:
A Complete Landscape for the Price of Envy-Freeness. AAMAS 2024: 1183-1191 - 2023
- [c19]Xiaolin Bu, Zihao Li, Shengxin Liu, Jiaxin Song, Biaoshuai Tao:
Fair Division with Prioritized Agents. AAAI 2023: 5540-5548 - [c18]Qishen Han, Biaoshuai Tao, Lirong Xia:
Average Envy-freeness for Indivisible Items. EAAMO 2023: 9:1-9:9 - [c17]Zihao Li, Shengxin Liu, Xinhang Lu, Biaoshuai Tao:
Truthful Fair Mechanisms for Allocating Mixed Divisible and Indivisible Goods. IJCAI 2023: 2808-2816 - [c16]Qishen Han, Grant Schoenebeck, Biaoshuai Tao, Lirong Xia:
The Wisdom of Strategic Voting. EC 2023: 885-905 - [c15]Xiaolin Bu, Zihao Li, Shengxin Liu, Jiaxin Song, Biaoshuai Tao:
Fair Division with Allocator's Preference. WINE 2023: 77-94 - 2022
- [c14]Biaoshuai Tao:
On Existence of Truthful Fair Cake Cutting Mechanisms. EC 2022: 404-434 - 2021
- [c13]Yiling Chen, Biaoshuai Tao, Fang-Yi Yu:
Cooperation in Threshold Public Projects with Binary Actions. IJCAI 2021: 104-110 - [c12]Grant Schoenebeck, Biaoshuai Tao:
Wisdom of the Crowd Voting: Truthful Aggregation of Voter Information and Preferences. NeurIPS 2021: 1872-1883 - [c11]Xintong Wang, David M. Pennock, Nikhil R. Devanur, David M. Rothschild, Biaoshuai Tao, Michael P. Wellman:
Designing a Combinatorial Financial Options Market. EC 2021: 864-883 - 2020
- [c10]Wei Chen, Binghui Peng, Grant Schoenebeck, Biaoshuai Tao:
Adaptive Greedy versus Non-Adaptive Greedy for Influence Maximization. AAAI 2020: 590-597 - [c9]Yuqing Kong, Grant Schoenebeck, Biaoshuai Tao, Fang-Yi Yu:
Information Elicitation Mechanisms for Statistical Estimation. AAAI 2020: 2095-2102 - [c8]Grant Schoenebeck, Biaoshuai Tao, Fang-Yi Yu:
Limitations of Greed: Influence Maximization in Undirected Networks Re-visited. AAMAS 2020: 1224-1232 - 2019
- [c7]Grant Schoenebeck, Biaoshuai Tao, Fang-Yi Yu:
Think Globally, Act Locally: On the Optimal Seeding for Nonsubmodular Influence Maximization. APPROX-RANDOM 2019: 39:1-39:20 - [c6]Grant Schoenebeck, Biaoshuai Tao:
Influence Maximization on Undirected Graphs: Towards Closing the (1-1/e) Gap. EC 2019: 423-453 - [c5]Yuqing Kong, Chris Peikert, Grant Schoenebeck, Biaoshuai Tao:
Outsourcing Computation: The Minimal Refereed Mechanism. WINE 2019: 256-270 - 2017
- [c4]Xiaohui Bei, Ning Chen, Guangda Huzhang, Biaoshuai Tao, Jiajun Wu:
Cake Cutting: Envy and Truth. IJCAI 2017: 3625-3631 - [c3]Grant Schoenebeck, Biaoshuai Tao:
Beyond Worst-Case (In)approximability of Nonsubmodular Influence Maximization. WINE 2017: 368-382 - 2015
- [c2]Biaoshuai Tao, Hongjun Wu:
Improving the Biclique Cryptanalysis of AES. ACISP 2015: 39-56 - 2012
- [c1]Xiaohui Bei, Ning Chen, Xia Hua, Biaoshuai Tao, Endong Yang:
Optimal Proportional Cake Cutting with Connected Pieces. AAAI 2012: 1263-1269
Informal and Other Publications
- 2024
- [i22]Zihao Li, Shengxin Liu, Xinhang Lu, Biaoshuai Tao, Yichen Tao:
A Complete Landscape for the Price of Envy-Freeness. CoRR abs/2401.01516 (2024) - [i21]Xiaolin Bu, Zihao Li, Shengxin Liu, Jiaxin Song, Biaoshuai Tao:
Fair Division of Indivisible Goods with Comparison-Based Queries. CoRR abs/2404.18133 (2024) - [i20]Xiaolin Bu, Biaoshuai Tao:
Truthful and Almost Envy-Free Mechanism of Allocating Indivisible Goods: the Power of Randomness. CoRR abs/2407.13634 (2024) - [i19]Panfeng Liu, Guoliang Qiu, Biaoshuai Tao, Kuan Yang:
A Thorough Comparison Between Independent Cascade and Susceptible-Infected-Recovered Models. CoRR abs/2408.11470 (2024) - 2023
- [i18]Qishen Han, Biaoshuai Tao, Lirong Xia:
Average Envy-freeness for Indivisible Items. CoRR abs/2301.12653 (2023) - [i17]Zihao Li, Shengxin Liu, Xinhang Lu, Biaoshuai Tao:
Truthful Fair Mechanisms for Allocating Mixed Divisible and Indivisible Goods. CoRR abs/2305.09206 (2023) - [i16]Qishen Han, Grant Schoenebeck, Biaoshuai Tao, Lirong Xia:
The Wisdom of Strategic Voting. CoRR abs/2305.11021 (2023) - [i15]Biaoshuai Tao, Mingwei Yang:
Incentive Ratios for Fairly Allocating Indivisible Goods: Simple Mechanisms Prevail. CoRR abs/2306.15920 (2023) - [i14]Xiaohui Bei, Biaoshuai Tao, Jiajun Wu, Mingwei Yang:
The Incentive Guarantees Behind Nash Welfare in Divisible Resources Allocation. CoRR abs/2308.08903 (2023) - [i13]Biaoshuai Tao, Xiaowei Wu, Ziqi Yu, Shengwei Zhou:
On the Existence of EFX (and Pareto-Optimal) Allocations for Binary Chores. CoRR abs/2308.12177 (2023) - [i12]Xiaolin Bu, Zihao Li, Shengxin Liu, Jiaxin Song, Biaoshuai Tao:
Fair Division with Allocator's Preference. CoRR abs/2310.03475 (2023) - 2022
- [i11]Xiaolin Bu, Zihao Li, Shengxin Liu, Jiaxin Song, Biaoshuai Tao:
On the Complexity of Maximizing Social Welfare within Fair Allocations of Indivisible Goods. CoRR abs/2205.14296 (2022) - [i10]Xiaolin Bu, Zihao Li, Shengxin Liu, Jiaxin Song, Biaoshuai Tao:
Fair Division with Prioritized Agents. CoRR abs/2211.16143 (2022) - 2021
- [i9]Biaoshuai Tao:
On Existence of Truthful Fair Cake Cutting Mechanisms. CoRR abs/2104.07387 (2021) - [i8]Yiling Chen, Biaoshuai Tao, Fang-Yi Yu:
Cooperation in Threshold Public Projects with Binary Actions. CoRR abs/2105.08572 (2021) - [i7]Grant Schoenebeck, Biaoshuai Tao:
Wisdom of the Crowd Voting: Truthful Aggregation of Voter Information and Preferences. CoRR abs/2108.03749 (2021) - [i6]Xintong Wang, David M. Pennock, Nikhil R. Devanur, David M. Rothschild, Biaoshuai Tao, Michael P. Wellman:
Designing a Combinatorial Financial Options Market. CoRR abs/2109.06443 (2021) - 2020
- [i5]Grant Schoenebeck, Biaoshuai Tao, Fang-Yi Yu:
Limitations of Greed: Influence Maximization in Undirected Networks Re-visited. CoRR abs/2002.11679 (2020) - [i4]Grant Schoenebeck, Biaoshuai Tao, Fang-Yi Yu:
Think Globally, Act Locally: On the Optimal Seeding for Nonsubmodular Influence Maximization. CoRR abs/2003.10393 (2020) - 2019
- [i3]Yuqing Kong, Chris Peikert, Grant Schoenebeck, Biaoshuai Tao:
Outsourcing Computation: the Minimal Refereed Mechanism. CoRR abs/1910.14269 (2019) - [i2]Wei Chen, Binghui Peng, Grant Schoenebeck, Biaoshuai Tao:
Adaptive Greedy versus Non-adaptive Greedy for Influence Maximization. CoRR abs/1911.08164 (2019) - 2017
- [i1]Grant Schoenebeck, Biaoshuai Tao:
Beyond Worst-Case (In)approximability of Nonsubmodular Influence Maximization. CoRR abs/1710.02827 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
