Bo Li's Homepage

Assistant Professor
Department of Computing
The Hong Kong Polytechnic University
Hung Hom, Kowloon, Hong Kong

Office: PQ 834, Mong Man Wai Building
Tel: (852) 2766 7255

Short Bio

Before joining Comp@PolyU, I was a Postdoctoral Fellow working with Edith Elkind in the Department of Computer Science at University of Oxford and with Evdokia Nikolova in the Department of Electrical and Computer Engineering at University of Texas at Austin.

I received my PhD from the Department of Computer Science at Stony Brook University, under the supervision of Jing Chen. I completed my B.S. in Applied Maths and M.S. in Operations Research at Ocean University of China, under the supervision of Qizhi Fang.


We regularly have several positions for Postdoc, Phd, and Research Assistant (Visiting Scholar) each year.

If you are interested in my research and want to join our group, please don't hesitate to send me an email with your CV.

Research Interests

I am broadly interested in algorithms, AI and computational economics, including problems related to

Group Members

Recent Publications (Full List)


  • Two-facility Location Games with Minimum Distance Requirement.   Joint work with Xinping Xu, Minming Li and Lingjie Duan, JAIR 2021.
  • Efficient Approximations for the Online Dispersion Problem.   Joint work with Jing Chen and Yingkai Li, SICOMP 2019.
  • Conferences

  • Maximal Information Propagation via Lotteries.   Joint work with Jing Chen, WINE 2021.
  • Fair Scheduling for Time-dependent Resources.   Joint work with Minming Li and Ruilong Zhang, NeurIPS 2021.
  • Approximate Group Fairness for Clustering.   Joint work with Lijun Li, Ankang Sun, Chenhao Wang and Yingfan Wang, ICML 2021.
  • Mechanism Design for Facility Location Problem: A Survey.   Joint work with Hau Chan, Aris Filos-Ratsikas, Minming Li and Chenhao Wang, IJCAI 2021.
  • Budget-feasible Maximum Nash Social Welfare is Almost Envy-free.   Joint work with Xiaowei Wu and Jiarui Gan, IJCAI 2021.
  • Approximate and Strategyproof Maximin Share Allocation of Chores with Ordinal Preferences.   Joint work with Haris Aziz and Xiaowei Wu, COMSOC 2021.
  • Multi-Robot Task Allocation -- Complexity and Approximation.   Joint work with Haris Aziz, Hau Chan, Agnes Cseh, Fahimeh Ramezani and Chenhao Wang, AAMAS 2021.


  • PC Member: AAAI'20, AAMAS'20, ICALP-IJTCS'20, AAMAS'21, KDD'21, ICML'21, IJTCS'21, AAMAS'22, AAAI'22, IJCAI'22, SDM'22, TheWebConf'22
  • Journal Reviewer: Artificial Intelligence, Operations Research, Games and Economic Behavior, Transactions on Economics and Computation, Theoretical Computer Science, Journal of Artificial Intelligence Research, Journal of Autonomous Agents and Multi-Agent Systems


  • COMP 3011 Design and Analysis of Algorithms, Fall 2021 (The Hong Kong Polytechnic University)
  • COMP 6701 Advanced Topics in Computer Algorithms, Fall 2021 (The Hong Kong Polytechnic University)
  • COMP 6702 Advanced Topics in Computation Theory, Spring 2021 (The Hong Kong Polytechnic University)
  • COMP 6705 Advanced Topics in System Modeling and Evaluation, Fall 2020 (The Hong Kong Polytechnic University)
  • Computational Game Theory (undergraduate level), Spring 2020, Fall 2019 (University of Oxford)
  • Computational Game Theory (graduate level), Spring 2020 (University of Oxford)