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 88
Página
... Exercises contains brief solutions to enough of the exercises for the readers to be sure that they understand what is going on, and then usually leaves some exercises to be answered on their own. There is an extensive Bibliography that ...
... Exercises contains brief solutions to enough of the exercises for the readers to be sure that they understand what is going on, and then usually leaves some exercises to be answered on their own. There is an extensive Bibliography that ...
Página 6
... Exercise 0.2 Find a winning strategy for one of the players in games (3), (4), and (5) of Exercise 0.1. Exercise 0.3 In the game of Example 0.1, how many strategies does player A have and how many strategies does B have? Games in which ...
... Exercise 0.2 Find a winning strategy for one of the players in games (3), (4), and (5) of Exercise 0.1. Exercise 0.3 In the game of Example 0.1, how many strategies does player A have and how many strategies does B have? Games in which ...
Página 14
... Exercise 1.2 Find winning strategies in the following games. 1. Player A names a positive integer n and player B then names a positive integer k . A wins $1 from B if the sum n + k is odd, and B wins $1 from A if the sum n + k is even ...
... Exercise 1.2 Find winning strategies in the following games. 1. Player A names a positive integer n and player B then names a positive integer k . A wins $1 from B if the sum n + k is odd, and B wins $1 from A if the sum n + k is even ...
Página 18
... Exercise 1.8 Symmetry Find winning or non-losing strategies in the following games. 1. Two players take turns placing pennies on a large table (which is assumed to be circular or rectangular) until no further pennies can be put down. No ...
... Exercise 1.8 Symmetry Find winning or non-losing strategies in the following games. 1. Two players take turns placing pennies on a large table (which is assumed to be circular or rectangular) until no further pennies can be put down. No ...
Página 19
... have that player's three marks all on one line (horizontal, vertical, or diagonal) wins. Find a winning strategy for the first player. 9. 4 × 4 Tic-Tac-Toe. Exercise 1.10 Find winning strategies. Chapter one: 19 Combinatorial games.
... have that player's three marks all on one line (horizontal, vertical, or diagonal) wins. Find a winning strategy for the first player. 9. 4 × 4 Tic-Tac-Toe. Exercise 1.10 Find winning strategies. Chapter one: 19 Combinatorial games.
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