Bo Li

Orcid: 0000-0001-7500-8355

Affiliations:
  • Hong Kong Polytechnic University, Department of Computing, Hong Kong
  • University of Texas at Austin, Department of Electrical and Computer Engineering, TX, USA (former)
  • University of Oxford, Department of Computer Science, UK (former)
  • Stony Brook University, Department of Computer Science, NY, USA (former, PhD)
  • Ocean University of China, School of Mathematical Sciences, Qingdao, China (former)


According to our database1, Bo Li authored at least 75 papers between 2015 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Graph Contrastive Learning With Personalized Augmentation.
IEEE Trans. Knowl. Data Eng., November, 2024

Approximate and strategyproof maximin share allocation of chores with ordinal preferences.
Math. Program., January, 2024

Eliciting truthful reports with partial signals in repeated games.
Theor. Comput. Sci., 2024

A Fair Allocation is Approximately Optimal for Indivisible Chores, or Is It?
CoRR, 2024

A Complete Landscape of EFX Allocations of Mixed Manna on Graphs.
CoRR, 2024

RLeXplore: Accelerating Research in Intrinsically-Motivated Reinforcement Learning.
CoRR, 2024

Almost proportional allocations of indivisible chores: Computation, approximation and efficiency.
Artif. Intell., 2024

Fair Surveillance Assignment Problem.
Proceedings of the ACM on Web Conference 2024, 2024

Public Event Scheduling with Busy Agents.
Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

A Complete Landscape of EFX Allocations on Graphs: Goods, Chores and Mixed Manna.
Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

Improved Approximation of Weighted MMS Fairness for Indivisible Chores.
Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

Allocating Contiguous Blocks of Indivisible Chores Fairly: Revisited.
Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, 2024

Fair and Efficient Division of a Discrete Cake with Switching Utility Loss.
Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, 2024

Bounding the Incentive Ratio of the Probabilistic Serial Rule.
Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, 2024

Envy-Free House Allocation under Uncertain Preferences.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
Well-behaved online load balancing against strategic jobs.
J. Sched., October, 2023

Fair division of indivisible goods: Recent progress and open questions.
Artif. Intell., September, 2023

Your College Dorm and Dormmates: Fair Resource Sharing with Externalities.
J. Artif. Intell. Res., 2023

RLLTE: Long-Term Evolution Project of Reinforcement Learning.
CoRR, 2023

On Hill's Worst-Case Guarantee for Indivisible Bads.
CoRR, 2023

Fair Allocation of Indivisible Chores: Beyond Additive Costs.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Maximin-Aware Allocations of Indivisible Chores with Symmetric and Asymmetric Agents.
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

Automatic Intrinsic Reward Shaping for Exploration in Deep Reinforcement Learning.
Proceedings of the International Conference on Machine Learning, 2023

On the Price of Fairness in the Connected Discrete Cake Cutting Problem.
Proceedings of the ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland, 2023

GrowSP: Unsupervised Semantic Segmentation of 3D Point Clouds.
Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2023

Approximation Algorithm for Computing Budget-Feasible EF1 Allocations.
Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

Possible Fairness for Allocating Indivisible Resources.
Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

Proportional Fairness in Obnoxious Facility Location.
Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

Multiagent MST Cover: Pleasing All Optimally via a Simple Voting Rule.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
Algorithmic fair allocation of indivisible items: a survey and new questions.
SIGecom Exch., July, 2022

A note on the online interval scheduling secretary problem.
Oper. Res. Lett., 2022

Discouraging pool block withholding attacks in Bitcoin.
J. Comb. Optim., 2022

Fair Graphical Resource Allocation with Matching-Induced Utilities.
CoRR, 2022

Tackling Visual Control via Multi-View Exploration Maximization.
CoRR, 2022

Rewarding Episodic Visitation Discrepancy for Exploration in Reinforcement Learning.
CoRR, 2022

Fair Division of Indivisible Goods: A Survey.
CoRR, 2022

On the Price of Fairness of Allocating Contiguous Blocks.
CoRR, 2022

Fair Allocation of Indivisible Chores: Beyond Additive Valuations.
CoRR, 2022

Query Efficient Prophet Inequality with Unknown I.I.D. Distributions.
CoRR, 2022

Bayesian auctions with efficient queries.
Artif. Intell., 2022

Almost (Weighted) Proportional Allocations for Indivisible Chores✱✱.
Proceedings of the WWW '22: The ACM Web Conference 2022, Virtual Event, Lyon, France, April 25, 2022

Bayesian Auctions with Efficient Queries (Extended Abstract).
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

2021
Two-facility Location Games with Minimum Distance Requirement.
J. Artif. Intell. Res., 2021

Eliciting Information with Partial Signals in Repeated Games.
CoRR, 2021

Fair Allocation with Interval Scheduling Constraints.
CoRR, 2021

Approximately Envy-Free Budget-Feasible Allocation.
CoRR, 2021

Almost Proportional Allocations for Indivisible Chores.
CoRR, 2021

Maximal Information Propagation via Lotteries.
Proceedings of the Web and Internet Economics - 17th International Conference, 2021

Fair Scheduling for Time-dependent Resources.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Mechanism Design for Facility Location Problems: A Survey.
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

Budget-feasible Maximum Nash Social Welfare is Almost Envy-free.
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

Approximate Group Fairness for Clustering.
Proceedings of the 38th International Conference on Machine Learning, 2021

Pool Block Withholding Attack with Rational Miners.
Proceedings of the Frontiers of Algorithmics - International Joint Conference, 2021

Multi-Robot Task Allocation-Complexity and Approximation.
Proceedings of the AAMAS '21: 20th International Conference on Autonomous Agents and Multiagent Systems, 2021

2020
Fair Resource Sharing with Externailities.
CoRR, 2020

Budget-feasible Maximum Nash Social Welfare Allocation is Almost Envy-free.
CoRR, 2020

Discouraging Pool Block Withholding Attacks in Bitcoins.
CoRR, 2020

Fair Resource Sharing and Dorm Assignment.
Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020

Facility Location Problem with Capacity Constraints: Algorithmic and Mechanism Design Perspectives.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019
Efficient Approximations for the Online Dispersion Problem.
SIAM J. Comput., 2019

Maximin-Aware Allocations of Indivisible Goods.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Weighted Maxmin Fair Share Allocation of Indivisible Chores.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Strategyproof and Approximately Maxmin Fair Share Allocation of Chores.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Approximately Maximizing the Broker's Profit in a Two-sided Market.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Mechanism Design with Unstructured Beliefs.
Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019

Heterogeneous Two-facility Location Games with Minimum Distance Requirement.
Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019

Maxmin Share Fair Allocation of Indivisible Chores to Asymmetric Agents.
Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019

2018
Path cooperative games.
J. Comb. Optim., 2018

Dynamic Fair Division Problem with General Valuations.
CoRR, 2018

Information Elicitation for Bayesian Auctions.
Proceedings of the Algorithmic Game Theory - 11th International Symposium, 2018

Dynamic Fair Division Problem with General Valuations.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Brief Announcement: Bayesian Auctions with Efficient Queries.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017
From Bayesian to Crowdsourced Bayesian Auctions.
CoRR, 2017

2016
Computing the least-core and nucleolus for threshold cardinality matching games.
Theor. Comput. Sci., 2016

2015
The Least-Core and Nucleolus of Path Cooperative Games.
Proceedings of the Computing and Combinatorics - 21st International Conference, 2015


  Loading...