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 21
Página 2
... edges . A play of the game starts at the top vertex ( labeled " Thelma " ) and arrives , via one of the two vertices ... edge , and leaves Louise's left - hand vertex by way of her right - hand edge . The bottom vertex reached is labeled ...
... edges . A play of the game starts at the top vertex ( labeled " Thelma " ) and arrives , via one of the two vertices ... edge , and leaves Louise's left - hand vertex by way of her right - hand edge . The bottom vertex reached is labeled ...
Página 3
... edges , between some pairs of distinct vertices . We can draw a directed graph on the blackboard or on a piece of paper by drawing small circles for the vertices and lines with arrowheads for the edges . An example is given in Figure ...
... edges , between some pairs of distinct vertices . We can draw a directed graph on the blackboard or on a piece of paper by drawing small circles for the vertices and lines with arrowheads for the edges . An example is given in Figure ...
Página 4
... edges . Now let T be a tree . We make a few definitions . A vertex v is a child of a vertex u if ( u , v ) is an edge . Also , in this case , u is the parent of v . In the tree of Figure 1.3 , vertex ƒ is a child of b , vertex g is a ...
... edges . Now let T be a tree . We make a few definitions . A vertex v is a child of a vertex u if ( u , v ) is an edge . Also , in this case , u is the parent of v . In the tree of Figure 1.3 , vertex ƒ is a child of b , vertex g is a ...
Página 5
... edge ( u , w ) to this path produces a path from the root to w . Similarly , appending the edge ( v , w ) to the path from the root to v produces another path from the root to w . These two paths are not the same because the last edge ...
... edge ( u , w ) to this path produces a path from the root to w . Similarly , appending the edge ( v , w ) to the path from the root to v produces another path from the root to w . These two paths are not the same because the last edge ...
Página 6
... edges of Tu are all edges of T which start at a vertex of Tu . Note that if u is the 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 ...
... edges of Tu are all edges of T which start at a vertex of Tu . Note that if u is the 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 ...
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