Biaoshuai Tao
陶表帅

Assistant Professor
John Hopcroft Center for Computer Science
Shanghai Jiao Tong University
Email: bstao[at]sjtu[dot]edu[dot]cn

 

I received my Ph.D. in the Computer Science and Engineering Division at the University of Michigan, Ann Arbor. My advisor was Professor Grant Schoenebeck. I received my bachelor degree in mathematics from Nanyang Technological University.

 

My research interests are mainly in the interdisciplinary area between theoretical computer science and economics, including social network analyses, resource allocation problems and algorithmic game theory.

Teaching:

I am going to teach AI2615: Design and Analysis of Algorithms (算法设计与分析) in the coming fall semester (Fall 2021), jointly with Professor Yuhao Zhang. More information is coming soon.

Professional Service:

Session Chair: IJTCS'21

PC Member: AAAI'21, AAAI'22

Working Papers:

On Existence of Truthful Fair Cake Cutting Mechanisms
Biaoshuai Tao
arXiv version

Publications:

By international convention, authors for papers in theoretical computer science are ordered alphabetically. Asterisk indicates papers in theoretical computer science where alphabetical authorship is used.

Wisdom of the Crowd Voting: Truthful Aggregation of Voter Information and Preferences
*Grant Schoenebeck, Biaoshuai Tao
NeurIPS'21 (Forthcoming), arXiv full version

Designing a Combinatorial Financial Options Market
Xintong Wang, David Pennock, Nikhil R. Devanur, David Rothschild, Biaoshuai Tao, Michael Wellman
EC'21, arXiv full version

Cooperation in Threshold Public Projects with Binary Actions
*Yiling Chen, Biaoshuai Tao, Fang-Yi Yu
IJCAI'21, arXiv full version

Influence Maximization on Undirected Graphs: Towards Closing the (1-1/e) Gap​​​
*Grant Schoenebeck, Biaoshuai Tao
TEAC'20 (journal full version), EC'19 (conference version), video presentation

Limitations of Greed: Influence Maximization in Undirected Networks Re-visited​​​​​​
​*Grant Schoenebeck, Biaoshuai Tao, Fang-Yi Yu
AAMAS'20, arXiv full version

Adaptive Greedy versus Non-adaptive Greedy for Influence Maximization​​​
*Wei Chen, Binghui Peng, Grant Schoenebeck, Biaoshuai Tao
AAAI'20, arXiv full version

Information Elicitation Mechanisms for Statistical Estimation​​​
*Yuqing Kong, Grant Schoenebeck, Biaoshuai Tao, Fang-Yi Yu
AAAI'20

Outsourcing Computation: the Minimal Refereed Mechanism​​​
​*Yuqing Kong, Chris Peikert, Grant Schoenebeck, Biaoshuai Tao
WINE'19, arXiv full version

Think Globally, Act Locally: On the Optimal Seeding for Nonsubmodular Influence Maximization​​​​​​
​*Grant Schoenebeck, Biaoshuai Tao, Fang-Yi Yu
RANDOM'19, arXiv full version

Beyond Worst-Case (In)approximability of Nonsubmodular Influence Maximization​​​​​​​​​
​*Grant Schoenebeck, Biaoshuai Tao
TOCT'19 (journal full version), WINE'17 (conference version), arXiv version

Improving K-Subspaces via Coherence Pursuit​​​
Andrew Gitlin, Biaoshuai Tao, Laura Balzano, John Lipor
IEEE: Journal of Selected Topics in Signal Processing, 2018; Technical report appendix: "On the Hardness of K-Subspaces​​​", by Biaoshuai Tao and Laura Balzano

Cake Cutting: Envy and Truth​​​​
​*Xiaohui Bei, Ning Chen, Guangda Huzhang, Biaoshuai Tao, Jiajun Wu
IJCAI'17

Improving the Biclique Cryptanalysis of AES​​​​
Biaoshuai Tao, Hongjun Wu
ACISP'15

On Computational Complexity of Plane Curve Invariants​​​​
*Fedor Duzhin, Biaoshuai Tao
Online Journal of Analytic Combinatorics, 2014

Optimal Proportional Cake Cutting with Connected Pieces​​​​
*Xiaohui Bei, Ning Chen, Xia Hua, Biaoshuai Tao, Endong Yang
AAAI'12