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 65
Página 1
... move from that position and what are the allowable moves from that position to other positions. At each position p, there must be at least one sequence of moves from the initial position to p. (Otherwise, that position could never enter ...
... move from that position and what are the allowable moves from that position to other positions. At each position p, there must be at least one sequence of moves from the initial position to p. (Otherwise, that position could never enter ...
Página 2
... move from a given position to another position is represented by an arrow. These arrows can be labeled for easy ... move, a player can remove either one stick or two sticks. The last player to move wins and the other player loses. Player ...
... move from a given position to another position is represented by an arrow. These arrows can be labeled for easy ... move, a player can remove either one stick or two sticks. The last player to move wins and the other player loses. Player ...
Página 3
... moves is not made by one of the players but by a device that selects each of the possible moves with a certain probability. For example, the device might toss a coin and then choose one move if the coin shows a Head and another move if ...
... moves is not made by one of the players but by a device that selects each of the possible moves with a certain probability. For example, the device might toss a coin and then choose one move if the coin shows a Head and another move if ...
Página 4
... move may not know which of several positions that player may be in. 1 When such situations cannot occur, that is, when the outcome of every possible move is known to all the players, the game is called a game with perfect information ...
... move may not know which of several positions that player may be in. 1 When such situations cannot occur, that is, when the outcome of every possible move is known to all the players, the game is called a game with perfect information ...
Página 5
... moves are completely determined. When all the players choose their strategies, the course of the game and its outcomes are determined; the players could leave the actual performance of the moves to assistants or to machines. For almost ...
... moves are completely determined. When all the players choose their strategies, the course of the game and its outcomes are determined; the players could leave the actual performance of the moves to assistants or to machines. For almost ...
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