We suggest that extending Muller games with preference ordering for players is a natural way to reason about unbounded duration games. In this context, we look at the standard solu...
This paper introduces a multiagent reinforcement learning algorithm that converges with a given accuracy to stationary Nash equilibria in general-sum discounted stochastic games. ...
We focus on the problem of computing an -Nash equilibrium of a bimatrix game, when is an absolute constant. We present a simple algorithm for computing a 3 4 -Nash equilibrium for ...
Spyros C. Kontogiannis, Panagiota N. Panagopoulou,...
We present a computational approach to the saddle-point formulation for the Nash equilibria of two-person, zero-sum sequential games of imperfect information. The algorithm is a ï¬...
In this paper, we investigate the coverage problem in wireless sensor networks using a game theory method. We assume that nodes are randomly scattered in a sensor field and the goa...