Search results
Results from the WOW.Com Content Network
The first volume introduces combinatorial game theory and its foundation in the surreal numbers; partizan and impartial games; Sprague–Grundy theory and misère games. The second volume applies the theorems of the first volume to many games, including nim , sprouts , dots and boxes , Sylver coinage , philosopher's phutball , fox and geese .
Almgren–Pitts min-max theory; Approximation theory; Arakelov theory; Asymptotic theory; Automata theory; Bass–Serre theory; Bifurcation theory; Braid theory; Brill–Noether theory; Catastrophe theory; Category theory; Chaos theory; Character theory; Choquet theory; Class field theory; Cobordism theory; Coding theory; Cohomology theory ...
Von Neumann's work in game theory culminated in his 1944 book Theory of Games and Economic Behavior, co-authored with Oskar Morgenstern. [12] The second edition of this book provided an axiomatic theory of utility, which reincarnated Daniel Bernoulli's old theory of utility (of money) as an independent discipline. This foundational work ...
Theory of Games and Economic Behavior, published in 1944 [1] by Princeton University Press, is a book by mathematician John von Neumann and economist Oskar Morgenstern which is considered the groundbreaking text that created the interdisciplinary research field of game theory.
The Mathematics of Games and Gambling is a book on probability theory and its application to games of chance. It was written by Edward Packel, and published in 1981 by the Mathematical Association of America as volume 28 of their New Mathematical Library series, with a second edition in 2006.
For the purposes of the Sprague–Grundy theorem, a game is a two-player sequential game of perfect information satisfying the ending condition (all games come to an end: there are no infinite lines of play) and the normal play condition (a player who cannot move loses).
The mathematics of gambling is a collection of probability applications encountered in games of chance and can get included in game theory.From a mathematical point of view, the games of chance are experiments generating various types of aleatory events, and it is possible to calculate by using the properties of probability on a finite space of possibilities.
Zermelo's theorem can be applied to all finite-stage two-player games with complete information and alternating moves. The game must satisfy the following criteria: there are two players in the game; the game is of perfect information; the board game is finite; the two players can take alternate turns; and there is no chance element present.