题目：Fair Scheduling for Time-dependent Resources
报告时间：2024年1月12日（星期五）上午10点-12点
报告地点：理科大楼B1002
邀请人：许晨阳
摘要:
We study a fair resource scheduling problem, where a set of interval jobs are to be allocated to heterogeneous machines controlled by intellectual agents. Each job is associated with release time, deadline, and processing time such that it can be processed if its complete processing period is between its release time and deadline. The machines gain possibly different utilities by processing different jobs, and all jobs assigned to the same machine should be processed without overlap. We consider two widely studied solution concepts, namely, maximin share fairness and envy-freeness. For both criteria, we discuss the extent to which fair allocations exist and present constant approximation algorithms for various settings.
报告人简历:
Minming Li于2002年在清华大学计算机科学与技术系获得学士，于2006年在同系获得博士学位，是姚期智教授在清华指导的首批毕业生之一。之后赴香港城市大学任教，现为教授。他的研究兴趣包括算法博弈论，算法设计与分析以及组合优化。他在PNAS，SIAM Journal on Computing, IEEE/ACM Transactions on Networking, IEEE Transactions on Mobile Computing等期刊上发表论文80篇；在NeurIPS，ICML，AAAI，AAMAS，IJCAI等国际会议上发表论文100余篇。目前为ACM Distinguished Speaker。