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 45
Página
... ......................................9 1.1 Definition of combinatorial game.....................................................9 1.2 The fundamental theorem for combinatorial games...................15 1.3 Nim .............
... ......................................9 1.1 Definition of combinatorial game.....................................................9 1.2 The fundamental theorem for combinatorial games...................15 1.3 Nim .............
Página 7
... business and economics, politics, or biology and other sciences can skim through Chapter 1 and then move on to Chapter 2. chapter one Combinatorial games 1.1 Definition of combinatorial game Combinatorial Introduction 7.
... business and economics, politics, or biology and other sciences can skim through Chapter 1 and then move on to Chapter 2. chapter one Combinatorial games 1.1 Definition of combinatorial game Combinatorial Introduction 7.
Página 9
... definition recommends them as our initial entry into the theory of games. By a combinatorial game we shall mean any game with the following characteristics. 1. There are only two players. 2. It is deterministic, that is, there are no ...
... definition recommends them as our initial entry into the theory of games. By a combinatorial game we shall mean any game with the following characteristics. 1. There are only two players. 2. It is deterministic, that is, there are no ...
Página 15
... define a non-losing position for player B as a situation in the play of the game from which point player B then has a non-losing strategy. By our assumption that neither player has a non-losing strategy for the whole game, it follows ...
... define a non-losing position for player B as a situation in the play of the game from which point player B then has a non-losing strategy. By our assumption that neither player has a non-losing strategy for the whole game, it follows ...
Página 16
... Define a new combinatorial game G* that is the same as G except with respect to certain pay-offs. Whenever the original game G resulted in a draw, let the new game G* assign 1 to player Y and –1 to player X. Thus, G* has no draws. The ...
... Define a new combinatorial game G* that is the same as G except with respect to certain pay-offs. Whenever the original game G resulted in a draw, let the new game G* assign 1 to player Y and –1 to player X. Thus, G* has no draws. The ...
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
Introducing Game Theory and Its Applications ELLIOTT. ZWILLINGER MENDELSON (DAN.),Dan Zwillinger Sin vista previa disponible - 2024 |
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