Scribd
Upload
254 views4 pages

Introduction To Game Theory: Peter Morris

This document provides an introduction to game theory through 7 chapters. It covers games in extensive form using trees and game trees. It also discusses two-person zero-sum games, linear programming, solving matrix games using the minimax theorem, non-zero-sum games, N-person cooperative games, and game-playing programs. Various solution concepts are introduced including Nash equilibria, saddle points, and the core. Specific games are analyzed such as scissors-paper-stone and prisoner's dilemma.

Uploaded by

PerepePere
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
254 views4 pages

Introduction To Game Theory: Peter Morris

This document provides an introduction to game theory through 7 chapters. It covers games in extensive form using trees and game trees. It also discusses two-person zero-sum games, linear programming, solving matrix games using the minimax theorem, non-zero-sum games, N-person cooperative games, and game-playing programs. Various solution concepts are introduced including Nash equilibria, saddle points, and the core. Specific games are analyzed such as scissors-paper-stone and prisoner's dilemma.

Uploaded by

PerepePere
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Peter Morris

Introduction to
Game Theory
With 44 Illustrations

Springer
Contents

Preface vii

List of Figures xv

1. Games in Extensive Form 1


1.1. Trees 3
1.2. Game Trees 7
1.2.1. Information Sets 11
1.3. Choice Functions and Strategies 12
1.3.1. Choice Subtrees 13
1.4. Games with Chance Moves 20
1.4.1. A Theorem on Payoffs 22
1.5. Equilibrium iV-tuples of Strategies 24
1.6. Normal Forms 29

2. Two-Person Zero-Sum Games 35


2.1. Saddle Points 36
#
2.2. Mixed Strategies 40
2.2.1. Row Values and Column Values 43
2.2.2. Dominated Rows and Columns 48
2.3. Small Games 52
2.3.1. 2 x n and m x 2 Games 55
2.4. Symmetric Games 59
2.4.1. Solving Symmetric Games 60
xii Contents
3. Linear Programming 65
3.1. Primal and Dual Problems 65
3.1.1. Primal Problems and Their Duals 67
3.2. Basic Forms and Pivots 71
3.2.1. Pivots 72
3.2.2. Dual Basic Forms 75
3.3. The Simplex Algorithm 78
3.3.1. Tableaus 78
3.3.2. The Simplex Algorithm 81
3.4. Avoiding Cycles and Achieving Feasibility 85
3.4.1. Degeneracy and Cycles 85
3.4.2. The Initial Feasible Tableau 88
3.5. Duality 91
3.5.1. The Dual Simplex Algorithm 92
3.5.2. The Duality Theorem 95

4. Solving Matrix Games 99


4.1. The Minimax Theorem 99
4.2. Some Examples 104
4.2.1. Scissors-Paper-Stone 104
4.2.2. Three-Finger Morra 106
4.2.3. Colonel Blotto's Game 107
4.2.4. Simple Poker 108

5. Non-Zero-Sum Games 115


5.1. Noncooperative Games 116
5.1.1. Mixed Strategies 117
5.1.2. Maximin Values 119
5.1.3. Equilibrium N-tuples of Mixed Strategies 120
5.1.4. A Graphical Method for Computing Equilibrium Pairs 121
5.2. Solution Concepts for Noncooperative Games 124
5.2.1. Battle of the Buddies 126
5.2.2. Prisoner's Dilemma 127
5.2.3. Another Game 127
5.2.4. Supergames 128
5.3. Cooperative Games 132
5.3.1. Nash Bargaining Axioms 134
5.3.2. Convex Sets 136
5.3.3. Nash's Theorem 138
Contents xiii

5.3.4. Computing Arbitration Pairs 143


5.3.5. Remarks 145

6. N-Person Cooperative Games 149


6.1. Coalitions 149
6.1.1. The Characteristic Function 150
6.1.2. Essential and Inessential Games 154
6.2. Imputations 156
6.2.1. Dominance of Imputations 158
6.2.2. The Core 159
6.2.3. Constant-Sum Games 163
6.2.4. A Voting Game 165
6.3. Strategic Equivalence 167
6.3.1. Equivalence and Imputations 169
6.3.2. (O,l)-Reduced Form 170
6.3.3. Classification of Small Games 172
6.4. Two Solution Concepts 174
6.4.1. Stable Sets of Imputations 174
6.4.2. Shapley Values 178

7. Game-Playing Programs 185


7.1. Three Algorithms 186
7.1.1. The Naive Algorithm 186
7.1.2. The Branch and Bound Algorithm 187
7.1.3. The Alpha-Beta Pruning Algorithm 189
7.2. Evaluation Functions 191
7.2.1. Depth-Limited Subgames 192
7.2.2. Mancala 194
7.2.3. Nine-Men's Morris 197

Appendix. Solutions 201

Bibliography 223

Index 227

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy