24 citations · 72 across the 16 of their papers we have counts for
18 papers
Population-size-Aware Policy Optimization for Mean-Field Games
Pengdeng Li, Xinrun Wang, Shuxin Li +2
In this work, we attempt to bridge the two fields of finite-agent and infinite-agent games, by studying how the optimal policies of agents evolve with the number of agents (populat…
Offline Equilibrium Finding
Shuxin Li, Xinrun Wang, Youzhi Zhang +4
Offline reinforcement learning (offline RL) is an emerging field that has recently begun gaining attention across various application domains due to its ability to learn strategies…
A Unified Perspective on Deep Equilibrium Finding
Xinrun Wang, Jakub Cerny, Shuxin Li +4
Extensive-form games provide a versatile framework for modeling interactions of multiple agents subjected to imperfect observations and stochastic events. In recent years, two para…
Sequential Blocked Matching
Nicholas Bishop, Hau Chan, Debmalya Mandal +1
We consider a sequential blocked matching (SBM) model where strategic agents repeatedly report ordinal preferences over a set of services to a central planner. The planner's goal i…
Facility Location Games with Ordinal Preferences
Hau Chan, Minming Li, Chenhao Wang
We consider a new setting of facility location games with ordinal preferences. In such a setting, we have a set of agents and a set of facilities. Each agent is located on a line a…
Strategyproof Mechanisms For Group-Fair Facility Location Problems
Houyu Zhou, Minming Li, Hau Chan
We study the facility location problems where agents are located on a real line and divided into groups based on criteria such as ethnicity or age. Our aim is to design mechanisms…
Mechanism Design for Facility Location Problems: A Survey
Hau Chan, Aris Filos-Ratsikas, Bo Li +2
The study of approximate mechanism design for facility location problems has been in the center of research at the intersection of artificial intelligence and economics for the las…
On maximizing a monotone -submodular function under a knapsack constraint
Zhongzheng Tang, Chenhao Wang, Hau Chan
We study the problem of maximizing a non-negative monotone -submodular function under a knapsack constraint, where a -submodular function is a natural generalization of a…
Multi-Robot Task Allocation -- Complexity and Approximation
Haris Aziz, Hau Chan, Ágnes Cseh +3
Multi-robot task allocation is one of the most fundamental classes of problems in robotics and is crucial for various real-world robotic applications such as search, rescue and are…
Maximizing approximately k-submodular functions
Leqian Zheng, Hau Chan, Grigorios Loukides +1
We introduce the problem of maximizing approximately -submodular functions subject to size constraints. In this problem, one seeks to select -disjoint subsets of a ground set…
Preferences Single-Peaked on a Tree: Multiwinner Elections and Structural Results
Dominik Peters, Lan Yu, Hau Chan +1
A preference profile is single-peaked on a tree if the candidate set can be equipped with a tree structure so that the preferences of each voter are decreasing from their top candi…
Facility Location Problem with Capacity Constraints: Algorithmic and Mechanism Design Perspectives
Haris Aziz, Hau Chan, Barton E. Lee +2
We consider the facility location problem in the one-dimensional setting where each facility can serve a limited number of agents from the algorithmic and mechanism design perspect…
Weighted Maxmin Fair Share Allocation of Indivisible Chores
Haris Aziz, Hau Chan, Bo Li
We initiate the study of indivisible chore allocation for agents with asymmetric shares. The fairness concept we focus on is the weighted natural generalization of maxmin share: WM…
Maximin-Aware Allocations of Indivisible Goods
Hau Chan, Jing Chen, Bo Li +1
We study envy-free allocations of indivisible goods to agents in settings where each agent is unaware of the goods allocated to other agents. In particular, we propose the maximin…
The Capacity Constrained Facility Location problem
Haris Aziz, Hau Chan, Barton E. Lee +1
We initiate the study of the capacity constrained facility location problem from a mechanism design perspective. The capacity constrained setting leads to a new strategic environme…
Where Graph Topology Matters: The Robust Subgraph Problem
Hau Chan, Shuchu Han, Leman Akoglu
Robustness is a critical measure of the resilience of large networked systems, such as transportation and communication networks. Most prior works focus on the global robustness of…
Truthful Multi-unit Procurements with Budgets
Hau Chan, Jing Chen
We study procurement games where each seller supplies multiple units of his item, with a cost per unit known only to him. The buyer can purchase any number of units from each selle…
Interdependent Defense Games: Modeling Interdependent Security under Deliberate Attacks
Hau Chan, Michael Ceyko, Luis E. Ortiz
We propose interdependent defense (IDD) games, a computational game-theoretic framework to study aspects of the interdependence of risk and security in multi-agent systems under de…