1 citations · 1 across the 5 of their papers we have counts for
Showing 2018Show all
3 papers · 1 filter
cs.GT2018
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…
cs.GT2018
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…
cs.GT2018★ 1 cited
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…