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 29
Página 3
... root , such that r has no edges going into it and such that for every other vertex v of T there is a unique path from r to v . The example in Figure 1.2 is clearly not a tree . A directed graph con- sisting of a single vertex and no ...
... root , such that r has no edges going into it and such that for every other vertex v of T there is a unique path from r to v . The example in Figure 1.2 is clearly not a tree . A directed graph con- sisting of a single vertex and no ...
Página 4
... root is at the top . An example is given in Figure 1.3 ; all the vertices have been labeled . This tree has eleven ... root is the parent of a , b , and c . In any tree , the set of children of u is denoted Ch ( u ) . Notice that a ...
... root is at the top . An example is given in Figure 1.3 ; all the vertices have been labeled . This tree has eleven ... root is the parent of a , b , and c . In any tree , the set of children of u is denoted Ch ( u ) . Notice that a ...
Página 5
... ( root , c , g , j ) is a path of greatest length . Some general facts about trees are collected together in the ... root to u . Appending the edge ( u , w ) to this path produces a path from the root to w . Similarly , appending the edge ...
... ( root , c , g , j ) is a path of greatest length . Some general facts about trees are collected together in the ... root to u . Appending the edge ( u , w ) to this path produces a path from the root to w . Similarly , appending the edge ...
Página 6
... root of T , then Tu and if u is terminal , then Tu is a trivial tree . The cutting Te of the tree in Figure 1.3 has vertices c , g , h , i , j , and edges ( c , g ) , ( g , i ) , ( g , j ) , ( c , h ) . น = T , THEOREM 1.2 . For any ...
... root of T , then Tu and if u is terminal , then Tu is a trivial tree . The cutting Te of the tree in Figure 1.3 has vertices c , g , h , i , j , and edges ( c , g ) , ( g , i ) , ( g , j ) , ( c , h ) . น = T , THEOREM 1.2 . For any ...
Página 7
... ( root , a , d ) , ( root , b , f ) , ( root , c , g , j ) . Exercises ( 1 ) Sketch all cuttings of the tree in Figure 1.4 . ( 2 ) Sketch all quotient trees of the tree in Figure 1.4 . ( 3 ) How many subtrees does the tree in Figure 1.4 ...
... ( root , a , d ) , ( root , b , f ) , ( root , c , g , j ) . Exercises ( 1 ) Sketch all cuttings of the tree in Figure 1.4 . ( 2 ) Sketch all quotient trees of the tree in Figure 1.4 . ( 3 ) How many subtrees does the tree in Figure 1.4 ...
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