27.01.2014 Views

Multiagent Systems

Multiagent Systems

Multiagent Systems

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

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

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

Theorem 3.16 (von Neumann (1928))<br />

In any finite 2-person constant-sum game the following<br />

holds:<br />

1 The maxmin value for one player is equal to the minmax<br />

value for the other. The maxmin of player 1 is usually<br />

called value of the game.<br />

2 For each player, the set of maxmin strategies coincides<br />

with the set of minmax strategies.<br />

3 The maxmin strategies are optimal: if one player does<br />

not play a maxmin strategy, then its payoff (expected<br />

utility) goes down.<br />

What is the optimal strategy (maximising the expected<br />

payoff) for an agent in an n-agent setting?

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

Saved successfully!

Ooh no, something went wrong!