research
∙
08/30/2023
Maximin-Aware Allocations of Indivisible Chores with Symmetric and Asymmetric Agents
The real-world deployment of fair allocation algorithms usually involves...
share
research
∙
06/27/2023
Scheduling with a Limited Testing Budget
Scheduling with testing falls under the umbrella of the research on opti...
research
∙
06/11/2023
Bayesian Calibrated Click-Through Auction
We study information design in click-through auctions, in which the bidd...
research
∙
12/02/2022
Fair Graphical Resource Allocation with Matching-Induced Utilities
Motivated by real-world applications, we study the fair allocation of gr...
research
∙
11/06/2022
Online Nash Welfare Maximization Without Predictions
Nash welfare maximization is widely studied because it balances efficien...
research
∙
04/26/2022
Mixed Strategies for Security Games with General Defending Requirements
The Stackelberg security game is played between a defender and an attack...
research
∙
08/22/2021
Online Ride-Hitching in UAV Travelling
The unmanned aerial vehicle (UAV) has emerged as a promising solution to...
research
∙
07/24/2021
Fair Allocation with Interval Scheduling Constraints
We study a fair resource scheduling problem, where a set of interval job...
research
∙
07/12/2021
Strategyproof Mechanisms For Group-Fair Facility Location Problems
Ensuring group fairness among groups of individuals in our society is de...
research
∙
07/04/2021
Facility Location Games with Ordinal Preferences
We consider a new setting of facility location games with ordinal prefer...
research
∙
06/07/2021
Mechanism Design for Facility Location Problems: A Survey
The study of approximate mechanism design for facility location problems...
research
∙
01/18/2021
Maximizing approximately k-submodular functions
We introduce the problem of maximizing approximately k-submodular functi...
research
∙
12/02/2020
Defending against Contagious Attacks on a Network with Resource Reallocation
In classic network security games, the defender distributes defending re...
research
∙
11/22/2020
Online Maximum k-Interval Coverage Problem
We study the online maximum coverage problem on a line, in which, given ...
research
∙
11/27/2019
Favorite-Candidate Voting for Eliminating the Least Popular Candidate in Metric Spaces
We study single-candidate voting embedded in a metric space, where both ...
research
∙
11/19/2019
Defending with Shared Resources on a Network
In this paper we consider a defending problem on a network. In the model...
research
∙
09/10/2019
Well-behaved Online Load Balancing Against Strategic Jobs
In the online load balancing problem on related machines, we have a set ...
research
∙
07/21/2019
Strategyproof Mechanism for Two Heterogeneous Facilities with Constant Approximation Ratio
In this paper, we study the two-facility location game on a line with op...
research
∙
06/30/2019
Strategic Learning Approach for Deploying UAV-provided Wireless Services
Unmanned Aerial Vehicle (UAV) have emerged as a promising technique to r...
research
∙
06/21/2018