陈聪 - 华南理工大学 - 工商管理学院

个人简介

EDUCATION & EXPERIENCES 2019.6-至今: 华南理工大学工商管理学院，博士后 2016.9-2017.9: 苏黎世联邦理工学院(ETH Zurich)计算机学院，联合培养博士 2015.3-2019.3: 西安交通大学管理学院，博士 2013.9-2015.3: 西安交通大学管理学院，硕士（后转博） 2009.9-2013.9: 西南交通大学经济管理学院，学士

研究领域

算法博弈论 (Algorithmic Game Theory) 在线/近似算法 (Online/Approximation Algorithms) 组合优化 (Combinatorial Optimization)

近期论文

查看导师新发文章（温馨提示：请注意重名现象，建议点开原文通过作者单位确认）

[8] C. Chen and Y. Xu, The curse of rationality in sequential scheduling games, In International Conference on Web and Internet Economics (WINE'20). [7] C. Chen, P. Giessler, A. Mamageishvili, M. Mihalak and P. Penna, Sequential Solutions in Machine Scheduling Games, In International Conference on Web and Internet Economics (WINE'20). [6] C. Chen, H. Zhang* and Y. Xu, Online machine minimization with lookahead. Journal of Combinatorial Optimization, 2020. [5] C. Chen* and Y. Xu, Coordination Mechanisms for Scheduling Selfish Jobs with Favorite Machines, Journal of Combinatorial Optimization, 2020, 40(2): 333–365. [4] C. Chen*, P. Penna, and Y. Xu, Online scheduling of jobs with favorite machines, Computers & Operations Research, 2020, 116: 104868. [3] C. Chen, Y. Xu. 2019. Selfish load balancing for jobs with favorite machines. Operations Research Letters,47(1): 7-11. [2] C. Chen, Y. Xu, Y. Zhu, C. Sun. 2017. Online MapReduce scheduling problem of minimizing the makespan.Journal of Combinatorial Optimization, 33(2): 590-608. [1] C. Chen, P. Penna, Y. Xu. Selfish Jobs with Favorite Machines: Price of Anarchy vs. Strong Price of Anarchy.COCOA (2) 2017: 226-240.