The computational study of adversarial interactions aiming at finding players' optimal
strategies and predicting the most likely outcome of a game is a central problem in Artificial …

Computing equilibria of games is a central task in computer science. A large number of
results are known for\emph {Nash equilibrium}(NE). However, these can be adopted only …

Computing a Nash equilibrium (NE) is a central task in computer science. An NE is a
particularly appropriate solution concept for two-agent settings because coalitional …

Graphical Games are a succinct representation of multi agent interactions in which each
participant interacts with a limited number of other agents. The model resembles Distributed …

The computational study of strategic interaction situations has recently deserved a lot of
attention in multi–agent systems. A number of results on strategic–form games and zero …

The treatment of imperfect-recall games is much more involved than that of games with
perfect recall. First, the equivalence between behavioral and mixed strategies no longer …

Equilibrium computation in games is currently considered one of the most challenging
issues in AI. In this paper, we provide, to the best of our knowledge, the first algorithm to …

Purpose Until now, the algorithms used to compute an equilibrate route assignment do not
return an integer solution. This disagreement constitutes a non-negligible drawback. In fact …

In this work we are studying the situation in which a warship is attacked by an infra-red
missile. We will use the concepts of Game Theory to tackle this problem and, in particular …

Game Theory is a very powerful tool to model strategic interaction between agents with
conflicting interests. In recent years, there has been an increasing attention to solution …