Introducing Game Theory and its ApplicationsCRC Press, 2016 M02 3 - 272 páginas The mathematical study of games is an intriguing endeavor with implications and applications that reach far beyond tic-tac-toe, chess, and poker to economics, business, and even biology and politics. Most texts on the subject, however, are written at the graduate level for those with strong mathematics, economics, or business backgrounds. |
Dentro del libro
Resultados 1-5 de 52
Página 5
... strategy . The original meaning of the word was "the art of directing the larger military movements and operations ... play checkers or chess. Good checkers and chess players depend upon their own intuition and experience, not upon an ...
... strategy . The original meaning of the word was "the art of directing the larger military movements and operations ... play checkers or chess. Good checkers and chess players depend upon their own intuition and experience, not upon an ...
Página 10
... playing it. It is an amazing fact that Tic-Tac-Toe is, in an important way, typical of all combinatorial ... strategies, that is, they can make sure that they never lose. Even in as simple a game as Tic-Tac-Toe, the description of a strategy ...
... playing it. It is an amazing fact that Tic-Tac-Toe is, in an important way, typical of all combinatorial ... strategies, that is, they can make sure that they never lose. Even in as simple a game as Tic-Tac-Toe, the description of a strategy ...
Página 14
... plays according to the indicated instructions. Exercise 1.2 Find winning strategies in the following games. 1 ... strategy when n is of the form 3k + 1 (that is, 1, 4, 7, 10, 13,...), and the first player A has a winning strategy in all ...
... plays according to the indicated instructions. Exercise 1.2 Find winning strategies in the following games. 1 ... strategy when n is of the form 3k + 1 (that is, 1, 4, 7, 10, 13,...), and the first player A has a winning strategy in all ...
Página 15
... strategy. We shall show that this would imply the possibility of a play of the game with infinitely many moves, contradicting the finiteness condition for combinatorial games. By a non-losing position for player A we mean a situation in ...
... strategy. We shall show that this would imply the possibility of a play of the game with infinitely many moves, contradicting the finiteness condition for combinatorial games. By a non-losing position for player A we mean a situation in ...
Página 17
... strategies. In looser language, we can say that any combinatorial game is either unfair (that is, one of the players always will win by correctly playing a winning strategy) or it is uninteresting (that is, if both players correctly play ...
... strategies. In looser language, we can say that any combinatorial game is either unfair (that is, one of the players always will win by correctly playing a winning strategy) or it is uninteresting (that is, if both players correctly play ...
Contenido
1 | |
9 | |
Twoperson Zerosum Games | 53 |
The Simplex Method The Fundamental Theorem of Duality Solution of Twoperson Zerosum Games | 109 |
Nonzerosum Games and kPerson Games | 143 |
Finite Probability Theory | 207 |
Utility Theory | 219 |
Nashs Theorem | 223 |
Answers to Selected Exercises | 227 |
Bibliography | 247 |
Back Cover | 256 |
Otras ediciones - Ver todas
Términos y frases comunes
alternately apply assigned assume basic point Black called canonical lpp choose collection column condition Consider consists constants constraints contains corresponding defined definition determined dominates draw entry equal equation equilibrium pair event Example Exercise expected fact fair Figure Find game matrix given graph Heads Hence imputation integer k-tuple least linear look loses matrix matrix games maximin Maximize maximum mean method Minimize mixed move Nash equilibrium non-losing strategy Note objective function obtain occurs optimal original outcomes pay-offs perfect pile pivot play player position possible prefers probability procedure proof pure random receive remove respect result saddle point segment Shapley value side Similarly simplex simplex method solution solve square standard sticks strategy for player tableau Theorem third two-person variables White winning strategy yields