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 46
Página 1
... as terminal positions; no moves are allowed from such a position, so that the game ends when such a position is reached. A play of the game consists of a sequence of moves starting at the initial position and ending at 1 Introduction.
... as terminal positions; no moves are allowed from such a position, so that the game ends when such a position is reached. A play of the game consists of a sequence of moves starting at the initial position and ending at 1 Introduction.
Página 3
... In many card games, the initial random move that consists of a distribution of cards is such that each player only knows the cards that were dealt to that player. Thus, in R Heads 1/2 Tails 1/2 B B H T H Introduction 3.
... In many card games, the initial random move that consists of a distribution of cards is such that each player only knows the cards that were dealt to that player. Thus, in R Heads 1/2 Tails 1/2 B B H T H Introduction 3.
Página 11
... consists of 13 sticks. The players move alternately, taking 1 or 2 sticks, and the last person to move wins. (As ... consisting of just 1 or 2 sticks and, therefore, B will not be the last person to move. Example 1.4 Let us describe a ...
... consists of 13 sticks. The players move alternately, taking 1 or 2 sticks, and the last person to move wins. (As ... consisting of just 1 or 2 sticks and, therefore, B will not be the last person to move. Example 1.4 Let us describe a ...
Página 15
... consists of doing nothing. If a particular game always must end before a player is required to make a move, then that player has a null strategy. If the game never ends with a loss for the player, then the null strategy is a non-losing ...
... consists of doing nothing. If a particular game always must end before a player is required to make a move, then that player has a null strategy. If the game never ends with a loss for the player, then the null strategy is a non-losing ...
Página 42
Alcanzaste el límite de visualización de este libro.
Alcanzaste el límite de visualización de este libro.
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