<?xml version="1.0" encoding="UTF-8"?>
<!-- generator="FeedCreator 1.8" -->
<?xml-stylesheet href="https://cw.fel.cvut.cz/b211/lib/exe/css.php?s=feed" type="text/css"?>
<rdf:RDF
    xmlns="http://purl.org/rss/1.0/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
    xmlns:dc="http://purl.org/dc/elements/1.1/">
    <channel rdf:about="https://cw.fel.cvut.cz/b211/feed.php">
        <title>CourseWare Wiki courses:cgt</title>
        <description></description>
        <link>https://cw.fel.cvut.cz/b211/</link>
        <image rdf:resource="https://cw.fel.cvut.cz/b211/lib/tpl/bulma-cw/images/favicon.ico" />
       <dc:date>2026-05-03T03:35:19+0200</dc:date>
        <items>
            <rdf:Seq>
                <rdf:li rdf:resource="https://cw.fel.cvut.cz/b211/courses/cgt/coalitional_game_theory?rev=1638831658&amp;do=diff"/>
                <rdf:li rdf:resource="https://cw.fel.cvut.cz/b211/courses/cgt/game_theory?rev=1637426504&amp;do=diff"/>
                <rdf:li rdf:resource="https://cw.fel.cvut.cz/b211/courses/cgt/start?rev=1642087559&amp;do=diff"/>
            </rdf:Seq>
        </items>
    </channel>
    <image rdf:about="https://cw.fel.cvut.cz/b211/lib/tpl/bulma-cw/images/favicon.ico">
        <title>CourseWare Wiki</title>
        <link>https://cw.fel.cvut.cz/b211/</link>
        <url>https://cw.fel.cvut.cz/b211/lib/tpl/bulma-cw/images/favicon.ico</url>
    </image>
    <item rdf:about="https://cw.fel.cvut.cz/b211/courses/cgt/coalitional_game_theory?rev=1638831658&amp;do=diff">
        <dc:format>text/html</dc:format>
        <dc:date>2021-12-07T00:00:58+0200</dc:date>
        <dc:creator>Anonymous (anonymous@undisclosed.example.com)</dc:creator>
        <title>courses:cgt:coalitional_game_theory</title>
        <link>https://cw.fel.cvut.cz/b211/courses/cgt/coalitional_game_theory?rev=1638831658&amp;do=diff</link>
        <description>Assignment 2: Flow Games

Your goal will be to estimate the influence of agents on the throughput of randomly generated networks. You need to derive a [flow game] from the networks assigned to you. For the computation of Shapley value use the sampling algorithm based on the statistical estimation. You can use the</description>
    </item>
    <item rdf:about="https://cw.fel.cvut.cz/b211/courses/cgt/game_theory?rev=1637426504&amp;do=diff">
        <dc:format>text/html</dc:format>
        <dc:date>2021-11-20T17:41:44+0200</dc:date>
        <dc:creator>Anonymous (anonymous@undisclosed.example.com)</dc:creator>
        <title>courses:cgt:game_theory</title>
        <link>https://cw.fel.cvut.cz/b211/courses/cgt/game_theory?rev=1637426504&amp;do=diff</link>
        <description>Assignment 1: Extensive-Form Games

Your goal will be to formalize a problem as an extensive-form game and solve it using an LP solver. Start by reading [the assignment instructions], then use [the prepared templates and examples]. Upload your solutions to BRUTE .
votroto1@fel.cvut.czstdinstdoutpython game_tree.py &lt; maze.txt &gt; tree.efg</description>
    </item>
    <item rdf:about="https://cw.fel.cvut.cz/b211/courses/cgt/start?rev=1642087559&amp;do=diff">
        <dc:format>text/html</dc:format>
        <dc:date>2022-01-13T16:25:59+0200</dc:date>
        <dc:creator>Anonymous (anonymous@undisclosed.example.com)</dc:creator>
        <title>courses:cgt:start</title>
        <link>https://cw.fel.cvut.cz/b211/courses/cgt/start?rev=1642087559&amp;do=diff</link>
        <description>Computational Game Theory (BE4M36MAS) Winter 2021/2022

The course provides an introduction to concepts, models and algorithms for autonomous agents and multi-agent systems. Game theory is the key formalism used in multi-agent systems that describes and defines optimal behavior of an agent while explicitly reasoning about plans and goals of other agents. In the course, we will explains key multiagent models and algorithms, both for cooperative and non-cooperative settings. Upon successful comple…</description>
    </item>
</rdf:RDF>
