Decision theory: von Neumann's contributions.
Page 1
Displaying 1 – 8 of 8
Degrees of indeterminacy of games
Andreas Blass (1972)
Fundamenta Mathematicae
Discrete and nondiscrete duels
T. Radzik, K. Orłowski (1983)
Applicationes Mathematicae
Domination Game: Extremal Families for the 3/5-Conjecture for Forests
Michael A. Henning, Christian Löwenstein (2017)
Discussiones Mathematicae Graph Theory
In the domination game on a graph G, the players Dominator and Staller alternately select vertices of G. Each vertex chosen must strictly increase the number of vertices dominated. This process eventually produces a dominating set of G; Dominator aims to minimize the size of this set, while Staller aims to maximize it. The size of the dominating set produced under optimal play is the game domination number of G, denoted by γg(G). Kinnersley, West and Zamani [SIAM J. Discrete Math. 27 (2013) 2090-2107]...
Duels with possibly asymmetric goals
M. Fox (1980)
Applicationes Mathematicae
Dynamic Programming Principle for tug-of-war games with noise
Juan J. Manfredi, Mikko Parviainen, Julio D. Rossi (2012)
ESAIM: Control, Optimisation and Calculus of Variations
We consider a two-player zero-sum-game in a bounded open domain Ω described as follows: at a point x ∈ Ω, Players I and II play an ε-step tug-of-war game with probability α, and with probability β (α + β = 1), a random point in the ball of radius ε centered at x is chosen. Once the game position reaches the boundary, Player II pays Player I the amount given by a fixed payoff function F. We give a detailed proof of the fact that...
Dynamic Programming Principle for tug-of-war games with noise
Juan J. Manfredi, Mikko Parviainen, Julio D. Rossi (2012)
ESAIM: Control, Optimisation and Calculus of Variations
We consider a two-player zero-sum-game in a bounded open domain Ω described as follows: at a point x ∈ Ω, Players I and II play an ε-step tug-of-war game with probability α, and with probability β (α + β = 1), a random point in the ball of radius ε centered at x is chosen. Once the game position reaches the boundary, Player II pays Player I the amount given by a fixed payoff function F. We give a detailed proof of the fact that the value functions of this game satisfy the Dynamic Programming Principle...
Dynamic Programming Principle for tug-of-war games with noise
Juan J. Manfredi, Mikko Parviainen, Julio D. Rossi (2012)
ESAIM: Control, Optimisation and Calculus of Variations
We consider a two-player zero-sum-game in a bounded open domain Ω described as follows: at a point x ∈ Ω, Players I and II play an ε-step tug-of-war game with probability α, and with probability β (α + β = 1), a random point in the ball of radius ε centered at x is chosen. Once the game position reaches the boundary, Player II pays Player I the amount given by a fixed payoff function F. We give a detailed proof of the fact that...
Currently displaying 1 – 8 of 8
Page 1