## Introduction to Game TheoryThe 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 7

Página

A tree. Tree for Exercises (1), (2),and (3) of Section 1.1. A three-player

Two-finger morra.

choice subtrees for A. A choice subtree for B. A game with chance moves. Game

...

A tree. Tree for Exercises (1), (2),and (3) of Section 1.1. A three-player

**game tree**.Two-finger morra.

**Game tree**for Exercise (4) of Section 1.2. A**game tree**. Somechoice subtrees for A. A choice subtree for B. A game with chance moves. Game

...

Página 8

A tree labeled in the way just described (using designations of players and payoff

vectors) is a

important to realize that the kind of game we have set up has no chance moves.

A tree labeled in the way just described (using designations of players and payoff

vectors) is a

**game tree**, and the corresponding game is a tree game. - It isimportant to realize that the kind of game we have set up has no chance moves.

Página 10

The

from the

The

**tree**is shown in Figure 1.6. (Most of the payoff pairs have been left out.) This**tree**for two-finger morra does not embody all the rules of the**game**. It appearsfrom the

**tree**that P2 could guarantee herself a positive payoff by making the ... Página 11

The rules of this

holding. This implies, of course, that the

terms of the

vertices she ...

The rules of this

**game**state that Louise does not know which coin Thelma isholding. This implies, of course, that the

**game**is not of perfect information. Interms of the

**tree**, it also means that Louise does not know which of her twovertices she ...

Página 14

Then we have the following: DEFINITION 1.4. Let T be a

and c a choice function for P. Then the choice subtree determined by P and c is

defined to be the union of all the (P, c)-paths. Thus, the choice subtree

determined ...

Then we have the following: DEFINITION 1.4. Let T be a

**game tree**, P a player,and c a choice function for P. Then the choice subtree determined by P and c is

defined to be the union of all the (P, c)-paths. Thus, the choice subtree

determined ...

### Comentarios de la gente - Escribir un comentario

No encontramos ningún comentario en los lugares habituales.

### Contenido

1 | |

TwoPerson ZeroSum Games 35 | 34 |

Linear Programming | 65 |

Solving Matrix Games 99 | 98 |

NonZeroSum Games | 115 |

NPerson Cooperative Games | 149 |

GamePlaying Programs | 185 |

Appendix Solutions | 201 |

Two cuttings | 202 |

Equilibrium pair | 219 |

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 choose coefficient column player compute constant-sum constraints cooperative core defined definition denoted directed graph dominated rows dual basic form edges entry equation equilibrium N-tuple equilibrium pairs example Exercise expected payoff feasible tableau feasible vector game in characteristic game shown game tree grand coalition imputation inequality inessential joint strategy labeled m x n matrix game maximin values maximum minimax theorem moves left nonbasic variable noncooperative nonnegative normal form objective function optimal mixed strategies optimal strategy Pareto optimal path payoff matrix payoff pair payoff region pivot player and column 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 supergame Suppose symmetric terminal vertex Ti(S ur(M ve(M verify vertices vr(M zero zero-sum