activity
20122023
most citedInterdependent Defense Games: Modeling Interdependent Security under Deliberate Attacks

24 citations · 72 across the 16 of their papers we have counts for

collaborators
Showing cs.GTShow all

12 papers · 1 filter

cs.GT2022

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…

cs.GT2021

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…

cs.GT2021

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…

cs.GT2021★ 4 cited

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…

cs.GT2021★ 11 cited

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…

cs.GT2020★ 6 cited

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…

cs.GT2019

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…

cs.GT2019★ 4 cited

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…

cs.GT2019

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…

cs.GT2018

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…

cs.GT2014★ 2 cited

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…

cs.GT2012★ 24 cited

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…