Necessary optimality conditions for -player nonzero-sum multistage games
Jaroslav Doležal (1976)
Kybernetika
Similarity:
Jaroslav Doležal (1976)
Kybernetika
Similarity:
Gilles Pagès (2005)
ESAIM: Probability and Statistics
Similarity:
In Benaïm and Ben Arous (2003) is solved a multi-armed bandit problem arising in the theory of learning in games. We propose a short and elementary proof of this result based on a variant of the Kronecker lemma.
Xu, Jiuping, Yao, Liming (2010)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Balázs Patkós, Máté Vizer (2014)
Open Mathematics
Similarity:
We consider the following combinatorial game: two players, Fast and Slow, claim k-element subsets of [n] = 1, 2, …, n alternately, one at each turn, so that both players are allowed to pick sets that intersect all previously claimed subsets. The game ends when there does not exist any unclaimed k-subset that meets all already claimed sets. The score of the game is the number of sets claimed by the two players, the aim of Fast is to keep the score as low as possible, while the aim of...
Jaroslav Doležal (1978)
Kybernetika
Similarity:
Collins, David (2005)
Integers
Similarity: