Results 211 to 220 of about 26,041,395 (239)
Some of the next articles are maybe not open access.

A 2-Person Game with Lack of Information on 1½ Sides

Mathematics of Operations Research, 1985
We consider a repeated 2-person 0-sum game with incomplete information about the pay-off matrix. Player I (maximizer) knows the real pay-off matrix but he is uncertain about the beliefs of his opponent. We show that in this case the Aumann-Maschler results on incomplete information on one side no longer hold.
Sylvain Sorin, Shmuel Zamir
openaire   +2 more sources

Extension of 2 Person Zero Sum Game

1975
Let X and Y “be the pure strategy sets of 2 players Xavier and Yves. Then every payoff function g: X × Y → R defin es a 2 person zero sum game where Xavier maximize and Yves minimize. An extension of the games with pure strategy set X and Y is a “way of playing” the game, which associates to every payoff function g a “value”, in the duality interval
openaire   +1 more source

A LINEAR PROGRAMMING MODEL FOR SOLVING COMPLEX 2‐PERSON ZERO‐SUM GAMES

Studies in Economics and Finance, 1990
Two‐person zero‐sum game theory has long been a popular topic of research in business and economics. The purpose of this paper is to discuss how to convert a two‐person zero‐sum game into a linear programming problem and to present a computer simulation model for solving large bilateral zero‐sum games problems.
openaire   +1 more source

On Stationary Strategies in Positive Stochastic 1 and 2 Person Games with General State Space

1984
The paper deals with general state space dynamic programming problems with positive rewards. For two-person stochastic games with a special law of motion the existence of uniformly good stationary strategies is stated. The question, whether this is also true for games with an arbitrary law of motion, is left open, but the result can be applied to one ...
openaire   +2 more sources

FINITE APPROXIMATION OF NONCOOPERATIVE 2-PERSON GAMES PLAYED IN STAIRCASE-FUNCTION CONTINUOUS SPACES

В. В. Романюк Скінченна апроксимація безкоаліційних ігор двох осіб, що розігруються у неперервних просторах сходинкових функцій Проблематика. Існує відомий спосіб апроксимації неперервних безкоаліційних ігор двох осіб, де наближений розв’язок (ситуація рівноваги) вважається прийнятним, якщо він змінюється мінімально за мінімальної зміни кроку ...
openaire   +1 more source

Evolutionary stability in extensive two-person games

Mathematical Social Sciences, 1983
Reinhard Selten
exaly  

A systematic approach of multi-person games

International Journal of Internet and Enterprise Management, 2009
Erika Griechisch, Ferenc Szidarovszky
exaly  

On equilibrium points of diagonaln-person games

Journal of Optimization Theory and Applications, 1990
E Marchi
exaly  

Home - About - Disclaimer - Privacy