Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
GAME THEORY
to accompany
Operations Research: Applications & Algorithms,
4th edition, by Wayne L. Winston
Definitions
Definition:ZeroSumGameAgamein
whichthepayoffsfortheplayersalwaysadds
uptozeroiscalledazerosumgame.
Definition:MaximinstrategyIfwe
determinetheleastpossiblepayoffforeach
strategy,andchoosethestrategyforwhichthis
minimumpayoffislargest,wehavethe
maximinstrategy.
4
A Further Definition
Definition:Constantsumandnonconstantsum
gameIfthepayoffstoallplayersadduptothe
sameconstant,regardlesswhichstrategiesthey
choose,thenwehaveaconstantsumgame.The
constantmaybezerooranyothernumber,so
zerosumgamesareaclassofconstantsum
games.Ifthepayoffdoesnotadduptoa
constant,butvariesdependingonwhich
strategiesarechosen,thenwehaveanon
constantsumgame.
5
columns
12
5
3
12
Player 2
OP2
3
4
0
4
minimax
OP3
OP4
9
6
6
9
8
5
7
8
Row
Minima
3
4
0
maximin
1
2
3
Row Domination:
(1)
A
6
9
9
B
5
7
8
C
-4
-2
-3
Payoff Matrix
to Player #1
(3) >
A > C, B > C
Eliminate Columns A, B
Reduced Matrix
2
3
C
-2
-3
Saddle Point
1
2
3
A
6
9
9
B
5
7
8
C
-4
-2
-2
-3
Prisoners Dilemma
Two members of a criminal gang are arrested and
imprisoned.
They are placed under solitary confinement and have no
chance of communicating with each other
21
1 year, 1 year
3 years, 0 year
0 years, 3 years
2 years, 2 years
22
24
Minimax Rule
Goal of game tree search: to determine one move for Max
player that maximizes the guaranteed payoff for a given
game tree for MAX
Regardless of the moves the MIN will take
The value of each node (Max and MIN) is determined by
(back up from) the values of its children
MAX plays the worst case scenario:
Always assume MIN to take moves to maximize his pay-off
(i.e., to minimize the pay-off of MAX)
For a MAX node, the backed up value is the maximum of the
values associated with its children
For a MIN node, the backed up value is the minimum of the
values associated with its children
26
Minimax procedure
Create start node as a MAX node with current board
configuration
Expand nodes down to some depth (i.e., ply) of lookahead
in the game.
Apply the evaluation function at each of the leaf nodes
Obtain the back up" values for each of the non-leaf nodes
from its children by Minimax rule until a value is computed
for the root node.
Pick the operator associated with the child node whose
backed up value determined the value at the root as the
move for MAX
27
Minimax Search
2
1
2
2
Static evaluator
value
MAX
MIN
28
N-person games
With a third player, the possibility of a coalition
arises
Within the coalition there are issues of payoff
distribution
Coalitions disintegrate / realignments occur
Solutions for N-person games can be difficult
29
v N xi
i 1
30
y
iS
v S
i S , y xi
i
iS
x Pn S v S i v S
i
Where
P S
n
32
S ! n S 1 !
n!
Discussion/Conclusion
Will Game Theory give us the optimum or
best solution/decision?
33