An open toss problem.
Bajaj, Prem N., Mendieta, G.R. (1993)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Displaying similar documents to “Two game-set inequalities.”
An open toss problem.
A two armed bandit type problem revisited
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.
Pilesize dynamic one-pile Nim and Beatty's theorem.
Holshouser, Arthur, Reiter, Harold, Rudzinski, James (2004)
Integers
Similarity:
Blocking Wythoff Nim.
Larsson, Urban (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Variations on a theme of Euclid.
Collins, David (2005)
Integers
Similarity:
Set-theoretic inequalities in stochastic noncooperative games with coalition.
Dshalalow, Jewgeni H., Treerattrakoon, Ailada (2008)
Journal of Inequalities and Applications [electronic only]
Similarity:
Mixed complementarity problems for robust optimization equilibrium in bimatrix game
Guimei Luo (2012)
Applications of Mathematics
Similarity:
In this paper, we investigate the bimatrix game using the robust optimization approach, in which each player may neither exactly estimate his opponent’s strategies nor evaluate his own cost matrix accurately while he may estimate a bounded uncertain set. We obtain computationally tractable robust formulations which turn to be linear programming problems and then solving a robust optimization equilibrium can be converted to solving a mixed complementarity problem under the -norm. Some...
Game saturation of intersecting families
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...
Lower bounds for -ary codes with large covering radius.
Haas, Wolfgang, Halupczok, Immanuel, Schlage-Puchta, Jan-Christoph (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On three-rowed chomp.
Brouwer, Andries E., Horváth, Gábor, Molnár-Sáska, Ildikó, Szabó, Csaba (2005)
Integers
Similarity: