FINITE APPROXIMATION OF NONCOOPERATIVE 2-PERSON GAMES PLAYED IN STAIRCASE-FUNCTION CONTINUOUS SPACES
V. Romanuke Finite approximation of noncooperative 2-person games played in staircase-function continuous spaces Background. There is a known method of approximating continuous noncooperative 2-person games, wherein an approximate solution (an equilibrium situation) is considered acceptable if it changes minimally by changing the sampling step ...
openaire +2 more sources
ON THE LEARNING ALGORITHM OF 2-PERSON ZERO-SUM MARKOV GAME WITH EXPECTED AVERAGE REWARD CRITERION [PDF]
This is one of several papers of the author dealing with a dynamic programming based algorithm for solving certain zero-sum Markov games. These games are more commonly known in the game theoretic literature as stochastic games. For a class of such games, satisfying a certain ergodicity property, there is a well known algorithm converging to the value ...
openaire +2 more sources
Pareto-efficient strategies in 2-person games in staircase-function continuous and finite spaces
A tractable method of solving noncooperative 2-person games in which strategies are staircase functions is suggested. The solution is meant to be Pareto-efficient. The method considers any 2-person staircase-function game as a succession of 2-person games in which strategies are constants.
openaire +1 more source
A 2-person game on a polyhedral set of connected strategies
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Narcissistic and dependent traits and behavior in four archetypal 2-person, 2-choice games
IntroductionThe characteristic behaviors we use to define personality pathology arise from specific interpersonal interactions. In an effort to create a laboratory-based context in which behavior might be expected to be influenced by particular personality traits, we used four 2-person, 2-choice games (the Prisoner’s Dilemma, Chicken, Leader, and Hero ...
Lawrence Ian Reed +4 more
openaire +3 more sources
A 2-Person Game Decomposing 2-Manifolds
Two players play a game by alternately splitting a surface of a compact $2$-manifold along a simple closed curve that is not null-homotopic and attaching disks to the resulting boundary; the last player who can move wins. Starting from an orientable surface, the $G$-series is $01\dot{2}\dot{0}$ according to increasing genus.
Berman, David R., Leonard, Lee O.
openaire +2 more sources
ON THE LEARNING ALGORITHM OF 2-PERSON ZERO-SUM MARKOV GAME [PDF]
Tanaka, Kensuke, Homma, Hisafumi
openaire +2 more sources
Competitive 2-person percentile game theory with direct consideration of payoff matrices
Considered is the cases of two persons who have finite numbers of strategies and who act competitively toward each other. Separately and independently, each player selects one of his strategies. The payoffs to a player for the possible strategy combinations can be conveniently expressed in matrix form, where the rows are his strategies and the columns ...
openaire +1 more source
Prêt-à-Jouer: commercial videogames as ready-made human perception labs. [PDF]
Munneke J, Anthony B, Corbett JE.
europepmc +1 more source
The use of voiceovers and review games in teaching immunology. [PDF]
Chou E +11 more
europepmc +1 more source

