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 28
Página 2
... lose at that terminal position (positive numbers indicating winnings and negative numbers losses). If the sum of the pay ... loses. Player A has the first move. The directed graph for this game is shown in Figure 0.1. (Each segment is ...
... lose at that terminal position (positive numbers indicating winnings and negative numbers losses). If the sum of the pay ... loses. Player A has the first move. The directed graph for this game is shown in Figure 0.1. (Each segment is ...
Página 5
... loses three dollars to B if A's card is black. 9. A fair coin is tossed until a Head turns up. If the number of ... Lose, or Draw are the possible pay-offs, a winning strategy is one that guarantees a Win, no matter what the opponents do ...
... loses three dollars to B if A's card is black. 9. A fair coin is tossed until a Head turns up. If the number of ... Lose, or Draw are the possible pay-offs, a winning strategy is one that guarantees a Win, no matter what the opponents do ...
Página 6
... loses. (Notice that, in a certain sense, this is the opposite of the 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 ...
... loses. (Notice that, in a certain sense, this is the opposite of the 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 ...
Página 10
... loses. b. The same game as in (a), except that the last person to move wins. 3. The first player A chooses one of the numbers 1 and 2, and then the game is over (without player B making any moves at all). A pays B one dollar if A has ...
... loses. b. The same game as in (a), except that the last person to move wins. 3. The first player A chooses one of the numbers 1 and 2, and then the game is over (without player B making any moves at all). A pays B one dollar if A has ...
Página 11
... loses. Observe that (A 1 ) is not a winning strategy; is B left responds with one with stick strategy to remove (B1 ), and that loses. is, if B removes a second stick, then A Example 1.2 Consider the same game as in Example 1.1, except ...
... loses. Observe that (A 1 ) is not a winning strategy; is B left responds with one with stick strategy to remove (B1 ), and that loses. is, if B removes a second stick, then A Example 1.2 Consider the same game as in Example 1.1, except ...
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