Minming Li is a Professor in Department of Computer Science, City University of Hong Kong. He received his Ph. D. and B.E. degree in the Department of Computer Science and Technology at Tsinghua University in 2006 and 2002 respectively. His research interests include algorithmic game theory, combinatorial optimization and algorithm design and analysis for scheduling problems. He has been consistently working on the theoretical aspects of computer science with a wide scope of application background. The full publication can be found at https://dblp.org/pid/78/6881.html
Minming is serving as associate editors for a number of journals including Omega, Journal of Scheduling and Journal of Combinatorial Optimization. He has organized conferences COCOA 2016, FAW 2020, ISAAC 2020 as PC chairs. He has also served as chairperson of ACM Hong Kong Chapter from 2016 to 2018. He was a recipient of Teaching Excellence Award given by City University of Hong Kong.
To request a single lecture/event, click on the desired lecture and complete the Request Lecture Form.
Defending with Shared Resources on a Network
In this talk we consider a defending problem on a network. In the model, the defender holds a total defending resource of R, which can be distributed to the nodes of the network. The defending...
Facility Location Games, from Origin to Recent Development
Mechanism Design, as one of the important areas in algorithmic game theory, can be classified into two categories: with money and without money. Facility location game is one of the mostly studied...
To request a tour with this speaker, please complete this online form.
If you are not requesting a tour, click on the desired lecture and complete the Request this Lecture form.
All requests will be sent to ACM headquarters for review.