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

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

We are now relaxing our assumptions<br />

considerably (and thereby strengthening<br />

Arrow’s theorem).<br />

Voting based on partial orders<br />

The voting of agent i is described by a binary<br />

relation<br />

≺ i ⊆ O × O,<br />

which we assume to be irreflexive, transitive<br />

and antisymmetric: Ties are now allowed! We<br />

denote by Ord par the set of all such binary<br />

relations.

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

Saved successfully!

Ooh no, something went wrong!