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

5. Nets and coalitions 3. Coalition Formation<br />

1 Is CS-Search-1 the best anytime algorithm?<br />

2 The search for best k for n ′ > n is perhaps not<br />

the same search to get best k for n.<br />

3 CS-Search-1 does not use any information<br />

while searching. Perhaps k can be made<br />

smaller by not only considering Val(CS<br />

CS) but<br />

also v S in the searched CS ′ .

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

Saved successfully!

Ooh no, something went wrong!