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

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

Definition 4.19 (Strategy-proof social correspondence)<br />

A social correspondence<br />

W ∗ : Ord par → 2 O ; 〈≺ 1 , . . . , ≺ |A| 〉 ↦→ v ′<br />

is called strategy-proof, if the following two conditions<br />

hold for every agent i, for any two profiles<br />

p = 〈≺ 1 , . . . , ≺ i , . . . , ≺ |A| 〉 and p ′ = 〈≺ 1 , . . . , ≺ ′ i, . . . , ≺ |A| 〉<br />

that only differ in agent i’s preference:<br />

1 ∀a ∈ W ∗ (p) \ W ∗ (p ′ ), ∀b ∈ W ∗ (p ′ ):<br />

if a ⊲⊳ ≺i b then a ⊲⊳ ≺ ′ i b or a≺′ ib, and<br />

if a≺ ib then a≺ ′ ib.<br />

2 ∀a ∈ W ∗ (p) \ W ∗ (p ′ ), ∃b ∈ W ∗ (p ′ ) such that:<br />

if b≺ ia then a ⊲⊳ ≺ ′ i b or a≺′ ib, and<br />

if a ⊲⊳ ≺i b then a≺ ′ ib.

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

Saved successfully!

Ooh no, something went wrong!