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.

of. Dr. Jürgen Dix · Department of Informatics, TUC <strong>Multiagent</strong> <strong>Systems</strong>, WS 06/07 400/731<br />

5. Nets and coalitions 4. Payoff Division<br />

We assume now that games are superadditive,<br />

therefore the grand coalition will be formed.<br />

The payoff division should be fair between the<br />

agents, otherwise they leave the coalition.<br />

Definition 5.30 (Dummies, Interchangeable)<br />

Agent i is called a dummy, if<br />

for all coalitions S with i ∉ S: v S∪{i} − v S = v {i} .<br />

Agents i and j are called interchangeable, if<br />

for all coalitions S with i ∈ S and j ∉ S: v S\{i}∪{j} = v S

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

Saved successfully!

Ooh no, something went wrong!