Introduction to Game TheorySpringer Science & Business Media, 2012 M12 6 - 252 páginas The mathematical theory of games has as its purpose the analysis of a wide range of competitive situations. These include most of the recreations which people usually call "games" such as chess, poker, bridge, backgam mon, baseball, and so forth, but also contests between companies, military forces, and nations. For the purposes of developing the theory, all these competitive situations are called games. The analysis of games has two goals. First, there is the descriptive goal of understanding why the parties ("players") in competitive situations behave as they do. The second is the more practical goal of being able to advise the players of the game as to the best way to play. The first goal is especially relevant when the game is on a large scale, has many players, and has complicated rules. The economy and international politics are good examples. In the ideal, the pursuit of the second goal would allow us to describe to each player a strategy which guarantees that he or she does as well as possible. As we shall see, this goal is too ambitious. In many games, the phrase "as well as possible" is hard to define. In other games, it can be defined and there is a clear-cut "solution" (that is, best way of playing). |
Dentro del libro
Resultados 1-5 de 59
Página
... exercises which ask for proofs . It is also recognized , however , that this is an applied subject and so its computational aspects have not at all been ignored . There were a few foreshadowings of game theory in the 1920's and 1930's ...
... exercises which ask for proofs . It is also recognized , however , that this is an applied subject and so its computational aspects have not at all been ignored . There were a few foreshadowings of game theory in the 1920's and 1930's ...
Página
... Exercise ( 4 ) of Section 1.2 . 3 4 5 ∞ 8 9 10 12 1.8 A game tree . 18 1.9 Some choice subtrees for A. 18 1.10 A choice subtree for B. 19 1.11 A game with chance moves . 22 1.12 Game tree for Exercise ( 2 ) of Section 1.4 . 25 1.13 A ...
... Exercise ( 4 ) of Section 1.2 . 3 4 5 ∞ 8 9 10 12 1.8 A game tree . 18 1.9 Some choice subtrees for A. 18 1.10 A choice subtree for B. 19 1.11 A game with chance moves . 22 1.12 Game tree for Exercise ( 2 ) of Section 1.4 . 25 1.13 A ...
Página
... exercises . 191 7.3 Initial configuration of a mancala board . 195 7.4 Mancala board after two moves . 196 7.5 Board for nine men's morris . 198 7.6 Nine men's morris board after 18 moves . 199 A.1 Two cuttings . 202 A.2 A quotient tree ...
... exercises . 191 7.3 Initial configuration of a mancala board . 195 7.4 Mancala board after two moves . 196 7.5 Board for nine men's morris . 198 7.6 Nine men's morris board after 18 moves . 199 A.1 Two cuttings . 202 A.2 A quotient tree ...
Página 4
... Exercise ( 8 ) . Thus , a path in a tree has length at most the number of vertices minus one . The depth of a tree is the length of the longest path in it . In Figure 1.3 , ( c , g , i ) is a path of length 2 , as is ( root , b , f ) ...
... Exercise ( 8 ) . Thus , a path in a tree has length at most the number of vertices minus one . The depth of a tree is the length of the longest path in it . In Figure 1.3 , ( c , g , i ) is a path of length 2 , as is ( root , b , f ) ...
Página 6
... Exercise ( 14 ) . ☐ Let T be a tree and u a vertex of T. The quotient tree T / u is defined as follows : The vertices of T / u are the vertices of T with the descendants of u removed ; the edges of T / u are the edges of T which start ...
... Exercise ( 14 ) . ☐ Let T be a tree and u a vertex of T. The quotient tree T / u is defined as follows : The vertices of T / u are the vertices of T with the descendants of u removed ; the edges of T / u are the edges of T which start ...
Contenido
Linear Programming | 65 |
Solving Matrix Games 99 | 98 |
NonZeroSum Games | 115 |
NPerson Cooperative Games | 149 |
GamePlaying Programs | 185 |
Appendix Solutions | 201 |
Bibliography | 223 |
Otras ediciones - Ver todas
Términos y frases comunes
alpha-beta pruning arbitration pair Axiom basic solution bi-matrix chance moves characteristic function form choice function choice subtree choose coefficient column player compute constant-sum constraints cooperative defined definition denoted directed graph dual basic form edges entry equation equilibrium N-tuple equilibrium pairs example Exercise expected payoff feasible tableau feasible vector game in characteristic game theory game tree grand coalition imputation inequality inessential joint strategy labeled mancala matrix game maximin values maximize maximum minimax theorem nonbasic variable noncooperative nonnegative normal form objective function optimal mixed strategies optimal strategy P₁ Pareto optimal path payoff matrix payoff pair payoff region pivot player plays plays according primal problem Prisoner's Dilemma probability PROOF Prove pure strategies root row player saddle point Shapley value shown in Figure simplex algorithm Solve stable set strategically equivalent subject to x1 supergame Suppose symmetric terminal vertex theorem vc(M verify vertices zero zero-sum