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

5. Nets and coalitions 2. Four Types of Nets<br />

Experiments with up to 8 agents and 8 tasks. Initial<br />

allocation randomly chosen.<br />

Ratio bound (welfare of obtained local optimum<br />

divided by global optimum) and mean ratio bound<br />

(over 1000 TSP instances) were computed (all for fixed<br />

number of agents and tasks). Global optimum was<br />

computed using IDA ∗ .<br />

A protocol consisting of 5 intervals is considered. In<br />

each interval, a particular contract type was<br />

considered (and all possible contracts with that type):<br />

1024 different sequences.<br />

In each interval a particular order for the agents and<br />

the tasks is used. First all contracts involving agent 1.<br />

Then all involving agent 2 etc. Thus it makes sense to<br />

have subsequent intervals with the same contract type.

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

Saved successfully!

Ooh no, something went wrong!