Room N21-5006c
State Key Laboratory of the Internet of Things for Smart City (IOTSC)
University of Macau
Taipa, Macau SAR
Email: yc47490@um.edu.mo
I'm currently a second-year Ph.D. student under the supervision of Prof. Xiaowei Wu at the State Key Laboratory in the Internet of Things for Smart City (IOTSC), University of Macau. Prior to joining the Ph.D. program, I worked as a Research Assistant at IOTSC, also under the guidance of Prof. Wu. I received my Master's degree from Beijing Normal University and Bachelor's degree from Guangzhou University.
Research interest
I am broadly interested in algorithmic game theory and theoretical computer science. Currently, I mainly focus on fair allocation problems.
News
Apr 2026: I will be visiting Shanghai Jiao Tong University (SJTU), hosted by Prof. Biaoshuai Tao.
Jan 2026: One paper on EFX for restricted chores has been accepted to WWW 2026.
Aug 2025: Attended IJCAI 2025, delivering both oral and poster presentations.
Jun 2025: Successfully passed my PhD Qualifying Examination.
Apr 2025: One paper on approximate EFX for bivalued chores was accepted to IJCAI 2025.
Selected Publication(s) (DBLP)
(* Asterisks denote alphabetical order of authors (why?).)
Approximately EFX and fPO Allocations for Bivalued Chores (pdf)
Zehan Lin*, Xiaowei Wu, and Shengwei Zhou. In IJCAI 2025.
Allocating Chores with Restricted Additive Costs: Achieving EFX, MMS, and Efficiency Simultaneously
Zehan Lin*, Xiaowei Wu, and Shengwei Zhou. To appear in WWW 2026.
Working Paper(s)
When Maximum Nash Welfare Becomes Strongly Fair: Bi-valued Goods
Zehan Lin*, Xiaowei Wu, and Shengwei Zhou. Submitted to EC 2026.
Efficient EFX Allocations for Chores
Zehan Lin*, Xiaowei Wu, and Shengwei Zhou. Submitted to AIJ.
MMS Allocations of Chores to Online Agents
Haolong Li, Zehan Lin*, Huahua Miao, Xiaowei Wu.
Selected Award
Gold Medal (Rank 19/281), 47th ICPC Asia-East Continent Final Contest
Gold Medal (Rank 10/417), 47th ICPC Asia-East Regional Contest, Nanjing Site
National Scholarship, 2020
Last Modified: Mar. 30, 2026