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

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

Formal model for social choice<br />

We want to precisely define what a potential model for<br />

voting, given preferences over the set of candidates, could<br />

be. Given such a model, we want to investigate fair<br />

elections.<br />

Let A the set of agents, O the set of possible outcomes.<br />

(O could be A, a set of laws, or a set of candidates).<br />

Voting based on total orders Ord tot<br />

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

≺ i ⊆ O × O,<br />

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

Ties are not allowed! We denote by Ord tot the set of all<br />

such binary relations.

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

Saved successfully!

Ooh no, something went wrong!