Game Theory, Prof. HertlingExercise Sheet 2

Sven BalnojanUniversitat Mannheim

2017

Intro Q 1 A .SU ) ⇒ It, 5,1¥ ,

.int( Ex 2 is about ⇐ )

Here ¥ is :

1.

reflexive ( stir )

2. transitive 1 nazi bias,

⇒ herbs ,

3,

connected 1 Hs,

F.. )

⇒ 2.13. givea fist

"

of preferred

( Mnr .. , he )

,s

,least liked

,

Intro �2� Only prefs . really matter,

not utility b.( Def .

2.20 makes sure of that )

1. Saurerin ⇒ name NE

2Same( Ii ) ⇒ same vis

3.

Uialj .

bin.

trap of Ii ⇒ same hit.

( Application , Solve

gameX

,by

findinga

y4E% which you already know !

⇒ any are,

NES ).

Intro

208( to Def .

2.20 )

" no"

,if we can deduce

~f for

any game we can consider it

"

solved"

.

.

Bc. ~f ⇐ ) Baine NE s

⇐ same equilibriumstrategies .

.

Intro

208( to Def .

2.20 )

~a

1n.l.e1cousidrHhinstapidejlpnFtIfuWaudPnF@3TitAs.l.e2.eyYpAI3-K.ltc1wnyyDEkNlHH-oni5.k

'

.ua

kvilbkc '

honestffifkgciovitkiuitct ¥ys,~at.

Intro

208( to Def .

2.20 )

×~b"

p .

0.

e.,

more nonsense examples :

Game 1 Game 2

A B

.#ti¥¥#g.:Ei¥Y¥n⇒.

attitudes :

uilskiuilt)

⇐ nuilnsiuilt )~p yes , p.o.e.tt .

.

Intro

208( to Def .

2.20 )

×~dd"

r. p .

0.

e.,

more nonsense examples :

Hanne1 Game 2

ATBO\ 0

¥*.¥z*.€¥#t*¥*.ae#tiriEiEI:r.=cs..,

on Six { iii }.

.

Intro

ZOD( tDef2 -20 )

[wholeut .

uiskiuitinlepo

,

matrix

ciantkanfa=) ~bcoinsodefntl11 jntwhb ✓ ← column

. g-mle vpoe~ ( ⇒~d⇒a⇒⇐

.

Intro �3� ( 2.16 ) no is NE ⇐ boepcbd⇐ igericsilfi

- to find NES first get the best vsp .

mapb . Then ; fgnemihrk for den.

1.

Fini. games ,

find p ,dan it

, find

fp,

so Infinitegames ,find vi

,find intention

AFoetpouday

then'

HD-