[PDF][PDF] Computing optimal ex ante correlated equilibria in two-player sequential games
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 …
strategies and predicting the most likely outcome of a game is a central problem in Artificial …
On the verification and computation of strong Nash equilibrium
N Gatti, M Rocco, T Sandholm - arXiv preprint arXiv:1711.06318, 2017 - arxiv.org
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 …
results are known for\emph {Nash equilibrium}(NE). However, these can be adopted only …
Combining local search techniques and path following for bimatrix games
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 …
particularly appropriate solution concept for two-agent settings because coalitional …
Finding a nash equilibrium by asynchronous backtracking
A Grubshtein, A Meisels - … Conference on Principles and Practice of …, 2012 - Springer
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 …
participant interacts with a limited number of other agents. The model resembles Distributed …
[PDF][PDF] New results on the verification of Nash refinements for extensive-form games.
N Gatti, F Panozzo - AAMAS, 2012 - ifaamas.org
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 …
attention in multi–agent systems. A number of results on strategic–form games and zero …
[PDF][PDF] Personality-based representations of imperfect-recall games
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 …
perfect recall. First, the equivalence between behavioral and mixed strategies no longer …
Computing an extensive-form perfect equilibrium in two-player games
N Gatti, C Iuliano - Proceedings of the AAAI Conference on Artificial …, 2011 - ojs.aaai.org
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 …
issues in AI. In this paper, we provide, to the best of our knowledge, the first algorithm to …
Adaptation of ant supercolony behavior to solve route assignment problem in integers
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 …
return an integer solution. This disagreement constitutes a non-negligible drawback. In fact …
Algorithm to find the equilibrium point in missile-ship simulator-based game
L Casalini - 2019 - politesi.polimi.it
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 …
missile. We will use the concepts of Game Theory to tackle this problem and, in particular …
Learning correlation in multi-player general-sum games with regret minimization
T Bianchi - 2018 - politesi.polimi.it
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 …
conflicting interests. In recent years, there has been an increasing attention to solution …