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 90
Página 2
... game in question ends only in a win (W) or a loss (L) for each player, then the triple (L,L,W) would indicate that A and B have lost and C has won.) Example 0.1 Consider the following game for two players A and B. Start with a pile of ...
... game in question ends only in a win (W) or a loss (L) for each player, then the triple (L,L,W) would indicate that A and B have lost and C has won.) Example 0.1 Consider the following game for two players A and B. Start with a pile of ...
Página 3
... game, a random position can be labeled with a special symbol, such as "R," and the numerical probabilities of the moves from that position can be attached to the arrows representing those moves. A game ... following: A fair coin is thrown.
... game, a random position can be labeled with a special symbol, such as "R," and the numerical probabilities of the moves from that position can be attached to the arrows representing those moves. A game ... following: A fair coin is thrown.
Página 4
... game is finite, deterministic, and zero-sum. Exercise 0.1 For each of the following games, determine whether it has the properties of being finite, deterministic, zero-sum, or with perfect information. Describe the initial positions and ...
... game is finite, deterministic, and zero-sum. Exercise 0.1 For each of the following games, determine whether it has the properties of being finite, deterministic, zero-sum, or with perfect information. Describe the initial positions and ...
Página 5
... game is over, or A "bets" three dollars. If A bets, then B can either "fold", pay one dollar to A, and the game is ... following that strategy always receives a nonnegative pay-off, no matter what the player's opponents do. Similarly ...
... game is over, or A "bets" three dollars. If A bets, then B can either "fold", pay one dollar to A, and the game is ... following that strategy always receives a nonnegative pay-off, no matter what the player's opponents do. Similarly ...
Página 6
... game in Example 0.1, where the last person to move wins.) Player B has the following winning strategy in this game. If A starts by taking one stick, then B should remove two, forcing A to remove the last stick. If A starts by removing ...
... game in Example 0.1, where the last person to move wins.) Player B has the following winning strategy in this game. If A starts by taking one stick, then B should remove two, forcing A to remove the last stick. If A starts by removing ...
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