27.01.2014 Views

Multiagent Systems

Multiagent Systems

Multiagent Systems

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

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

3. Decision Making (1) 2. Non-coop Games<br />

Let f : D → D be continuous. Let F : R n → D be the<br />

extension of f to R n , for which we have<br />

F (x) = f( x<br />

||x|| ) on Rn \ D.<br />

For k ∈ N, k ≠ 0, put f k (x) := ∫ R n k n φ(ky)F (x − y)dy.<br />

Show that the restriction of f k to D maps D into D. Show<br />

that the mappings F k are continuously differentiable and<br />

approximate in the topology of uniform convergence the<br />

mapping F . Show that if there exists a continuous<br />

mapping f : D → D without fixed points, then there will<br />

also exist a continuously differential mapping without<br />

fixed points. It follows, that it suffices to proof the<br />

Brouwer Fixpoint Theorem only for continuously<br />

differentiable mappings.

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

Saved successfully!

Ooh no, something went wrong!