Results 261 to 270 of about 113,430,123 (286)
Some of the next articles are maybe not open access.

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

REPUTATION AND COMMITMENT IN 2-PERSON REPEATED GAMES WITHOUT DISCOUNTING

Two-person repeated games with no discounting are considered where there is uncertainty about the type of the players. If there is a possibility that a player is an automaton committed to a particular pure or mixed stage-game action, then this provides a lower bound on the Nash equilibrium payoffs to a normal type of this player. The lower bound is the
openaire   +1 more source

SUBGAME-PERFECT ATTAINMENT OF MINIMAX PUNISHMENTS IN DISCOUNTED 2-PERSON GAMES

Necessary and sufficient conditions are given for minimax payoff levels to be attained in a subgame-perfect equilibrium of repeated two-person games for sufficiently low discounting.
openaire   +1 more source

Evolutionary Dynamics of Cooperation in the N-Person Stag Hunt Game

Physica D: Nonlinear Phenomena, 2021
QIn Luo, Xiaojie Chen, Linjie Liu
exaly  

The Two-Person and Zero-Sum Matrix Game With Probabilistic Linguistic Information

Information Sciences, 2021
Huchang Liao, Xiaomei Mi, Xiao-Jun Zeng
exaly  

Pool-Rewarding in N-Person Snowdrift Game

Chaos, Solitons and Fractals, 2021
Kun Li, Rui Cong
exaly  

Dynamics of n-Person Cournot Games With Asymmetric Information and Heterogeneous Expectations

Physica A: Statistical Mechanics and Its Applications, 2023
Jinxiu Pi
exaly  

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

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

An End-Game for Cancer

Ca-A Cancer Journal for Clinicians, 2000
J R Seffrin, John R Seffrin
exaly  

Home - About - Disclaimer - Privacy