11 citations · 36 across the 35 of their papers we have counts for
38 papers
The Complexity of Minimizing Subsidies in Envy-Free House Allocation
Sijia Dai, Minming Li, Xiaowei Wu +1
The house allocation problem is a classical one-sided matching problem that concerns the assignment of a set of houses to agents according to their preferences, where each…
Temporal Fair Division of Indivisible Mixed Manna: Tractable Settings
Kui-Wang Choi, Minming Li, Nicholas Teh
We study temporal fair division of indivisible mixed manna. Items arrive over time and must be allocated irrevocably; an item may be a good for some agents, a chore for others, and…
Temporal Fair Division of Indivisible Goods with Structured Constraints
Kui-Wang Choi, Minming Li
This paper investigates temporal fair division, a setting where items are allocated over multiple rounds and agents require cumulative fairness over time. We focus on dynamic exten…
Temporal Fair Division of Indivisible Goods with Scheduling
Kui-Wang Choi, Minming Li
We study temporal fair division, where agents receive goods over multiple rounds and cumulative fairness is required. We investigate Temporal Envy-Freeness Up to One Good (TEF1) an…
Tree-Based Stochastic Optimization for Solving Large-Scale Urban Network Security Games
Shuxin Zhuang, Linjian Meng, Shuxin Li +2
Urban Network Security Games (UNSGs), which model the strategic allocation of limited security resources on city road networks, are critical for urban safety. However, finding a Na…
Centralized Group Equitability and Individual Envy-Freeness in the Allocation of Indivisible Items
Ying Wang, Jiaqian Li, Tianze Wei +2
We study the fair allocation of indivisible items for groups of agents from the perspectives of the agents and a centralized allocator. In our setting, the centralized allocator is…
Crane Scheduling Problem with Energy Saving
Yixiong Gao, Florian Jaehn, Minming Li +2
During loading and unloading steps, energy is consumed when cranes lift containers, while energy is often wasted when cranes drop containers. By optimizing the scheduling of cranes…
CARE: Compatibility-Aware Incentive Mechanisms for Federated Learning with Budgeted Requesters
Xiang Liu, Hau Chan, Minming Li +3
Federated learning (FL) is a promising approach that allows requesters (\eg, servers) to obtain local training models from workers (e.g., clients). Since workers are typically unwi…
The Complexity of Tullock Contests
Yu He, Fan Yao, Yang Yu +3
Despite the extensive literature on Tullock contests, computational results for the general model with heterogeneous contestants remain scarce. This paper studies the algorithmic c…
A Complete Landscape of EFX Allocations on Graphs: Goods, Chores and Mixed Manna
Bo Li, Minming Li, Tianze Wei +2
We study envy-free up to any item (EFX) allocations on simple graphs where vertices and edges represent agents and items respectively. An agent (vertex) is only interested in items…
Public Event Scheduling with Busy Agents
Bo Li, Lijun Li, Minming Li +1
We study a public event scheduling problem, where multiple public events are scheduled to coordinate the availability of multiple agents. The availability of each agent is determin…
A Reduction from Multi-Parameter to Single-Parameter Bayesian Contract Design
Matteo Castiglioni, Junjie Chen, Minming Li +2
The main result of this paper is an almost approximation-preserving polynomial-time reduction from the most general multi-parameter Bayesian contract design (BCD) to single-paramet…
Facility Location Games with Scaling Effects
Yu He, Alexander Lam, Minming Li
We take the classic facility location problem and consider a variation, in which each agent's individual cost function is equal to their distance from the facility multiplied by a…
Dynamic Maximal Matching in Clique Networks
Minming Li, Peter Robinson, Xianbin Zhu
We consider the problem of computing a maximal matching with a distributed algorithm in the presence of batch-dynamic changes to the graph topology. We assume that a graph of n…
Maximin-Aware Allocations of Indivisible Chores with Symmetric and Asymmetric Agents
Tianze Wei, Bo Li, Minming Li
The real-world deployment of fair allocation algorithms usually involves a heterogeneous population of users, which makes it challenging for the users to get complete knowledge of…
Scheduling with a Limited Testing Budget
Christoph Damerius, Peter Kling, Minming Li +2
Scheduling with testing falls under the umbrella of the research on optimization with explorable uncertainty. In this model, each job has an upper limit on its processing time that…
Bayesian Calibrated Click-Through Auction
Junjie Chen, Minming Li, Haifeng Xu +1
We study information design in click-through auctions, in which the bidders/advertisers bid for winning an opportunity to show their ads but only pay for realized clicks. The payme…
Fair Graphical Resource Allocation with Matching-Induced Utilities
Zheng Chen, Bo Li, Minming Li +1
Motivated by real-world applications, we study the fair allocation of graphical resources, where the resources are the vertices in a graph. Upon receiving a set of resources, an ag…
Online Nash Welfare Maximization Without Predictions
Zhiyi Huang, Minming Li, Xinkai Shu +1
The maximization of Nash welfare, which equals the geometric mean of agents' utilities, is widely studied because it balances efficiency and fairness in resource allocation problem…
Mixed Strategies for Security Games with General Defending Requirements
Rufan Bai, Haoxing Lin, Xinyu Yang +3
The Stackelberg security game is played between a defender and an attacker, where the defender needs to allocate a limited amount of resources to multiple targets in order to minim…
Composite Resource Scheduling for Networked Control Systems
Peng Wu, Chenchen Fu, Tianyu Wang +4
Real-time end-to-end task scheduling in networked control systems (NCSs) requires the joint consideration of both network and computing resources to guarantee the desired quality o…
Online Ride-Hitching in UAV Travelling
Songhua Li, Minming Li, Lingjie Duan +1
The unmanned aerial vehicle (UAV) has emerged as a promising solution to provide delivery and other mobile services to customers rapidly, yet it drains its stored energy quickly wh…
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…
Fair Allocation with Interval Scheduling Constraints
Bo Li, Minming Li, Ruilong Zhang
We study a fair resource scheduling problem, where a set of interval jobs are to be allocated to heterogeneous machines controlled by agents. Each job is associated with release ti…