• Nash noncooperative theory • Ex ante decision-making and decision criterion for Nash theory A N-person normal form game is given as a triple:

In this letter, we deal with evolutionary game-theoretic learning processes for population games on networks dynamically evolving communities. Specifically, propose a novel mathematical framework in which deterministic, continuous-time replicator equation community network is coupled closed dynamic flow process between communities, turn governed by an environmental feedback mechanism. When such...

Viewing two qubit quantum computations as two player “quantum” games, initial states are characterized that play the role of dominant strategies in the corresponding game model and give rise to Nash equilibrium outcomes. Nash equilibrium outcomes are optimal under given constraints and therefore offer a game-theoretic measure of constrained optimization of two qubit quantum computations.

Graphical congestion games provide powerful models for a wide range of scenarios where spatially distributed individuals share resources. Understanding when graphical congestion game dynamics converge to pure Nash equilibria yields important engineering insights into when spatially distributed individuals can reach a stable resource allocation. In this paper, we study the convergence dynamics o...

In this paper, we consider a non-cooperative n-person game in the strategic form. As is well known, the game has a mixed-strategy Nash equilibrium. However, it does not always have a pure-strategy Nash equilibrium. Wherein, Topkis (1979), Iimura (2003), and Sato and Kawasaki (2009) provided a sufficient condition for the game to have a pure-strategy Nash equilibrium. However, they did not consi...

This paper studies the existence of pure-strategy Nash equilibria for nonatomic games where players take actions in an infinite-dimensional Banach space. For any infinitedimensional Banach space, we construct a nonatomic game with actions in this space which has no pure-strategy Nash equilibria, provided that the player space is modeled by the usual Lebesgue unit interval. We also show that if ...

In this paper we study the notion of the Evolutionary Stable Strategies (ESS) in evolutionary games and we demonstrate their qualitative difference from the Nash Equilibria, by showing that a random evolutionary game has on average exponentially less number of ESS than the number of Nash Equilibria in the underlying symmetric 2-person game with random payoffs.

This paper will present an approximate/adaptive dynamic programming (ADP) algorithm, that uses the idea of integral reinforcement learning (IRL), to determine online the Nash equilibrium solution for the two-player zerosum differential game with linear dynamics and infinite horizon quadratic cost. The algorithm is built around an iterative method that has been developed in the control engineeri...

We study a class of deterministic finite-horizon two-player nonzero-sum differential games where players are endowed with different kinds controls. assume that Player 1 uses piecewise-continuous controls, while 2 impulse For this games, we seek to derive conditions for the existence feedback Nash equilibrium strategies players. More specifically, provide verification theorem identifying such st...