Displaying similar documents to “Noncooperative games with noncompact joint strategies sets: increasing best responses and approximation to equilibrium points”

A two armed bandit type problem revisited

Gilles Pagès (2005)

ESAIM: Probability and Statistics


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.

Game saturation of intersecting families

Balázs Patkós, Máté Vizer (2014)

Open Mathematics


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...