New convergence results for Nash equilibria.
Non-cooperative game approach to multi-robot planning
A multi-robot environment with a STRIPS representation is considered. Under some assumptions such problems can be modelled as a STRIPS language (for instance, a Block World environment) with one initial state and a disjunction of goal states. If the STRIPS planning problem is invertible, then it is possible to apply the machinery for planning in the presence of incomplete information to solve the inverted problem and then to find a solution to the original problem. In the paper a planning algorithm...
Noncooperative games with noncompact joint strategies sets: increasing best responses and approximation to equilibrium points
In this paper conditions proposed in Flores-Hernández and Montes-de-Oca [3] which permit to obtain monotone minimizers of unbounded optimization problems on Euclidean spaces are adapted in suitable versions to study noncooperative games on Euclidean spaces with noncompact sets of feasible joint strategies in order to obtain increasing optimal best responses for each player. Moreover, in this noncompact framework an algorithm to approximate the equilibrium points for noncooperative games is supplied....
Nonzero-sum semi-Markov games with countable state spaces
We consider nonzero-sum semi-Markov games with a countable state space and compact metric action spaces. We assume that the payoff, mean holding time and transition probability functions are continuous on the action spaces. The main results concern the existence of Nash equilibria for nonzero-sum discounted semi-Markov games and a class of ergodic semi-Markov games with the expected average payoff criterion.
On a Formulation of Discrete, N-Person Non Cooperative Games.
On knowledge games.
We give a formalization of the ?knowledge games? which allows to study their decidability and convergence as a problem of mathematics. Our approach is based on a metalemma analogous to those of Von Neumann and Morgenstern at the beginning of Game Theory. We are led to definitions which characterize the knowledge games as objects is standard set theory. We then study rigorously the most classical knowledge games and, although we also prove that the ?common knowledge? in these games may be incomputable,...
On noncooperative nonlinear differential games
Noncooperative games with systems governed by nonlinear differential equations remain, in general, nonconvex even if continuously extended (i. e. relaxed) in terms of Young measures. However, if the individual payoff functionals are “enough” uniformly convex and the controlled system is only “slightly” nonlinear, then the relaxed game enjoys a globally convex structure, which guarantees existence of its Nash equilibria as well as existence of approximate Nash equilibria (in a suitable sense) for...
On one algorithm finding all bimatrix game equilibria
On plain absolute equilibrium points in general non-ordered games with perfect information. II
On plain absolute equilibrium points in general non-ordered games with perfect information. I
On the first occurrence of strings.
On the structure of Nash equilibrium sets in partially convex games.
Parameter optimization in nonzero-sum differential games
Payoff space in -games.
Rational expectations and the Cournot-Theocharis problem.
Refinamiento del concepto de n-tupla de Selten.
En este artículo revisamos los conceptos de equilibrio perfecto y propio para juegos en forma normal y obtenemos un refinamiento del equilibrio perfecto.
Refinamientos del concepto de equilibrio en extensiones generalizadas de juegos finitos.
En este trabajo introducimos la extensión generalizada de un jungo n-personal finito en forma normal y, en dicho contexto, damos un concepto de equilibrio y algunos refinamientos estables de él. Se indican casos particulares de notable interés.
Set-theoretic inequalities in stochastic noncooperative games with coalition.
Simple equilibria in finite games with convexity properties
This review paper gives a characterization of non-coalitional zero-sum and non-zero-sum games with finite strategy spaces and payoff functions having some concavity or convexity properties. The characterization is given in terms of the existence of two-point Nash equilibria, that is, equilibria consisting of mixed strategies with spectra consisting of at most two pure strategies. The structure of such simple equilibria is discussed in various cases. In particular, many of the results discussed can...
Simultaneous nondeterministic games. I