1 citations · 1 across the 5 of their papers we have counts for
6 papers
The Complexity of Max-Min -Partitioning
Anisse Ismaili
In this paper we study a max-min -partition problem on a weighted graph, that could model a robust -coalition formation. We settle the computational complexity of this proble…
On Existence, Mixtures, Computation and Efficiency in Multi-objective Games
Anisse Ismaili
In a multi-objective game, each individual's payoff is a \emph{vector-valued} function of everyone's actions. Under such vectorial payoffs, Pareto-efficiency is used to formulate e…
The Complexity of Student-Project-Resource Matching-Allocation Problems
Anisse Ismaili
I settle the computational complexity of student-project-resource matching-allocation problems, in which students and resources are assigned to projects \citep{pc2017}. A project's…
The Complexity of Sequential Routing Games
Anisse Ismaili
We study routing games where every agent sequentially decides her next edge when she obtains the green light at each vertex. Because every edge only has capacity to let out one age…
Routing Games over Time with FIFO policy
Anisse Ismaili
We study atomic routing games where every agent travels both along its decided edges and through time. The agents arriving on an edge are first lined up in a \emph{first-in-first-o…
Efficiency in Multi-objective Games
Anisse Ismaili
In a multi-objective game, each agent individually evaluates each overall action-profile on multiple objectives. I generalize the price of anarchy to multi-objective games and prov…