Multiagent Systems

Prof. Dr. Jürgen Dix · Department of Informatics, TUC Multiagent Systems, WS 06/07 290/731
4. Decision Making (2) 1. Voting
Take any pair of alternatives α, β and assume
wlog β ≺ n ∗ α.
Take c ∉ {α, β} and consider the new profile
〈≺ ′ 1, . . . , ≺ ′ |A|
〉 obtained as follows from
〈≺ n∗
1 , . . . , ≺ n∗
|A| 〉:
for 1 ≤ i n ∗ : we put c on top of each ≺ i .
for n ∗ : we put c in between α and β.
n ∗
for n ∗ i ≤ |A|: we put c to the bottom of
each ≺ i .
We are changing the profile 〈≺ n∗
1 , . . . , ≺ n∗
|A| 〉 by
moving c around in a very particular way.