27.01.2014 Views

Multiagent Systems

Multiagent Systems

Multiagent Systems

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

Prof. Dr. Jürgen Dix · Department of Informatics, TUC <strong>Multiagent</strong> <strong>Systems</strong>, WS 06/07 215/731<br />

3. Decision Making (1) 2. Non-coop Games<br />

Let X consist of all mixed strategy profiles and let f be the<br />

best response set: f(〈s 1 , . . . , s n 〉) is the set of all best<br />

responses 〈s ′ 1, . . . , s ′ n〉 (where s ′ i is players i best response<br />

to 〈s 1 , . . . , s i−1 , s i+1 , . . . s n 〉).<br />

Why is that a subset of an n-dimensional Euclidean<br />

space?<br />

A mixed strategy over k actions (pure strategies) is a<br />

k − 1 dimensional simplex (namely the one satisfying<br />

∑ k<br />

i=1 p i = 1). Therefore X is the cartesian product of n<br />

simplices. X is compact and convex (why?).<br />

The function f satisfies the remaining properties listed<br />

above. Thus there is a fixed point and this fixed point is a<br />

Nash equilibrium.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!