ABSTRACT In this paper the entropy function of the matrix game has been considered as one of the objectives and formulate a new game model, named Entropy Matrix Goal Game Model. Non-linear programming model for each player has been established. The equilibrium condition on matrix game is based on expected pay-off, so this equilibrium condition might be violated by mixed strategies when replicat...

A twoperson non-zero-sum bimatrix game (A, B) is defined to be completely mixed if every solution gives a positive probability to each pure strategy of each player. Such a game is defined to be nonsingular if both payoff matrices are nonsingular. Suppose that A is perturbed to A + aG and B is perturbed to B + aH, where C and H are matrices of the same size as A and B, and OL is a small real num...

First-order (i.e., gradient-based) methods for solving two-person zero-sum sequential games of imperfect information have recently become important tools in the construction of game theory-based agents. The computation time per iteration is typically dominated by matrix-vector product operations involving the payoff matrix A. In this paper, we describe two techniques for scaling up this operati...

The zero-sum matrix game is one of the most classic game models, and it is widely used in many scientific and engineering fields. In the real world, due to the complexity of the decision-making environment, sometimes the payoffs received by players may be inexact or uncertain, which requires that the model of matrix games has the ability to represent and deal with imprecise payoffs. To meet suc...

The vital functions of modern human take place in the conditions postmodern influence informative society. On a gamification background social processes, to availability impressions various orientation and highly emotional force, wide variantness reference-points brindle obtrusive repetition influences become main signs such influence. It results supersaturating cultural space different models,...

We have seen that Nash equilibria in two-player zero-sum games (and generalizations thereof) are polynomial-time tractable from a centralized computation perspective. We have also seen that the payoff matrix of a zero-sum game determines a unique value for the row player and a unique value for the column player (summing to zero), which specify their payoffs in all equilibria of the game. In thi...

In this paper I quantize the stag hunt game in the framework proposed by Marinatto and Weber which, is introduced to quntize the Battle of the Sexes game and gives a general quntization scheme of various game theories. Then I discuss the Nash equibilium solution in the cases of which starting strategies are taken in both non entangled state and entangled state and uncover the structure of Nash ...