We study existence of (subgame perfect) Nash equilibria (NE) in pure positional strategies in finite positional n-person games with perfect information and terminal payoffs. However, these games may have moves of chance and cycles. Yet, we assume that All Infinite Plays Form One Outcome a∞, in addition to the set of Terminal outcomes VT . This assumption will be called the AIPFOOT condition. Fo...

In this paper, we consider a two persons zero sum game with imprecise values in payoff matrix. All the imprecise values are assumed to be octagonal fuzzy numbers. An approach for solving problems by using ranking of the fuzzy numbers has been considered to solve the fuzzy game problem. By using ranking to the payoffs we convert the fuzzy valued game problem to crisp valued game problem, which c...

A discretized game model of an anti-missile defense scenario is presented. Such an engagement is a pursuit of a "blind" evader, committed to satisfy a terminal constraint. It can be formulated as an incomplete information zero-sum pursuit-evasion game with state constraint. Such a game becomes non trivial if the evader has higher maneuverability than the pursuer. In this case the game admits a ...

let $r$ be a commutative ring with zero-divisor set $z(r)$. the total graph of $r$, denoted by$t(gamma(r))$, is the simple (undirected) graph with vertex set  $r$ where two distinct vertices areadjacent if their sum lies in $z(r)$.this work considers minimum zero-sum $k$-flows for $t(gamma(r))$.both for $vert rvert$ even and the case when $vert rvert$ is odd and $z(g)$ is an ideal of $r$it is s...

Finding Nash equilibrium in a two-player normal form game (2-Nash) is one of the most extensively studied problem within mathematical economics as well as theoretical computer science. Such a game can be represented by two payoff matrices A and B, one for each player. 2Nash is PPAD-complete in general, while in case of zero-sum games (B = −A) the problem reduces to LP and hence is in P. Extendi...

recently, e. m'{a}v{c}ajov'{a} and m. v{s}koviera proved that every bidirected eulerian graph which admits a nowhere zero flow, admits a nowhere zero $4$-flow. this result shows the validity of bouchet's nowhere zero conjecture for eulerian bidirected graphs. in this paper we prove the same theorem in a different terminology and with a short and simple proof. more precisely, we p...

This paper addresses the control of a team of autonomous agents pursuing a smart evader in a nonaccurately mapped terrain. By describing this problem as a partial information Markov game, we are able to integrate map-learning and pursuit. We propose receding horizon control policies, in which the pursuers and the evader try to respectively maximize and minimize the probability of capture at the...

In traditional game theory, players are typically endowed with exogenously given knowledge of the structure of the game—either full omniscient knowledge or partial but fixed information. In real life, however, people are often unaware of the utility of taking a particular action until they perform research into its consequences. In this paper, we introduce Socratic game theory to model this phe...

This paper is concerned with a new type of differential game problems of forward-backward stochastic systems. There are three distinguishing features: Firstly, our game systems are forward-backward doubly stochastic differential equations, which is a class of more general game systems than other forward-backward stochastic game systems without doubly stochastic terms; Secondly, forward equation...