In this paper, two-person matrix games is considered whose elements of pay-off matrix are triangular fuzzy numbers (TFNs). To solve such game a new method based on α-cut of TFN is developed for each of the players. In this method, two auxiliary bi-objective linear programming (BOLP) models are derived. Then using average weighted approach these two BOLP models are decomposed into two auxiliary ...

In this paper, bi-matrix games are investigated based on L-R fuzzy variables. Also, based on the fuzzy max order several models in non-symmetrical L-R fuzzy environment is constructed and the existence condition of Nash equilibrium strategies of the fuzzy bi-matrix games is proposed. At last, based on the Nash equilibrium of crisp parametric bi-matrix games, we obtain the Pareto and weak Pareto...

In this paper, we study I-fuzzy bi-matrix games with I-fuzzy goals. The indeterminacy factor in the I-fuzzy goal of each player is resolved using the Hurwicz optimism-pessimism rule. As a result, such an I-fuzzy bi-matrix game reduces to solving a fuzzy optimization problem with S-shaped membership functions. The latter problem is equivalently converted into its crisp counterpart using the conv...

The basic aim of this paper is to an application of triangular intuitionistic fuzzy numbers(TIFNs) to a single non-cooperative bi-matrix games. Firstly, the concept of TIFNs and their cut sets are introduced as well as the inequality relations between two TIFNs. Secondly, a bi-matrix game with payoffs of TIFNs is considered and an attempt is made to conceptualize the meaning of a Nash-equilibri...

An evolutionarily stable strategy (ESS) was originally defined as a static concept but later given a dynamic characterization. A well known theorem in evolutionary game theory says that an ESS is an attractor of replicator dynamic but not every attractor is an ESS. We search for a dynamic characterization of ESSs in quantum games and find that in certain asymmetric bi-matrix games evolutionary ...

In bi-matrix games the Bishop-Cannings theorem of the classical evolutionary game theory does not permit pure evolutionarily stable strategies (ESSs) when a mixed ESS exists. We find the necessary form of twoqubit initial quantum states when a switch-over to a quantum version of the game also changes the evolutionary stability of a mixed symmetric Nash equilibrium. PACS: 02.50.Le, 03.67.-a, 87....

An evolutionarily stable strategy (ESS) was originally defined as a static concept but later given a dynamic characterization. A well known theorem in evolutionary game theory says that an ESS is an attractor of replicator dynamics but not every attractor is an ESS. We search for a dynamic characterization of ESSs in quantum games and find that in certain asymmetric bi-matrix games evolutionary...

We consider a two-player partial-information game on a Markov chain, where each player attempts to minimize its own cost over a finite time horizon. We show that this game has always a Nash equilibrium in stochastic behavioral policies. The technique used to prove this result is constructive but has severe limitations because it involves solving an extremely large bi-matrix game. To alleviate t...

This article puts forward the bi-matrix games with crisp parametric payoffs based on interval value function approach. We conclude that the equilibrium solution of the game model can converted into optimal solutions of the pair of the non-linear optimization problem. Finally, experiment results show the efficiency of the model.