research
∙
11/09/2022
Decomposition of Probability Marginals for Security Games in Abstract Networks
Given a set system (E, 𝒫), let π∈ [0,1]^𝒫 be a vector of requirement val...
share
research
∙
12/14/2021
Multi-Leader Congestion Games with an Adversary
We study a multi-leader single-follower congestion game where multiple u...
research
∙
11/12/2021
A Constant-Factor Approximation for Generalized Malleable Scheduling under M^♮-Concave Processing Speeds
In generalized malleable scheduling, jobs can be allocated and processed...
research
∙
11/11/2021
Assigning and Scheduling Generalized Malleable Jobs under Submodular Processing Speeds
Malleable scheduling is a model that captures the possibility of paralle...
research
∙
10/21/2021
The popular assignment problem: when cardinality is more important than popularity
We consider a matching problem in a bipartite graph G=(A∪ B,E) where eac...
research
∙
08/05/2021
Bifactor Approximation for Location Routing with Vehicle and Facility Capacities
Location Routing is a fundamental planning problem in logistics, in whic...
research
∙
07/17/2020
Pure Nash Equilibria in Resource Graph Games
This paper studies the existence of pure Nash equilibria in resource gra...
research
∙
06/05/2020
Single-machine scheduling with an external resource
This paper studies the complexity of single-machine scheduling with an e...
research
∙
12/04/2019
Popular Branchings and Their Dual Certificates
Let G be a digraph where every node has preferences over its incoming ed...
research
∙
11/20/2019
Exact and approximation algorithms for the expanding search problem
Suppose a target is hidden in one of the vertices of an edge-weighted gr...
research
∙
03/26/2019
Malleable scheduling beyond identical machines
In malleable job scheduling, jobs can be executed simultaneously on mult...
research
∙
11/26/2018
Maintaining Perfect Matchings at Low Cost
The min-cost matching problem suffers from being very sensitive to small...
research
∙
11/15/2018