Room N21-5011a
State Key Laboratory in the Internet of Things for Smart City (IOTSC)
Faculty of Science and Technology
University of Macau
Email: xiaoweiwu at um.edu.mo
UM Homepage: https://www.fst.um.edu.mo/personal/xiaoweiwu/
I'm currently an Assistant Professor in the Department of Computer and Information Science with the State Key Laboratory of Internet of Things for Smart City (IOTSC) at University of Macau.
Before joining the University of Macau, I worked as a Postdoctoral Fellow with Prof. Monika Henzinger at the Faculty of Computer Science, University of Vienna. I received my PhD degree from the University of Hong Kong under the supervision of Dr. Hubert Chan. I received my BEng degree from the University of Science and Technology of China.
We regularly have several positions for Postdoc, Phd, and Research Assistant each year. If you are interested in my research and want to join our group, please don't hesitate to send me an email with your CV and representative publication.
Students with ICPC programming contest experience will have priority.
Jul, 2025. One paper on Edge-weighted Oblivious Matching is accepted by FOCS 2025.
Jun, 2025. One paper on Weighted EF1 for chores is accepted by Artificial Intelligence (AIJ).
May, 2025. Awarded the U-level award of "Incentive Scheme for Outstanding Academic Staff in Research 2024/2025".
Apr, 2025. One paper on approximate EFX for bivalued chores is accepted by IJCAI 2025.
Apr, 2025. One paper on PROP allocation with subsidy is accepted by IJCAI 2025.
Apr, 2025. One paper on MMS allocation with subsidy is accepted by IJCAI 2025.
Apr, 2025. External research grant on Online Selection Algorithms approved by FDCT.
Feb, 2025. One paper on Mixed Strategy for Security Game is accepted by Artificial Intelligence (AIJ).
Feb, 2025. One paper on Prophet Inequality is accepted by Artificial Intelligence (AIJ).
Jan, 2025. One paper on budget-feasible allocations is accepted by Information and Computation (IANDC).
Sep, 2024. One paper on WPROP allocation with subsidy is accepted by WINE 2024.
May, 2024. One paper on EFX allocation for binary chores is accepted by IJTCS-FAW 2024.
Mar, 2024. One paper on WPROPX allocation for chores is accepted by Artificial Intelligence (AIJ).
Oct, 2023. One paper on Approximate EFX allocation for chores is accepted by Artificial Intelligence (AIJ).
Sep, 2023. One paper on edge-weighted online stochastic matching is accepted by WINE 2023.
Sep, 2023. One paper on query-based prophet inequality is accepted by WINE 2023.
Sep, 2023. One paper on fair allocation with money is accepted by WINE 2023.
Aug, 2023. Organized the conference IJTCS-FAW 2023 in University of Macau .
Aug, 2023. One paper on oblivious matching is accepted by Journal of the ACM (JACM).
I am broadly interested in theoretical computer science, computational economics and algorithmic game theory. My research interests span various topics in online matching, prophet inequality, fair allocation problems and truthful mechanism design.
Some useful introductions of these research directions can be found at: Online Bipartite Matching, Fair Division (Open Problems), Algorithmic Game Theory, Nash Equilibrium.
(* Asterisks denote alphabetical order of authors (why?).)
Weighted EF1 Allocations for Indivisible Chores
Xiaowei Wu*, Cong Zhang, and Shengwei Zhou.
Artificial Intelligence (AIJ), 347: 104386, 2025.
Approximate Envy-freeness in Indivisible Resource Allocation with Budget Constraints
Xiaowei Wu, Bo Li, and Jiarui Gan.
Information and Computation (IANDC), 303: 105264, 2025.
On the computation of mixed strategies for security games with general defending requirements
Rufan Bai, Haoxing Lin, Xiaowei Wu, Minming Li, and Weijia Jia.
Artificial Intelligence (AIJ), 341: 104297, 2025.
IID prophet inequality with a single data point
Yilong Feng, Bo Li, Haolong Li, Xiaowei Wu* and Yutong Wu.
Artificial Intelligence (AIJ), 341: 104296, 2025.
Almost proportional allocations of indivisible chores: Computation, approximation and efficiency
Haris Aziz, Bo Li, Hervé Moulin, Xiaowei Wu* and Xinran Zhu.
Artificial Intelligence (AIJ), 331: 104118, 2024
Approximately EFX Allocations for Indivisible Chores
Shengwei Zhou and Xiaowei Wu.
Artificial Intelligence (AIJ), 326: 104037. 2024
Towards a better understanding of randomized greedy matching
Zhihao Gavin Tang, Xiaowei Wu*, and Yuhao Zhang
Journal of the ACM (JACM), 70(6): 39:1-39:32. 2023
Fair Division of Indivisible Goods: Recent Progress and Open Questions
Georgios Amanatidis, Haris Aziz, Georgios Birmpas, Aris Filos-Ratsikas, Bo Li, Hervé Moulin, Alexandros A. Voudouris and Xiaowei Wu*
Artificial Intelligence (AIJ), 322: 103965. 2023
Deterministic Near-Optimal Approximation Algorithms for Dynamic Set Cover
Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai, and Xiaowei Wu*
SIAM Journal on Computing (SICOMP). 52(5): 1132-1192. 2023
Approximate and Strategyproof Maximin Share Allocation of Chores with Ordinal Preferences
Haris Aziz, Bo Li, and Xiaowei Wu*
Mathematical Programming (MAPR). Accepted. 2022
Fully Online Matching
Zhiyi Huang, Ning Kang, Zhihao Gavin Tang, Xiaowei Wu*, Yuhao Zhang, and Xue Zhu
Journal of the ACM (JACM), 67(3): 17:1-17:25. 2020
Online Vertex Weighted Bipartite Matching: Beating 1-1/e with Random Arrivals
Zhiyi Huang, Zhihao Gavin Tang, Xiaowei Wu*, and Yuhao Zhang
ACM Transactions on Algorithms (TALG), 15(3), 38:1-38:15. 2019
Ranking on Arbitrary Graphs: Rematch via Continuous Linear Programming
T-H. Hubert Chan, Fei Chen, Xiaowei Wu*, and Zhichao Zhao
SIAM Journal on Computing (SICOMP), 47(4), 1529–1546. 2018
Analyzing Node-Weighted Oblivious Matching Problem via Continuous LP with Jump Discontinuity
T-H. Hubert Chan, Fei Chen, and Xiaowei Wu*
ACM Transactions on Algorithms (TALG), 14(2), 12:1–12:25. 2018
On (1,\epsilon)-Restricted Max-Min Fair Allocation Problem
T-H. Hubert Chan, Zhihao Gavin Tang, and Xiaowei Wu*
Algorithmica, 80(7), 2181–2200. 2018
(* Asterisks denote alphabetical order of authors (why?).)
Edge-weighted Matching in the Dark
Zhiyi Huang, Enze Sun, Xiaowei Wu*, and Jiahao Zhao. In FOCS 2025. (pdf)
Tree Splitting Based Rounding Scheme for Weighted Proportional Allocations with Subsidy
Xiaowei Wu* and Shengwei Zhou. In WINE 2024. (pdf)
Improved Competitive Ratio for Edge-Weighted Online Stochastic Matching
Guoliang Qiu, Yilong Feng, Shengwei Zhou, and Xiaowei Wu. In WINE 2023. (pdf)
Prophet Inequality on I.I.D. Distributions: Beating 1-1/e with a Single Query
Bo Li, Xiaowei Wu*, and Yutong Wu. In WINE 2023. (pdf)
One Quarter Each (on Average) Ensures Proportionality
Xiaowei Wu*, Cong Zhang, and Shengwei Zhou. In WINE 2023. (pdf)
Weighted EF1 Allocations for Indivisible Chores
Xiaowei Wu*, Cong Zhang, and Shengwei Zhou. In EC 2023. (pdf)
Multi-agent Online Scheduling: MMS Allocations for Indivisible Items
Shengwei Zhou, Rufan Bai, and Xiaowei Wu. In ICML 2023. (pdf)
Approximately EFX Allocations for Indivisible Chores
Shengwei Zhou and Xiaowei Wu. In IJCAI 2022. (pdf)
Dynamic Set Cover: Improved Amortized and Worst-Case Update Times
Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai, and Xiaowei Wu*. In SODA 2021. (pdf)
Fully Online Matching II: Beating Ranking and Water-filling
Zhiyi Huang, Zhihao Gavin Tang, Xiaowei Wu*, and Yuhao Zhang. In FOCS 2020. (pdf)
Towards a Better Understanding of Randomized Greedy Matching
Zhihao Gavin Tang, Xiaowei Wu*, and Yuhao Zhang. In STOC 2020. (pdf)
Tight Competitive Ratios of Classic Matching Algorithms in the Fully Online Model
Zhiyi Huang, Binghui Peng, Zhihao Gavin Tang, Runzhou Tao, Xiaowei Wu*, and Yuhao Zhang. In SODA 2019. (pdf)
Online Vertex Weighted Bipartite Matching: Beating 1-1/e with Random Arrivals
Zhiyi Huang, Zhihao Gavin Tang, Xiaowei Wu*, and Yuhao Zhang. In ICALP 2018. (pdf)
How to Match when All Vertices Arrive Online
Zhiyi Huang, Ning Kang, Zhihao Gavin Tang, Xiaowei Wu*, Yuhao Zhang, and Xue Zhu. In STOC 2018. (pdf)
Ranking on Arbitrary Graphs: Rematch via Continuous LP with Monotone and Boundary Condition Constraints
T-H. Hubert Chan, Fei Chen, Xiaowei Wu*, and Zhichao Zhao. In SODA 2014. (pdf)
FDCT 0147/2024/RIA2. Online Selection Algorithms for Stochastic Arrivals with Unknown Distribution. (2025.04 - 2028.04)
FDCT-NSFC 0014/2022/AFJ. Theory and Technologies of Data-Hiding-based Multimedia Security (2023.01 - 2026.01)
FDCT 0085/2022/A. Approximately Fair Allocations for Indivisible Chores. (2022.12 - 2025.12)
FDCT 0143/2020/A3. Approximation Algorithms for Fully Online Matching and Smart Ride Sharing. (2021.06 - 2024.06)
SRG2020-00020-IOTSC. Efficient Approximation Algorithms for Graph Problems on Dynamic Big Data. (2020.04 - 2022.12)
Postdoc:
Yuanyuan Wang (2025.07 - )
PhD Students:
Cong Zhang (2022.08 - )
Yilong Feng (2023.08 - )
Haolong Li (2024.08 - )
Zehan Lin (2024.08 - )
Huahua Miao (2024.08 - )
Master Students:
Enhao He (2025.04 - )
Graduated PhD Students:
Shengwei Zhou (2021.08 - 2025.07) First job: Postdoc at Nanyang Technological University
Rufan Bai (2019.08 - 2023.07) First job: Assistant Professor at Southeast University
Graduated Master's Students:
Yang Gao (2025) First Job: Junior Software Engineer II at Booking.com
Jiawei Qiu (2025) First Job: Research and Development Engineer at Institute of Modern Physics, CAS
Haolong Li (2024) First Job: PhD student at the University of Macau
Kin Heng Cheang (2024) First job: Senior Technician at the Public Prosecutions Office of the Macao SAR
Yilong Feng (2023) First job: PhD student at the University of Macau
Tat Him Lei (2022) First job: Senior Technician at Public Security Forces Affairs Bureau of Macau
Xinyu Yang (2022) First job: Software Engineer at China Merchants Bank
Denghao Wu (2021) First job: Product Manager at Huawei
Visiting Students:
Zonghan Yang (2024.10 - 2025.02)
Quan Xue (2024.03 - 2024.05)
Zehan Lin (2024.03 - 2024.05)
Sijia Dai (2023.05 - 2023.08)
Huahua Miao (2023.05 - 2023.08)
Guoliang Qiu (2022.10 - 2023.02)
Ruilong Zhang (2022.05 - 2022.09)
Shengwei Zhou (2021.04 - 2021.07)
Haoxing Lin (2020.08 - 2021.07)
Graduated Undergraduate Students:
2024: Guohao Ou
2022: Chonghin Leung, Chanhong Kuok, Waitim Ip, Leongmeng Lei
2021: Sen Kuang, Manpo Cheang, Kaiwa Song
Last Modified: Aug 11, 2025