Search Results for author:
Found 5 papers, 1 papers with code
Facility Location Games with Scaling Effects
Consequently, we characterize the conditions on scaling functions which ensure that agents have single-peaked preferences.
Mixed Strategies for Security Games with General Defending Requirements
In this work, we initiate the study of mixed strategies for the security games in which the targets can have different defending requirements.
Fair Scheduling for Time-dependent Resources
We study a fair resource scheduling problem, where a set of interval jobs are to be allocated to heterogeneous machines controlled by intellectual agents. Each job is associated with release time, deadline, and processing time such that it can be processed if its complete processing period is between its release time and deadline.
Maximizing approximately k-submodular functions
Last, we demonstrate experimentally that the greedy algorithms are effective in sensor placement and influence maximization problems.
Defending with Shared Resources on a Network
For the case when defending resources cannot be shared, we present a max-flow-based exact algorithm.
