Xiaowei Wu

14 papers · 2016–2026 · 3 venues · across top CS/AI venues

Authors are matched by name, so researchers who share a name ("Yang Liu", "Wei Wang") appear as a single profile and their paper counts, venues and achievements are combined. How identity is handled.

Achievements

Jump to papers ↓

+3 more ↓

🐣 Hot Topic Early Bird 🌍 Conference Polyglot · Bronze 🏃 Academic Marathon · Half 🌉 Interdisciplinary Bridge · Silver 🗺️ Taxonomy Completionist (19)

💎 Century Club · Bronze 🔥 Unstoppable · Bronze 🗃️ Keyword Collector (54)

Venues

IJCAI (9) AAAI (4) ICML (1)

Top co-authors

Shengwei Zhou (5) Bo Li (4) Minming Li (3) Rufan Bai (3) Haoxing Lin (2) Quan Xue (2) Xinyu Yang (2) Weijia Jia (2) Junyu Niu (1) Long Tran-Thanh (1)

Research topics

Mathematics & Optimization (9) Optimization (9) Artificial Intelligence (8) Core AI (7) Computer Science (6) Machine Learning (6) Application Areas (4) Foundations (4) Optimization & Theory (3) Applications (2) Learning Types (2) Core Methods (1) Learning Paradigms (1)

Keywords

approximation algorithm (9) fair division (6) envy-free allocation (4) fair allocation (3) game theory (2) subsidy mechanism (2) indivisible chore (2) maximin share (2) indivisible item (2) resource allocation (2) mixed integer programming (1) nash social welfare (1) utility function (1) stackelberg game (1) model pruning (1) algorithmic fairness (1) client clustering (1) lp rounding (1) network security (1) budget constraint (1)

Papers

MSCFL: Model Structure-Aware Clustered Federated Learning for System Heterogeneity and Data Drift AAAI 2026 A Little Subsidy Ensures MMS Allocation for Three Agents IJCAI 2025 Approximately EFX and fPO Allocations for Bivalued Chores IJCAI 2025 Revisiting Proportional Allocation with Subsidy: Simplification and Improvements IJCAI 2025 Multiagent MST Cover: Pleasing All Optimally via a Simple Voting Rule AAAI 2023 Multi-agent Online Scheduling: MMS Allocations for Indivisible Items ICML 2023 Approximately EFX Allocations for Indivisible Chores IJCAI 2022 Mixed Strategies for Security Games with General Defending Requirements IJCAI 2022 Budget-feasible Maximum Nash Social Welfare is Almost Envy-free IJCAI 2021 Defending against Contagious Attacks on a Network with Resource Reallocation AAAI 2021 Defending with Shared Resources on a Network AAAI 2020 Maximin-Aware Allocations of Indivisible Goods IJCAI 2019 Strategyproof and Approximately Maxmin Fair Share Allocation of Chores IJCAI 2019 A Framework for Recommending Relevant and Diverse Items IJCAI 2016