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 288/731<br />

4. Decision Making (2) 1. Voting<br />

The proof of Arrows theorem is by considering<br />

two alternatives a, b and the profile where a≺ ≺ i b<br />

for all agents i. By unanimity, a≺ ≺ ∗ b. Note that<br />

this reasoning is true for all rankings with the<br />

same relative preference between a and b.<br />

We now consider a sequence of profiles<br />

〈≺ i 1, . . . , ≺ i |A|<br />

〉 (from i = 0, . . . , |A|, starting with<br />

the one described above (i = 0)), where in step<br />

i, we let all agents numbered ≤ i change its<br />

profile by moving a above b (leaving all other<br />

rankings untouched).

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

Saved successfully!

Ooh no, something went wrong!