A biased roulette
Page 1 Next
Displaying 1 – 20 of 51
A characterization of evolutionarily stable strategies.
Länger, Helmut (1993)
Mathematica Pannonica
A game of composing binary relations
P. GoralČík, Z. Hedrlín, V. Koubek, J. Ryšunková (1982)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
A gradient-type algorithm for the numerical solution of two-player zero-sum differential game problems
Jaroslav Doležal (1978)
Kybernetika
A probabilistic approach to automaton-environment systems
Ivan Kramosil (1975)
Kybernetika
An extended view of the Chu-construction.
Koslowski, Jürgen (2006)
Theory and Applications of Categories [electronic only]
An infinite solitaire game with a random strategy
Andrzej Ehrenfeucht, Jan Mycielski (1979)
Colloquium Mathematicae
Boolean games – Classifying strategies and omitting cardinality assumptions
Vojtáš, Peter (1984)
Proceedings of the 11th Winter School on Abstract Analysis
Calcul des probabilités et modélisation.
Henri Carnal (1994)
Elemente der Mathematik
Conway's Games and Some of their Basic Properties
Robin Nittka (2011)
Formalized Mathematics
We formulate a few basic concepts of J. H. Conway's theory of games based on his book [6]. This is a first step towards formalizing Conway's theory of numbers into Mizar, which is an approach to proving the existence of a FIELD (i.e., a proper class that satisfies the axioms of a real-closed field) that includes the reals and ordinals, thus providing a uniform, independent and simple approach to these two constructions that does not go via the rational numbers and hence does for example not need...
Détermination des jeux boréliens et problèmes logiques associés
Serge Grigorieff (1975/1976)
Séminaire Bourbaki
Diagonal checker-jumping and Eulerian numbers for color-signed permutations.
Eriksen, Niklas, Eriksson, Henrik, Eriksson, Kimmo (2000)
The Electronic Journal of Combinatorics [electronic only]
Exercices de mathématiques générales
(1925)
Nouvelles annales de mathématiques : journal des candidats aux écoles polytechnique et normale
Hercules and Hydra
Martin Loebl (1988)
Commentationes Mathematicae Universitatis Carolinae
Hercules and Hydra, a game on rooted finite trees
Martin Loebl (1985)
Commentationes Mathematicae Universitatis Carolinae
Hercules versus Hidden Hydra Helper
Jiří Matoušek, Martin Loebl (1991)
Commentationes Mathematicae Universitatis Carolinae
L. Kirby and J. Paris introduced the Hercules and Hydra game on rooted trees as a natural example of an undecidable statement in Peano Arithmetic. One can show that Hercules has a “short” strategy (he wins in a primitively recursive number of moves) and also a “long” strategy (the finiteness of the game cannot be proved in Peano Arithmetic). We investigate the conflict of the “short” and “long” intentions (a problem suggested by J. Nešetřil). After each move of Hercules (trying to kill Hydra fast)...
Infinite games and singular sets
John C. Morgan II (1974)
Colloquium Mathematicae
Information and the Bayesian-Nash equilibrium in a game with incomplete information.
Parpucea, Ilie, Bătrâncea, Larissa-Margareta (2009)
Acta Universitatis Apulensis. Mathematics - Informatics
Linear time-optimal control problem with incomplete information about state. Optimization of guaranteed result
Zdzisław Wyderka (1989)
Kybernetika
Method of construction of the evasion strategy for differential games with many pursuers [Book]
Witold Rzymowski (1986)
Currently displaying 1 – 20 of 51
Page 1 Next