https://iccl.inf.tu-dresden.de/w/api.php?action=feedcontributions&feedformat=atom&user=Hannes+Stra%C3%9F 2026-06-03T19:38:14Z Benutzerbeiträge MediaWiki 1.43.1 https://iccl.inf.tu-dresden.de/w/index.php?title=Algorithmic_Game_Theory_(SS2026)&diff=44446 2026-06-02T12:07:44Z

<p>Hannes Straß: </p> <hr /> <div>{{Vorlesung<br /> |Title=Algorithmic Game Theory<br /> |Research group=Computational Logic<br /> |Lecturers=Hannes Straß<br /> |Tutors=Sarah Alice Gaggl<br /> |Term=SS<br /> |Year=2026<br /> |Module=INF-B-510, INF-B-520, INF-PM-FOR, INF-Ma-FTK-GaT<br /> |SWSLecture=2<br /> |SWSExercise=2<br /> |SWSPractical=0<br /> |Exam type=Klausur, mündliche Prüfung<br /> |Description=Game Theory is a multi-disciplinary and pervasive field that is concerned with how strategic decision making can be formally modelled and mathematically analysed.<br /> <br /> In this course, we will approach the subject from a computer science perspective and – in addition to covering the foundational aspects – also address how game theory can be approached computationally, e.g. consider how computers can be programmed to play games, or analyse the computational complexity of various game-theoretic notions.<br /> <br /> === Dates and times ===<br /> <br /> The lecture takes place as follows:<br /> <br /> * Mondays, DS3, [https://navigator.tu-dresden.de/etplan/bey/00/raum/111100.5500 BEY/E39/U]<br /> <br /> Exercise sessions are offered as follows:<br /> <br /> * Thursdays, DS2, APB/E007<br /> * Thursdays, DS4, APB/E001<br /> * Thursdays, DS5, APB/E006<br /> <br /> === OPAL ===<br /> <br /> There is an [https://bildungsportal.sachsen.de/opal/auth/RepositoryEntry/54256828417/CourseNode/1777257464647455004 OPAL course] that we use to reach you in case exercise sessions or lectures have to be cancelled on short notice. Please register for the lecture and your respective exercise session to stay informed.<br /> <br /> === Topics ===<br /> <br /> * Noncooperative games in normal form<br /> * Noncooperative games in extensive form<br /> * Search in game trees<br /> * Games with missing information<br /> * Evolutionary game theory<br /> * The Game Description Language and General Game Playing<br /> * Cooperative Games<br /> <br /> === Exam ===<br /> <br /> For CMS/Erasmus students and students wishing to use this course for modules INF-B-510 or INF-B-520, there will be a written exam (90min). The exam will be closed book, i.e. without notes, and no other resources (in particular technical aids) are permitted.<br /> <br /> For anyone else (INF-Ma-25-GaT, INF-VERT-2/6, INF-BAS-2/6, INF-PM-FOR, IST) the exam will be oral. To obtain an exam slot, please contact [mailto:cl@tu-dresden.de the CL group's secretary].<br /> |Literature=* Jörg Rothe (Ed.): Economics and Computation. An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division. Springer-Verlag Berlin Heidelberg (2016) (Part I: Playing Successfully)<br /> ** Lectures 1, 2, 6, 7, 12, and 13<br /> <br /> * Richard Alan Gillman, David Housman: Game Theory. A Modeling Approach. CRC Press (2019)<br /> ** Lectures 1, 2, 4, and 10<br /> <br /> * Stuart J. Russell, Peter Norvig: Artificial Intelligence. A Modern Approach (Global Edition). Pearson (2021) (Chapter 6: Adversarial Search and Games)<br /> ** Lectures 5 and 6<br /> <br /> * Todd W. Neller, Marc Lanctot: An Introduction to Counterfactual Regret Minimization. Self-published. (2013)<br /> ** Lecture 9<br /> <br /> * Noam Nisan, Tim Roughgarden, Éva Tardos, Vijay Vazirani (eds.): Algorithmic Game Theory. Cambridge University Press (2007)<br /> ** Lecture 10<br /> <br /> * Michael R. Genesereth, Michael Thielscher: General Game Playing (Synthesis Lectures on Artificial Intelligence and Machine Learning) Morgan &amp; Claypool Publishers (2014)<br /> ** Lectures 5, 6, and 11<br /> <br /> * Bernhard von Stengel: Game Theory Basics. Cambridge University Press (2021)<br /> ** Lecture 7<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Noncooperative Games in Normal Form<br /> |Room=BEY/E39/U<br /> |Date=2026-04-13<br /> |DS=DS3<br /> |Download=AGT2026-01.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 1<br /> |Room=APB<br /> |Date=2026-04-16<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-01.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Normal-Form Games: Mixed Strategies<br /> |Room=BEY/E39/U<br /> |Date=2026-04-20<br /> |DS=DS3<br /> |Download=AGT2026-02.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 2<br /> |Room=APB<br /> |Date=2026-04-23<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-02.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Complexity and Correlated Equilibria<br /> |Room=BEY/E39/U<br /> |Date=2026-04-27<br /> |DS=DS3<br /> |Download=AGT2026-03.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 3<br /> |Room=APB<br /> |Date=2026-04-30<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-03.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Sequential Games with Perfect Information<br /> |Room=BEY/E39/U<br /> |Date=2026-05-04<br /> |DS=DS3<br /> |Download=AGT2026-04.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 4<br /> |Room=APB<br /> |Date=2026-05-07<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-04.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Playing Games: Alpha-Beta Tree Search<br /> |Room=BEY/E39/U<br /> |Date=2026-05-11<br /> |DS=DS3<br /> |Download=AGT2026-05.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Entfällt<br /> |Title=Public holiday (no exercise sessions)<br /> |Room=APB<br /> |Date=2026-05-14<br /> |DS=terminlos<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Playing Games: Monte Carlo Tree Search<br /> |Room=BEY/E39/U<br /> |Date=2026-05-18<br /> |DS=DS3<br /> |Download=AGT2026-06.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 5<br /> |Room=APB<br /> |Date=2026-05-21<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-05.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Entfällt<br /> |Title=Public holiday (no lecture)<br /> |Room=BEY/E39/U<br /> |Date=2026-05-25<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Entfällt<br /> |Title=Pentecost break (no exercise session)<br /> |Room=APB E005<br /> |Date=2026-05-28<br /> |DS=terminlos<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Games with Missing Information: Modelling<br /> |Room=BEY/E39/U<br /> |Date=2026-06-01<br /> |DS=DS3<br /> |Download=AGT2026-07.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 6<br /> |Room=APB<br /> |Date=2026-06-04<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-06.pdf<br /> }}</div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Algorithmic_Game_Theory_(SS2026)&diff=44445 2026-06-02T12:06:36Z

<p>Hannes Straß: </p> <hr /> <div>{{Vorlesung<br /> |Title=Algorithmic Game Theory<br /> |Research group=Computational Logic<br /> |Lecturers=Hannes Straß<br /> |Tutors=Sarah Alice Gaggl<br /> |Term=SS<br /> |Year=2026<br /> |Module=INF-B-510, INF-B-520, INF-PM-FOR, INF-Ma-FTK-GaT<br /> |SWSLecture=2<br /> |SWSExercise=2<br /> |SWSPractical=0<br /> |Exam type=Klausur, mündliche Prüfung<br /> |Description=Game Theory is a multi-disciplinary and pervasive field that is concerned with how strategic decision making can be formally modelled and mathematically analysed.<br /> <br /> In this course, we will approach the subject from a computer science perspective and – in addition to covering the foundational aspects – also address how game theory can be approached computationally, e.g. consider how computers can be programmed to play games, or analyse the computational complexity of various game-theoretic notions.<br /> <br /> === Dates and times ===<br /> <br /> The lecture takes place as follows:<br /> <br /> * Mondays, DS3, [https://navigator.tu-dresden.de/etplan/bey/00/raum/111100.5500 BEY/E39/U]<br /> <br /> Exercise sessions are offered as follows:<br /> <br /> * Thursdays, DS2, APB/E007<br /> * Thursdays, DS4, APB/E001<br /> * Thursdays, DS5, APB/E006<br /> <br /> === OPAL ===<br /> <br /> There is an [https://bildungsportal.sachsen.de/opal/auth/RepositoryEntry/54256828417/CourseNode/1777257464647455004 OPAL course] that we use to reach you in case exercise sessions or lectures have to be cancelled on short notice. Please register for the lecture and your respective exercise session to stay informed.<br /> <br /> === Topics ===<br /> <br /> * Noncooperative games in normal form<br /> * Noncooperative games in extensive form<br /> * Search in game trees<br /> * Games with missing information<br /> * Evolutionary game theory<br /> * The Game Description Language and General Game Playing<br /> * Cooperative Games<br /> <br /> === Exam ===<br /> <br /> For CMS/Erasmus students and students wishing to use this course for modules INF-B-510 or INF-B-520, there will be a written exam (90min). The exam will be closed book, i.e. without notes, and no other resources (in particular technical aids) are permitted.<br /> <br /> For anyone else (INF-Ma-25-GaT, INF-VERT-2/6, INF-BAS-2/6, INF-PM-FOR, IST) the exam will be oral. To obtain an exam slot, please contact [mailto:cl@tu-dresden.de the CL group's secretary].<br /> |Literature=* Jörg Rothe (Ed.): Economics and Computation. An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division. Springer-Verlag Berlin Heidelberg (2016) (Part I: Playing Successfully)<br /> ** Lectures 1, 2, 6, 7, 12, and 13<br /> <br /> * Richard Alan Gillman, David Housman: Game Theory. A Modeling Approach. CRC Press (2019)<br /> ** Lectures 1, 2, 4, and 10<br /> <br /> * Stuart J. Russell, Peter Norvig: Artificial Intelligence. A Modern Approach (Global Edition). Pearson (2021) (Chapter 6: Adversarial Search and Games)<br /> ** Lectures 5 and 6<br /> <br /> * Todd W. Neller, Marc Lanctot: An Introduction to Counterfactual Regret Minimization. Self-published. (2013)<br /> ** Lecture 9<br /> <br /> * Noam Nisan, Tim Roughgarden, Éva Tardos, Vijay Vazirani (eds.): Algorithmic Game Theory. Cambridge University Press (2007)<br /> ** Lecture 10<br /> <br /> * Michael R. Genesereth, Michael Thielscher: General Game Playing (Synthesis Lectures on Artificial Intelligence and Machine Learning) Morgan &amp; Claypool Publishers (2014)<br /> ** Lectures 5, 6, and 11<br /> <br /> * Bernhard von Stengel: Game Theory Basics. Cambridge University Press (2021)<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Noncooperative Games in Normal Form<br /> |Room=BEY/E39/U<br /> |Date=2026-04-13<br /> |DS=DS3<br /> |Download=AGT2026-01.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 1<br /> |Room=APB<br /> |Date=2026-04-16<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-01.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Normal-Form Games: Mixed Strategies<br /> |Room=BEY/E39/U<br /> |Date=2026-04-20<br /> |DS=DS3<br /> |Download=AGT2026-02.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 2<br /> |Room=APB<br /> |Date=2026-04-23<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-02.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Complexity and Correlated Equilibria<br /> |Room=BEY/E39/U<br /> |Date=2026-04-27<br /> |DS=DS3<br /> |Download=AGT2026-03.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 3<br /> |Room=APB<br /> |Date=2026-04-30<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-03.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Sequential Games with Perfect Information<br /> |Room=BEY/E39/U<br /> |Date=2026-05-04<br /> |DS=DS3<br /> |Download=AGT2026-04.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 4<br /> |Room=APB<br /> |Date=2026-05-07<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-04.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Playing Games: Alpha-Beta Tree Search<br /> |Room=BEY/E39/U<br /> |Date=2026-05-11<br /> |DS=DS3<br /> |Download=AGT2026-05.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Entfällt<br /> |Title=Public holiday (no exercise sessions)<br /> |Room=APB<br /> |Date=2026-05-14<br /> |DS=terminlos<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Playing Games: Monte Carlo Tree Search<br /> |Room=BEY/E39/U<br /> |Date=2026-05-18<br /> |DS=DS3<br /> |Download=AGT2026-06.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 5<br /> |Room=APB<br /> |Date=2026-05-21<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-05.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Entfällt<br /> |Title=Public holiday (no lecture)<br /> |Room=BEY/E39/U<br /> |Date=2026-05-25<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Entfällt<br /> |Title=Pentecost break (no exercise session)<br /> |Room=APB E005<br /> |Date=2026-05-28<br /> |DS=terminlos<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Games with Missing Information: Modelling<br /> |Room=BEY/E39/U<br /> |Date=2026-06-01<br /> |DS=DS3<br /> |Download=AGT2026-07.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 6<br /> |Room=APB<br /> |Date=2026-06-04<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-06.pdf<br /> }}</div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:AGT2026-Problems-06.pdf&diff=44444 2026-06-02T12:06:25Z

<p>Hannes Straß: </p> <hr /> <div></div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:AGT2026-07.pdf&diff=44438 2026-06-01T08:45:26Z

<p>Hannes Straß: Hannes Straß lud eine neue Version von Datei:AGT2026-07.pdf hoch</p> <hr /> <div></div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Algorithmic_Game_Theory_(SS2026)&diff=44437 2026-05-27T12:02:15Z

<p>Hannes Straß: </p> <hr /> <div>{{Vorlesung<br /> |Title=Algorithmic Game Theory<br /> |Research group=Computational Logic<br /> |Lecturers=Hannes Straß<br /> |Tutors=Sarah Alice Gaggl<br /> |Term=SS<br /> |Year=2026<br /> |Module=INF-B-510, INF-B-520, INF-PM-FOR, INF-Ma-FTK-GaT<br /> |SWSLecture=2<br /> |SWSExercise=2<br /> |SWSPractical=0<br /> |Exam type=Klausur, mündliche Prüfung<br /> |Description=Game Theory is a multi-disciplinary and pervasive field that is concerned with how strategic decision making can be formally modelled and mathematically analysed.<br /> <br /> In this course, we will approach the subject from a computer science perspective and – in addition to covering the foundational aspects – also address how game theory can be approached computationally, e.g. consider how computers can be programmed to play games, or analyse the computational complexity of various game-theoretic notions.<br /> <br /> === Dates and times ===<br /> <br /> The lecture takes place as follows:<br /> <br /> * Mondays, DS3, [https://navigator.tu-dresden.de/etplan/bey/00/raum/111100.5500 BEY/E39/U]<br /> <br /> Exercise sessions are offered as follows:<br /> <br /> * Thursdays, DS2, APB/E007<br /> * Thursdays, DS4, APB/E001<br /> * Thursdays, DS5, APB/E006<br /> <br /> === OPAL ===<br /> <br /> There is an [https://bildungsportal.sachsen.de/opal/auth/RepositoryEntry/54256828417/CourseNode/1777257464647455004 OPAL course] that we use to reach you in case exercise sessions or lectures have to be cancelled on short notice. Please register for the lecture and your respective exercise session to stay informed.<br /> <br /> === Topics ===<br /> <br /> * Noncooperative games in normal form<br /> * Noncooperative games in extensive form<br /> * Search in game trees<br /> * Games with missing information<br /> * Evolutionary game theory<br /> * The Game Description Language and General Game Playing<br /> * Cooperative Games<br /> <br /> === Exam ===<br /> <br /> For CMS/Erasmus students and students wishing to use this course for modules INF-B-510 or INF-B-520, there will be a written exam (90min). The exam will be closed book, i.e. without notes, and no other resources (in particular technical aids) are permitted.<br /> <br /> For anyone else (INF-Ma-25-GaT, INF-VERT-2/6, INF-BAS-2/6, INF-PM-FOR, IST) the exam will be oral. To obtain an exam slot, please contact [mailto:cl@tu-dresden.de the CL group's secretary].<br /> |Literature=* Jörg Rothe (Ed.): Economics and Computation. An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division. Springer-Verlag Berlin Heidelberg (2016) (Part I: Playing Successfully)<br /> ** Lectures 1, 2, 6, 7, 12, and 13<br /> <br /> * Richard Alan Gillman, David Housman: Game Theory. A Modeling Approach. CRC Press (2019)<br /> ** Lectures 1, 2, 4, and 10<br /> <br /> * Stuart J. Russell, Peter Norvig: Artificial Intelligence. A Modern Approach (Global Edition). Pearson (2021) (Chapter 6: Adversarial Search and Games)<br /> ** Lectures 5 and 6<br /> <br /> * Todd W. Neller, Marc Lanctot: An Introduction to Counterfactual Regret Minimization. Self-published. (2013)<br /> ** Lecture 9<br /> <br /> * Noam Nisan, Tim Roughgarden, Éva Tardos, Vijay Vazirani (eds.): Algorithmic Game Theory. Cambridge University Press (2007)<br /> ** Lecture 10<br /> <br /> * Michael R. Genesereth, Michael Thielscher: General Game Playing (Synthesis Lectures on Artificial Intelligence and Machine Learning) Morgan &amp; Claypool Publishers (2014)<br /> ** Lectures 5, 6, and 11<br /> <br /> * Bernhard von Stengel: Game Theory Basics. Cambridge University Press (2021)<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Noncooperative Games in Normal Form<br /> |Room=BEY/E39/U<br /> |Date=2026-04-13<br /> |DS=DS3<br /> |Download=AGT2026-01.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 1<br /> |Room=APB<br /> |Date=2026-04-16<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-01.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Normal-Form Games: Mixed Strategies<br /> |Room=BEY/E39/U<br /> |Date=2026-04-20<br /> |DS=DS3<br /> |Download=AGT2026-02.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 2<br /> |Room=APB<br /> |Date=2026-04-23<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-02.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Complexity and Correlated Equilibria<br /> |Room=BEY/E39/U<br /> |Date=2026-04-27<br /> |DS=DS3<br /> |Download=AGT2026-03.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 3<br /> |Room=APB<br /> |Date=2026-04-30<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-03.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Sequential Games with Perfect Information<br /> |Room=BEY/E39/U<br /> |Date=2026-05-04<br /> |DS=DS3<br /> |Download=AGT2026-04.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 4<br /> |Room=APB<br /> |Date=2026-05-07<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-04.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Playing Games: Alpha-Beta Tree Search<br /> |Room=BEY/E39/U<br /> |Date=2026-05-11<br /> |DS=DS3<br /> |Download=AGT2026-05.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Entfällt<br /> |Title=Public holiday (no exercise sessions)<br /> |Room=APB<br /> |Date=2026-05-14<br /> |DS=terminlos<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Playing Games: Monte Carlo Tree Search<br /> |Room=BEY/E39/U<br /> |Date=2026-05-18<br /> |DS=DS3<br /> |Download=AGT2026-06.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 5<br /> |Room=APB<br /> |Date=2026-05-21<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-05.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Entfällt<br /> |Title=Public holiday (no lecture)<br /> |Room=BEY/E39/U<br /> |Date=2026-05-25<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Entfällt<br /> |Title=Pentecost break (no exercise session)<br /> |Room=APB E005<br /> |Date=2026-05-28<br /> |DS=terminlos<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Games with Missing Information: Modelling<br /> |Room=BEY/E39/U<br /> |Date=2026-06-01<br /> |DS=DS3<br /> |Download=AGT2026-07.pdf<br /> }}</div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:AGT2026-07.pdf&diff=44436 2026-05-27T12:02:07Z

<p>Hannes Straß: </p> <hr /> <div></div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:AGT2026-Problems-05.pdf&diff=44423 2026-05-20T12:24:03Z

<p>Hannes Straß: Hannes Straß lud eine neue Version von Datei:AGT2026-Problems-05.pdf hoch</p> <hr /> <div></div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Algorithmic_Game_Theory_(SS2026)&diff=44420 2026-05-18T11:57:20Z

<p>Hannes Straß: </p> <hr /> <div>{{Vorlesung<br /> |Title=Algorithmic Game Theory<br /> |Research group=Computational Logic<br /> |Lecturers=Hannes Straß<br /> |Tutors=Sarah Alice Gaggl<br /> |Term=SS<br /> |Year=2026<br /> |Module=INF-B-510, INF-B-520, INF-PM-FOR, INF-Ma-FTK-GaT<br /> |SWSLecture=2<br /> |SWSExercise=2<br /> |SWSPractical=0<br /> |Exam type=Klausur, mündliche Prüfung<br /> |Description=Game Theory is a multi-disciplinary and pervasive field that is concerned with how strategic decision making can be formally modelled and mathematically analysed.<br /> <br /> In this course, we will approach the subject from a computer science perspective and – in addition to covering the foundational aspects – also address how game theory can be approached computationally, e.g. consider how computers can be programmed to play games, or analyse the computational complexity of various game-theoretic notions.<br /> <br /> === Dates and times ===<br /> <br /> The lecture takes place as follows:<br /> <br /> * Mondays, DS3, [https://navigator.tu-dresden.de/etplan/bey/00/raum/111100.5500 BEY/E39/U]<br /> <br /> Exercise sessions are offered as follows:<br /> <br /> * Thursdays, DS2, APB/E007<br /> * Thursdays, DS4, APB/E001<br /> * Thursdays, DS5, APB/E006<br /> <br /> === OPAL ===<br /> <br /> There is an [https://bildungsportal.sachsen.de/opal/auth/RepositoryEntry/54256828417/CourseNode/1777257464647455004 OPAL course] that we use to reach you in case exercise sessions or lectures have to be cancelled on short notice. Please register for the lecture and your respective exercise session to stay informed.<br /> <br /> === Topics ===<br /> <br /> * Noncooperative games in normal form<br /> * Noncooperative games in extensive form<br /> * Search in game trees<br /> * Games with missing information<br /> * Evolutionary game theory<br /> * The Game Description Language and General Game Playing<br /> * Cooperative Games<br /> <br /> === Exam ===<br /> <br /> For CMS/Erasmus students and students wishing to use this course for modules INF-B-510 or INF-B-520, there will be a written exam (90min). The exam will be closed book, i.e. without notes, and no other resources (in particular technical aids) are permitted.<br /> <br /> For anyone else (INF-Ma-25-GaT, INF-VERT-2/6, INF-BAS-2/6, INF-PM-FOR, IST) the exam will be oral. To obtain an exam slot, please contact [mailto:cl@tu-dresden.de the CL group's secretary].<br /> |Literature=* Jörg Rothe (Ed.): Economics and Computation. An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division. Springer-Verlag Berlin Heidelberg (2016) (Part I: Playing Successfully)<br /> ** Lectures 1, 2, 6, 7, 12, and 13<br /> <br /> * Richard Alan Gillman, David Housman: Game Theory. A Modeling Approach. CRC Press (2019)<br /> ** Lectures 1, 2, 4, and 10<br /> <br /> * Stuart J. Russell, Peter Norvig: Artificial Intelligence. A Modern Approach (Global Edition). Pearson (2021) (Chapter 6: Adversarial Search and Games)<br /> ** Lectures 5 and 6<br /> <br /> * Todd W. Neller, Marc Lanctot: An Introduction to Counterfactual Regret Minimization. Self-published. (2013)<br /> ** Lecture 9<br /> <br /> * Noam Nisan, Tim Roughgarden, Éva Tardos, Vijay Vazirani (eds.): Algorithmic Game Theory. Cambridge University Press (2007)<br /> ** Lecture 10<br /> <br /> * Michael R. Genesereth, Michael Thielscher: General Game Playing (Synthesis Lectures on Artificial Intelligence and Machine Learning) Morgan &amp; Claypool Publishers (2014)<br /> ** Lectures 5, 6, and 11<br /> <br /> * Bernhard von Stengel: Game Theory Basics. Cambridge University Press (2021)<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Noncooperative Games in Normal Form<br /> |Room=BEY/E39/U<br /> |Date=2026-04-13<br /> |DS=DS3<br /> |Download=AGT2026-01.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 1<br /> |Room=APB<br /> |Date=2026-04-16<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-01.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Normal-Form Games: Mixed Strategies<br /> |Room=BEY/E39/U<br /> |Date=2026-04-20<br /> |DS=DS3<br /> |Download=AGT2026-02.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 2<br /> |Room=APB<br /> |Date=2026-04-23<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-02.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Complexity and Correlated Equilibria<br /> |Room=BEY/E39/U<br /> |Date=2026-04-27<br /> |DS=DS3<br /> |Download=AGT2026-03.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 3<br /> |Room=APB<br /> |Date=2026-04-30<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-03.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Sequential Games with Perfect Information<br /> |Room=BEY/E39/U<br /> |Date=2026-05-04<br /> |DS=DS3<br /> |Download=AGT2026-04.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 4<br /> |Room=APB<br /> |Date=2026-05-07<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-04.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Playing Games: Alpha-Beta Tree Search<br /> |Room=BEY/E39/U<br /> |Date=2026-05-11<br /> |DS=DS3<br /> |Download=AGT2026-05.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Entfällt<br /> |Title=Public holiday (no exercise sessions)<br /> |Room=APB<br /> |Date=2026-05-14<br /> |DS=terminlos<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Playing Games: Monte Carlo Tree Search<br /> |Room=BEY/E39/U<br /> |Date=2026-05-18<br /> |DS=DS3<br /> |Download=AGT2026-06.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 5<br /> |Room=APB<br /> |Date=2026-05-21<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-05.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Entfällt<br /> |Title=Public holiday (no lecture)<br /> |Room=BEY/E39/U<br /> |Date=2026-05-25<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Entfällt<br /> |Title=Pentecost break (no exercise session)<br /> |Room=APB E005<br /> |Date=2026-05-28<br /> |DS=terminlos<br /> }}</div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Algorithmic_Game_Theory_(SS2026)&diff=44419 2026-05-18T11:54:59Z

<p>Hannes Straß: </p> <hr /> <div>{{Vorlesung<br /> |Title=Algorithmic Game Theory<br /> |Research group=Computational Logic<br /> |Lecturers=Hannes Straß<br /> |Tutors=Sarah Alice Gaggl<br /> |Term=SS<br /> |Year=2026<br /> |Module=INF-B-510, INF-B-520, INF-PM-FOR, INF-Ma-FTK-GaT<br /> |SWSLecture=2<br /> |SWSExercise=2<br /> |SWSPractical=0<br /> |Exam type=Klausur, mündliche Prüfung<br /> |Description=Game Theory is a multi-disciplinary and pervasive field that is concerned with how strategic decision making can be formally modelled and mathematically analysed.<br /> <br /> In this course, we will approach the subject from a computer science perspective and – in addition to covering the foundational aspects – also address how game theory can be approached computationally, e.g. consider how computers can be programmed to play games, or analyse the computational complexity of various game-theoretic notions.<br /> <br /> === Dates and times ===<br /> <br /> The lecture takes place as follows:<br /> <br /> * Mondays, DS3, [https://navigator.tu-dresden.de/etplan/bey/00/raum/111100.5500 BEY/E39/U]<br /> <br /> Exercise sessions are offered as follows:<br /> <br /> * Thursdays, DS2, APB/E007<br /> * Thursdays, DS4, APB/E001<br /> * Thursdays, DS5, APB/E006<br /> <br /> === OPAL ===<br /> <br /> There is an [https://bildungsportal.sachsen.de/opal/auth/RepositoryEntry/54256828417/CourseNode/1777257464647455004 OPAL course] that we use to reach you in case exercise sessions or lectures have to be cancelled on short notice. Please register for the lecture and your respective exercise session to stay informed.<br /> <br /> === Topics ===<br /> <br /> * Noncooperative games in normal form<br /> * Noncooperative games in extensive form<br /> * Search in game trees<br /> * Games with missing information<br /> * Evolutionary game theory<br /> * The Game Description Language and General Game Playing<br /> * Cooperative Games<br /> <br /> === Exam ===<br /> <br /> For CMS/Erasmus students and students wishing to use this course for modules INF-B-510 or INF-B-520, there will be a written exam (90min). The exam will be closed book, i.e. without notes, and no other resources (in particular technical aids) are permitted.<br /> <br /> For anyone else (INF-Ma-25-GaT, INF-VERT-2/6, INF-BAS-2/6, INF-PM-FOR, IST) the exam will be oral. To obtain an exam slot, please contact [mailto:cl@tu-dresden.de the CL group's secretary].<br /> |Literature=* Jörg Rothe (Ed.): Economics and Computation. An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division. Springer-Verlag Berlin Heidelberg (2016) (Part I: Playing Successfully)<br /> ** Lectures 1, 2, 6, 7, 12, and 13<br /> <br /> * Richard Alan Gillman, David Housman: Game Theory. A Modeling Approach. CRC Press (2019)<br /> ** Lectures 1, 2, 4, and 10<br /> <br /> * Stuart J. Russell, Peter Norvig: Artificial Intelligence. A Modern Approach (Global Edition). Pearson (2021) (Chapter 6: Adversarial Search and Games)<br /> ** Lectures 5 and 6<br /> <br /> * Todd W. Neller, Marc Lanctot: An Introduction to Counterfactual Regret Minimization. Self-published. (2013)<br /> ** Lecture 9<br /> <br /> * Noam Nisan, Tim Roughgarden, Éva Tardos, Vijay Vazirani (eds.): Algorithmic Game Theory. Cambridge University Press (2007)<br /> ** Lecture 10<br /> <br /> * Michael R. Genesereth, Michael Thielscher: General Game Playing (Synthesis Lectures on Artificial Intelligence and Machine Learning) Morgan &amp; Claypool Publishers (2014)<br /> ** Lectures 5, 6, and 11<br /> <br /> * Bernhard von Stengel: Game Theory Basics. Cambridge University Press (2021)<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Noncooperative Games in Normal Form<br /> |Room=BEY/E39/U<br /> |Date=2026-04-13<br /> |DS=DS3<br /> |Download=AGT2026-01.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 1<br /> |Room=APB<br /> |Date=2026-04-16<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-01.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Normal-Form Games: Mixed Strategies<br /> |Room=BEY/E39/U<br /> |Date=2026-04-20<br /> |DS=DS3<br /> |Download=AGT2026-02.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 2<br /> |Room=APB<br /> |Date=2026-04-23<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-02.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Complexity and Correlated Equilibria<br /> |Room=BEY/E39/U<br /> |Date=2026-04-27<br /> |DS=DS3<br /> |Download=AGT2026-03.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 3<br /> |Room=APB<br /> |Date=2026-04-30<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-03.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Sequential Games with Perfect Information<br /> |Room=BEY/E39/U<br /> |Date=2026-05-04<br /> |DS=DS3<br /> |Download=AGT2026-04.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 4<br /> |Room=APB<br /> |Date=2026-05-07<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-04.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Playing Games: Alpha-Beta Tree Search<br /> |Room=BEY/E39/U<br /> |Date=2026-05-11<br /> |DS=DS3<br /> |Download=AGT2026-05.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Entfällt<br /> |Title=Public holiday (no exercise sessions)<br /> |Room=APB<br /> |Date=2026-05-14<br /> |DS=terminlos<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Playing Games: Monte Carlo Tree Search<br /> |Room=BEY/E39/U<br /> |Date=2026-05-18<br /> |DS=DS3<br /> |Download=AGT2026-06.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 5<br /> |Room=APB<br /> |Date=2026-05-21<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-05.pdf<br /> }}</div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:AGT2026-Problems-05.pdf&diff=44418 2026-05-18T11:54:56Z

<p>Hannes Straß: </p> <hr /> <div></div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:AGT2026-06.pdf&diff=44417 2026-05-18T08:52:53Z

<p>Hannes Straß: Hannes Straß lud eine neue Version von Datei:AGT2026-06.pdf hoch</p> <hr /> <div></div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Algorithmic_Game_Theory_(SS2026)&diff=44410 2026-05-13T09:17:17Z

<p>Hannes Straß: </p> <hr /> <div>{{Vorlesung<br /> |Title=Algorithmic Game Theory<br /> |Research group=Computational Logic<br /> |Lecturers=Hannes Straß<br /> |Tutors=Sarah Alice Gaggl<br /> |Term=SS<br /> |Year=2026<br /> |Module=INF-B-510, INF-B-520, INF-PM-FOR, INF-Ma-FTK-GaT<br /> |SWSLecture=2<br /> |SWSExercise=2<br /> |SWSPractical=0<br /> |Exam type=Klausur, mündliche Prüfung<br /> |Description=Game Theory is a multi-disciplinary and pervasive field that is concerned with how strategic decision making can be formally modelled and mathematically analysed.<br /> <br /> In this course, we will approach the subject from a computer science perspective and – in addition to covering the foundational aspects – also address how game theory can be approached computationally, e.g. consider how computers can be programmed to play games, or analyse the computational complexity of various game-theoretic notions.<br /> <br /> === Dates and times ===<br /> <br /> The lecture takes place as follows:<br /> <br /> * Mondays, DS3, [https://navigator.tu-dresden.de/etplan/bey/00/raum/111100.5500 BEY/E39/U]<br /> <br /> Exercise sessions are offered as follows:<br /> <br /> * Thursdays, DS2, APB/E007<br /> * Thursdays, DS4, APB/E001<br /> * Thursdays, DS5, APB/E006<br /> <br /> === OPAL ===<br /> <br /> There is an [https://bildungsportal.sachsen.de/opal/auth/RepositoryEntry/54256828417/CourseNode/1777257464647455004 OPAL course] that we use to reach you in case exercise sessions or lectures have to be cancelled on short notice. Please register for the lecture and your respective exercise session to stay informed.<br /> <br /> === Topics ===<br /> <br /> * Noncooperative games in normal form<br /> * Noncooperative games in extensive form<br /> * Search in game trees<br /> * Games with missing information<br /> * Evolutionary game theory<br /> * The Game Description Language and General Game Playing<br /> * Cooperative Games<br /> <br /> === Exam ===<br /> <br /> For CMS/Erasmus students and students wishing to use this course for modules INF-B-510 or INF-B-520, there will be a written exam (90min). The exam will be closed book, i.e. without notes, and no other resources (in particular technical aids) are permitted.<br /> <br /> For anyone else (INF-Ma-25-GaT, INF-VERT-2/6, INF-BAS-2/6, INF-PM-FOR, IST) the exam will be oral. To obtain an exam slot, please contact [mailto:cl@tu-dresden.de the CL group's secretary].<br /> |Literature=* Jörg Rothe (Ed.): Economics and Computation. An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division. Springer-Verlag Berlin Heidelberg (2016) (Part I: Playing Successfully)<br /> ** Lectures 1, 2, 6, 7, 12, and 13<br /> <br /> * Richard Alan Gillman, David Housman: Game Theory. A Modeling Approach. CRC Press (2019)<br /> ** Lectures 1, 2, 4, and 10<br /> <br /> * Stuart J. Russell, Peter Norvig: Artificial Intelligence. A Modern Approach (Global Edition). Pearson (2021) (Chapter 6: Adversarial Search and Games)<br /> ** Lectures 5 and 6<br /> <br /> * Todd W. Neller, Marc Lanctot: An Introduction to Counterfactual Regret Minimization. Self-published. (2013)<br /> ** Lecture 9<br /> <br /> * Noam Nisan, Tim Roughgarden, Éva Tardos, Vijay Vazirani (eds.): Algorithmic Game Theory. Cambridge University Press (2007)<br /> ** Lecture 10<br /> <br /> * Michael R. Genesereth, Michael Thielscher: General Game Playing (Synthesis Lectures on Artificial Intelligence and Machine Learning) Morgan &amp; Claypool Publishers (2014)<br /> ** Lectures 5, 6, and 11<br /> <br /> * Bernhard von Stengel: Game Theory Basics. Cambridge University Press (2021)<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Noncooperative Games in Normal Form<br /> |Room=BEY/E39/U<br /> |Date=2026-04-13<br /> |DS=DS3<br /> |Download=AGT2026-01.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 1<br /> |Room=APB<br /> |Date=2026-04-16<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-01.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Normal-Form Games: Mixed Strategies<br /> |Room=BEY/E39/U<br /> |Date=2026-04-20<br /> |DS=DS3<br /> |Download=AGT2026-02.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 2<br /> |Room=APB<br /> |Date=2026-04-23<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-02.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Complexity and Correlated Equilibria<br /> |Room=BEY/E39/U<br /> |Date=2026-04-27<br /> |DS=DS3<br /> |Download=AGT2026-03.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 3<br /> |Room=APB<br /> |Date=2026-04-30<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-03.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Sequential Games with Perfect Information<br /> |Room=BEY/E39/U<br /> |Date=2026-05-04<br /> |DS=DS3<br /> |Download=AGT2026-04.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 4<br /> |Room=APB<br /> |Date=2026-05-07<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-04.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Playing Games: Alpha-Beta Tree Search<br /> |Room=BEY/E39/U<br /> |Date=2026-05-11<br /> |DS=DS3<br /> |Download=AGT2026-05.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Entfällt<br /> |Title=Public holiday (no exercise sessions)<br /> |Room=APB<br /> |Date=2026-05-14<br /> |DS=terminlos<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Playing Games: Monte Carlo Tree Search<br /> |Room=BEY/E39/U<br /> |Date=2026-05-18<br /> |DS=DS3<br /> |Download=AGT2026-06.pdf<br /> }}</div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:AGT2026-06.pdf&diff=44409 2026-05-13T09:16:25Z

<p>Hannes Straß: </p> <hr /> <div></div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Algorithmic_Game_Theory_(SS2026)&diff=44408 2026-05-13T08:18:36Z

<p>Hannes Straß: </p> <hr /> <div>{{Vorlesung<br /> |Title=Algorithmic Game Theory<br /> |Research group=Computational Logic<br /> |Lecturers=Hannes Straß<br /> |Tutors=Sarah Alice Gaggl<br /> |Term=SS<br /> |Year=2026<br /> |Module=INF-B-510, INF-B-520, INF-PM-FOR, INF-Ma-FTK-GaT<br /> |SWSLecture=2<br /> |SWSExercise=2<br /> |SWSPractical=0<br /> |Exam type=Klausur, mündliche Prüfung<br /> |Description=Game Theory is a multi-disciplinary and pervasive field that is concerned with how strategic decision making can be formally modelled and mathematically analysed.<br /> <br /> In this course, we will approach the subject from a computer science perspective and – in addition to covering the foundational aspects – also address how game theory can be approached computationally, e.g. consider how computers can be programmed to play games, or analyse the computational complexity of various game-theoretic notions.<br /> <br /> === Dates and times ===<br /> <br /> The lecture takes place as follows:<br /> <br /> * Mondays, DS3, [https://navigator.tu-dresden.de/etplan/bey/00/raum/111100.5500 BEY/E39/U]<br /> <br /> Exercise sessions are offered as follows:<br /> <br /> * Thursdays, DS2, APB/E007<br /> * Thursdays, DS4, APB/E001<br /> * Thursdays, DS5, APB/E006<br /> <br /> === OPAL ===<br /> <br /> There is an [https://bildungsportal.sachsen.de/opal/auth/RepositoryEntry/54256828417/CourseNode/1777257464647455004 OPAL course] that we use to reach you in case exercise sessions or lectures have to be cancelled on short notice. Please register for the lecture and your respective exercise session to stay informed.<br /> <br /> === Topics ===<br /> <br /> * Noncooperative games in normal form<br /> * Noncooperative games in extensive form<br /> * Search in game trees<br /> * Games with missing information<br /> * Evolutionary game theory<br /> * The Game Description Language and General Game Playing<br /> * Cooperative Games<br /> <br /> === Exam ===<br /> <br /> For CMS/Erasmus students and students wishing to use this course for modules INF-B-510 or INF-B-520, there will be a written exam (90min). The exam will be closed book, i.e. without notes, and no other resources (in particular technical aids) are permitted.<br /> <br /> For anyone else (INF-Ma-25-GaT, INF-VERT-2/6, INF-BAS-2/6, INF-PM-FOR, IST) the exam will be oral. To obtain an exam slot, please contact [mailto:cl@tu-dresden.de the CL group's secretary].<br /> |Literature=* Jörg Rothe (Ed.): Economics and Computation. An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division. Springer-Verlag Berlin Heidelberg (2016) (Part I: Playing Successfully)<br /> ** Lectures 1, 2, 6, 7, 12, and 13<br /> <br /> * Richard Alan Gillman, David Housman: Game Theory. A Modeling Approach. CRC Press (2019)<br /> ** Lectures 1, 2, 4, and 10<br /> <br /> * Stuart J. Russell, Peter Norvig: Artificial Intelligence. A Modern Approach (Global Edition). Pearson (2021) (Chapter 6: Adversarial Search and Games)<br /> ** Lectures 5 and 6<br /> <br /> * Todd W. Neller, Marc Lanctot: An Introduction to Counterfactual Regret Minimization. Self-published. (2013)<br /> ** Lecture 9<br /> <br /> * Noam Nisan, Tim Roughgarden, Éva Tardos, Vijay Vazirani (eds.): Algorithmic Game Theory. Cambridge University Press (2007)<br /> ** Lecture 10<br /> <br /> * Michael R. Genesereth, Michael Thielscher: General Game Playing (Synthesis Lectures on Artificial Intelligence and Machine Learning) Morgan &amp; Claypool Publishers (2014)<br /> ** Lectures 5, 6, and 11<br /> <br /> * Bernhard von Stengel: Game Theory Basics. Cambridge University Press (2021)<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Noncooperative Games in Normal Form<br /> |Room=BEY/E39/U<br /> |Date=2026-04-13<br /> |DS=DS3<br /> |Download=AGT2026-01.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 1<br /> |Room=APB<br /> |Date=2026-04-16<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-01.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Normal-Form Games: Mixed Strategies<br /> |Room=BEY/E39/U<br /> |Date=2026-04-20<br /> |DS=DS3<br /> |Download=AGT2026-02.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 2<br /> |Room=APB<br /> |Date=2026-04-23<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-02.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Complexity and Correlated Equilibria<br /> |Room=BEY/E39/U<br /> |Date=2026-04-27<br /> |DS=DS3<br /> |Download=AGT2026-03.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 3<br /> |Room=APB<br /> |Date=2026-04-30<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-03.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Sequential Games with Perfect Information<br /> |Room=BEY/E39/U<br /> |Date=2026-05-04<br /> |DS=DS3<br /> |Download=AGT2026-04.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 4<br /> |Room=APB<br /> |Date=2026-05-07<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-04.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Playing Games: Alpha-Beta Tree Search<br /> |Room=BEY/E39/U<br /> |Date=2026-05-11<br /> |DS=DS3<br /> |Download=AGT2026-05.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Entfällt<br /> |Title=Public holiday (no exercise sessions)<br /> |Room=APB<br /> |Date=2026-05-14<br /> |DS=terminlos<br /> }}</div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Algorithmic_Game_Theory_(SS2026)&diff=44407 2026-05-13T08:18:05Z

<p>Hannes Straß: </p> <hr /> <div>{{Vorlesung<br /> |Title=Algorithmic Game Theory<br /> |Research group=Computational Logic<br /> |Lecturers=Hannes Straß<br /> |Tutors=Sarah Alice Gaggl<br /> |Term=SS<br /> |Year=2026<br /> |Module=INF-B-510, INF-B-520, INF-PM-FOR, INF-Ma-FTK-GaT<br /> |SWSLecture=2<br /> |SWSExercise=2<br /> |SWSPractical=0<br /> |Exam type=Klausur, mündliche Prüfung<br /> |Description=Game Theory is a multi-disciplinary and pervasive field that is concerned with how strategic decision making can be formally modelled and mathematically analysed.<br /> <br /> In this course, we will approach the subject from a computer science perspective and – in addition to covering the foundational aspects – also address how game theory can be approached computationally, e.g. consider how computers can be programmed to play games, or analyse the computational complexity of various game-theoretic notions.<br /> <br /> === Dates and times ===<br /> <br /> The lecture takes place as follows:<br /> <br /> * Mondays, DS3, [https://navigator.tu-dresden.de/etplan/bey/00/raum/111100.5500 BEY/E39/U]<br /> <br /> Exercise sessions are offered as follows:<br /> <br /> * Thursdays, DS2, APB/E007<br /> * Thursdays, DS4, APB/E001<br /> * Thursdays, DS5, APB/E006<br /> <br /> === OPAL ===<br /> <br /> There is an [https://bildungsportal.sachsen.de/opal/auth/RepositoryEntry/54256828417/CourseNode/1777257464647455004 OPAL course] that we use to reach you in case exercise sessions or lectures have to be cancelled on short notice. Please register for the lecture and your respective exercise session to stay informed.<br /> <br /> === Topics ===<br /> <br /> * Noncooperative games in normal form<br /> * Noncooperative games in extensive form<br /> * Search in game trees<br /> * Games with missing information<br /> * Evolutionary game theory<br /> * The Game Description Language and General Game Playing<br /> * Cooperative Games<br /> <br /> === Exam ===<br /> <br /> For CMS/Erasmus students and students wishing to use this course for modules INF-B-510 or INF-B-520, there will be a written exam (90min). The exam will be closed book, i.e. without notes, and no other resources (in particular technical aids) are permitted.<br /> <br /> For anyone else (INF-VERT-2/6, INF-BAS-2/6, INF-PM-FOR, IST) the exam will be oral. To obtain an exam slot, please contact [mailto:cl@tu-dresden.de the CL group's secretary].<br /> |Literature=* Jörg Rothe (Ed.): Economics and Computation. An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division. Springer-Verlag Berlin Heidelberg (2016) (Part I: Playing Successfully)<br /> ** Lectures 1, 2, 6, 7, 12, and 13<br /> <br /> * Richard Alan Gillman, David Housman: Game Theory. A Modeling Approach. CRC Press (2019)<br /> ** Lectures 1, 2, 4, and 10<br /> <br /> * Stuart J. Russell, Peter Norvig: Artificial Intelligence. A Modern Approach (Global Edition). Pearson (2021) (Chapter 6: Adversarial Search and Games)<br /> ** Lectures 5 and 6<br /> <br /> * Todd W. Neller, Marc Lanctot: An Introduction to Counterfactual Regret Minimization. Self-published. (2013)<br /> ** Lecture 9<br /> <br /> * Noam Nisan, Tim Roughgarden, Éva Tardos, Vijay Vazirani (eds.): Algorithmic Game Theory. Cambridge University Press (2007)<br /> ** Lecture 10<br /> <br /> * Michael R. Genesereth, Michael Thielscher: General Game Playing (Synthesis Lectures on Artificial Intelligence and Machine Learning) Morgan &amp; Claypool Publishers (2014)<br /> ** Lectures 5, 6, and 11<br /> <br /> * Bernhard von Stengel: Game Theory Basics. Cambridge University Press (2021)<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Noncooperative Games in Normal Form<br /> |Room=BEY/E39/U<br /> |Date=2026-04-13<br /> |DS=DS3<br /> |Download=AGT2026-01.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 1<br /> |Room=APB<br /> |Date=2026-04-16<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-01.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Normal-Form Games: Mixed Strategies<br /> |Room=BEY/E39/U<br /> |Date=2026-04-20<br /> |DS=DS3<br /> |Download=AGT2026-02.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 2<br /> |Room=APB<br /> |Date=2026-04-23<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-02.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Complexity and Correlated Equilibria<br /> |Room=BEY/E39/U<br /> |Date=2026-04-27<br /> |DS=DS3<br /> |Download=AGT2026-03.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 3<br /> |Room=APB<br /> |Date=2026-04-30<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-03.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Sequential Games with Perfect Information<br /> |Room=BEY/E39/U<br /> |Date=2026-05-04<br /> |DS=DS3<br /> |Download=AGT2026-04.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 4<br /> |Room=APB<br /> |Date=2026-05-07<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-04.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Playing Games: Alpha-Beta Tree Search<br /> |Room=BEY/E39/U<br /> |Date=2026-05-11<br /> |DS=DS3<br /> |Download=AGT2026-05.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Entfällt<br /> |Title=Public holiday (no exercise sessions)<br /> |Room=APB<br /> |Date=2026-05-14<br /> |DS=terminlos<br /> }}</div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Projekte_und_Studienarbeiten_Computational_Logic&diff=44406 2026-05-13T08:15:04Z

<p>Hannes Straß: </p> <hr /> <div>{{Projektarbeit<br /> |Titel DE=Projekte und Studienarbeiten Computational Logic<br /> |Titel EN=Projects and Theses in Computational Logic<br /> |Research group=Computational Logic<br /> |Contacts=Sebastian Rudolph<br /> |Module=MCL-P, INF-PM-FPA, INF-PM-FPG, INF-MA-PR, INF-B-510, INF-B-520, CMS-PRO, CMS-TEA, INF-D-950, INF-D-960, INF-25-Ba-BaSe, INF-25-Ma-FP, INF-25-Ma-BSem, INF-25-Ma-GB, INF-25-Ma-AFT<br /> |Exam type=Hausarbeit, Referat<br /> |Beschreibung DE=Auf dieser Seite präsentieren wir Informationen zu den verfügbaren Modulen im Rahmen derer an der Professur Computational Logic studentische Projekte bearbeitet werden können. Kontaktieren Sie uns gern, wenn Sie Interesse daran haben, ein Thema bei uns zu bearbeiten. <br /> <br /> Die Dauer der Bearbeitung von Projekten hängt vom Modul ab. In der Regel sind diese '''innerhalb eines Semesters''' zu bearbeiten, mit der Ausnahme des Moduls [https://tu-dresden.de/ing/informatik/ressourcen/dateien/studium/modulbeschreibungen/inf-ma-pr.pdf?lang=en INF-MA-PR], welches '''innerhalb von zwei Semestern''' absolviert wird.<br /> <br /> Einige Module ([https://tu-dresden.de/ing/informatik/ressourcen/dateien/studium/modulbeschreibungen/inf-pm-fpa.pdf?lang=en INF-PM-FPA], [https://tu-dresden.de/ing/informatik/ressourcen/dateien/studium/modulbeschreibungen/inf-pm-fpg.pdf?lang=en INF-PM-FPG]) bieten sich auch als '''vorbereitende Studien für Ihre Master- oder Diplomarbeit''' an.<br /> <br /> {{ProjektModuleCL}}<br /> |Beschreibung EN=At this page you find information regarding different modules in the course of which you can do projects at the chair of Computational Logic. Please contact us if are interested in one of the modules. <br /> <br /> The actual project duration depends on the specific module. Most of them should be completed '''within one semester''' with the exception of [https://tu-dresden.de/ing/informatik/ressourcen/dateien/studium/modulbeschreibungen/inf-ma-pr.pdf?lang=en INF-MA-PR] which has a '''duration of two semesters'''.<br /> <br /> Some of the modules ([https://tu-dresden.de/ing/informatik/ressourcen/dateien/studium/modulbeschreibungen/inf-pm-fpa.pdf?lang=en INF-PM-FPA], [https://tu-dresden.de/ing/informatik/ressourcen/dateien/studium/modulbeschreibungen/inf-pm-fpg.pdf?lang=en INF-PM-FPG]) provide the opportunity to '''prepare for your Master or Diploma thesis'''.<br /> <br /> {{ProjektModuleCL}}<br /> |Current=1<br /> }}</div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Projekte_und_Studienarbeiten_Computational_Logic&diff=44405 2026-05-13T08:10:24Z

<p>Hannes Straß: </p> <hr /> <div>{{Projektarbeit<br /> |Titel DE=Projekte und Studienarbeiten Computational Logic<br /> |Titel EN=Projects and Theses in Computational Logic<br /> |Research group=Computational Logic<br /> |Contacts=Sebastian Rudolph<br /> |Module=MCL-P, INF-PM-FPA, INF-PM-FPG, INF-MA-PR, INF-B-510, INF-B-520, CMS-PRO, CMS-TEA, INF-D-950, INF-D-960, INF-25-BA-BASE, INF-25-MA-FP, INF-25-MA-BSEM, INF-25-Ma-GB, INF-25-Ma-AFT<br /> |Exam type=Hausarbeit, Referat<br /> |Beschreibung DE=Auf dieser Seite präsentieren wir Informationen zu den verfügbaren Modulen im Rahmen derer an der Professur Computational Logic studentische Projekte bearbeitet werden können. Kontaktieren Sie uns gern, wenn Sie Interesse daran haben, ein Thema bei uns zu bearbeiten. <br /> <br /> Die Dauer der Bearbeitung von Projekten hängt vom Modul ab. In der Regel sind diese '''innerhalb eines Semesters''' zu bearbeiten, mit der Ausnahme des Moduls [https://tu-dresden.de/ing/informatik/ressourcen/dateien/studium/modulbeschreibungen/inf-ma-pr.pdf?lang=en INF-MA-PR], welches '''innerhalb von zwei Semestern''' absolviert wird.<br /> <br /> Einige Module ([https://tu-dresden.de/ing/informatik/ressourcen/dateien/studium/modulbeschreibungen/inf-pm-fpa.pdf?lang=en INF-PM-FPA], [https://tu-dresden.de/ing/informatik/ressourcen/dateien/studium/modulbeschreibungen/inf-pm-fpg.pdf?lang=en INF-PM-FPG]) bieten sich auch als '''vorbereitende Studien für Ihre Master- oder Diplomarbeit''' an.<br /> <br /> {{ProjektModuleCL}}<br /> |Beschreibung EN=At this page you find information regarding different modules in the course of which you can do projects at the chair of Computational Logic. Please contact us if are interested in one of the modules. <br /> <br /> The actual project duration depends on the specific module. Most of them should be completed '''within one semester''' with the exception of [https://tu-dresden.de/ing/informatik/ressourcen/dateien/studium/modulbeschreibungen/inf-ma-pr.pdf?lang=en INF-MA-PR] which has a '''duration of two semesters'''.<br /> <br /> Some of the modules ([https://tu-dresden.de/ing/informatik/ressourcen/dateien/studium/modulbeschreibungen/inf-pm-fpa.pdf?lang=en INF-PM-FPA], [https://tu-dresden.de/ing/informatik/ressourcen/dateien/studium/modulbeschreibungen/inf-pm-fpg.pdf?lang=en INF-PM-FPG]) provide the opportunity to '''prepare for your Master or Diploma thesis'''.<br /> <br /> {{ProjektModuleCL}}<br /> |Current=1<br /> }}</div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:AGT2026-05.pdf&diff=44397 2026-05-11T08:21:21Z

<p>Hannes Straß: Hannes Straß lud eine neue Version von Datei:AGT2026-05.pdf hoch</p> <hr /> <div></div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Algorithmic_Game_Theory_(SS2026)&diff=44391 2026-05-08T12:32:53Z

<p>Hannes Straß: </p> <hr /> <div>{{Vorlesung<br /> |Title=Algorithmic Game Theory<br /> |Research group=Computational Logic<br /> |Lecturers=Hannes Straß<br /> |Tutors=Sarah Alice Gaggl<br /> |Term=SS<br /> |Year=2026<br /> |Module=INF-B-510, INF-B-520, INF-PM-FOR<br /> |SWSLecture=2<br /> |SWSExercise=2<br /> |SWSPractical=0<br /> |Exam type=Klausur, mündliche Prüfung<br /> |Description=Game Theory is a multi-disciplinary and pervasive field that is concerned with how strategic decision making can be formally modelled and mathematically analysed.<br /> <br /> In this course, we will approach the subject from a computer science perspective and – in addition to covering the foundational aspects – also address how game theory can be approached computationally, e.g. consider how computers can be programmed to play games, or analyse the computational complexity of various game-theoretic notions.<br /> <br /> === Dates and times ===<br /> <br /> The lecture takes place as follows:<br /> <br /> * Mondays, DS3, [https://navigator.tu-dresden.de/etplan/bey/00/raum/111100.5500 BEY/E39/U]<br /> <br /> Exercise sessions are offered as follows:<br /> <br /> * Thursdays, DS2, APB/E007<br /> * Thursdays, DS4, APB/E001<br /> * Thursdays, DS5, APB/E006<br /> <br /> === OPAL ===<br /> <br /> There is an [https://bildungsportal.sachsen.de/opal/auth/RepositoryEntry/54256828417/CourseNode/1777257464647455004 OPAL course] that we use to reach you in case exercise sessions or lectures have to be cancelled on short notice. Please register for the lecture and your respective exercise session to stay informed.<br /> <br /> === Topics ===<br /> <br /> * Noncooperative games in normal form<br /> * Noncooperative games in extensive form<br /> * Search in game trees<br /> * Games with missing information<br /> * Evolutionary game theory<br /> * The Game Description Language and General Game Playing<br /> * Cooperative Games<br /> <br /> === Exam ===<br /> <br /> For CMS/Erasmus students and students wishing to use this course for modules INF-B-510 or INF-B-520, there will be a written exam (90min). The exam will be closed book, i.e. without notes, and no other resources (in particular technical aids) are permitted.<br /> <br /> For anyone else (INF-VERT-2/6, INF-BAS-2/6, INF-PM-FOR, IST) the exam will be oral. To obtain an exam slot, please contact [mailto:cl@tu-dresden.de the CL group's secretary].<br /> |Literature=* Jörg Rothe (Ed.): Economics and Computation. An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division. Springer-Verlag Berlin Heidelberg (2016) (Part I: Playing Successfully)<br /> ** Lectures 1, 2, 6, 7, 12, and 13<br /> <br /> * Richard Alan Gillman, David Housman: Game Theory. A Modeling Approach. CRC Press (2019)<br /> ** Lectures 1, 2, 4, and 10<br /> <br /> * Stuart J. Russell, Peter Norvig: Artificial Intelligence. A Modern Approach (Global Edition). Pearson (2021) (Chapter 6: Adversarial Search and Games)<br /> ** Lectures 5 and 6<br /> <br /> * Todd W. Neller, Marc Lanctot: An Introduction to Counterfactual Regret Minimization. Self-published. (2013)<br /> ** Lecture 9<br /> <br /> * Noam Nisan, Tim Roughgarden, Éva Tardos, Vijay Vazirani (eds.): Algorithmic Game Theory. Cambridge University Press (2007)<br /> ** Lecture 10<br /> <br /> * Michael R. Genesereth, Michael Thielscher: General Game Playing (Synthesis Lectures on Artificial Intelligence and Machine Learning) Morgan &amp; Claypool Publishers (2014)<br /> ** Lectures 5, 6, and 11<br /> <br /> * Bernhard von Stengel: Game Theory Basics. Cambridge University Press (2021)<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Noncooperative Games in Normal Form<br /> |Room=BEY/E39/U<br /> |Date=2026-04-13<br /> |DS=DS3<br /> |Download=AGT2026-01.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 1<br /> |Room=APB<br /> |Date=2026-04-16<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-01.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Normal-Form Games: Mixed Strategies<br /> |Room=BEY/E39/U<br /> |Date=2026-04-20<br /> |DS=DS3<br /> |Download=AGT2026-02.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 2<br /> |Room=APB<br /> |Date=2026-04-23<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-02.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Complexity and Correlated Equilibria<br /> |Room=BEY/E39/U<br /> |Date=2026-04-27<br /> |DS=DS3<br /> |Download=AGT2026-03.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 3<br /> |Room=APB<br /> |Date=2026-04-30<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-03.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Sequential Games with Perfect Information<br /> |Room=BEY/E39/U<br /> |Date=2026-05-04<br /> |DS=DS3<br /> |Download=AGT2026-04.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 4<br /> |Room=APB<br /> |Date=2026-05-07<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-04.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Playing Games: Alpha-Beta Tree Search<br /> |Room=BEY/E39/U<br /> |Date=2026-05-11<br /> |DS=DS3<br /> |Download=AGT2026-05.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Entfällt<br /> |Title=Public holiday (no exercise sessions)<br /> |Room=APB<br /> |Date=2026-05-14<br /> |DS=terminlos<br /> }}</div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:AGT2026-05.pdf&diff=44390 2026-05-08T11:48:39Z

<p>Hannes Straß: Hannes Straß lud eine neue Version von Datei:AGT2026-05.pdf hoch</p> <hr /> <div></div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Algorithmic_Game_Theory_(SS2026)&diff=44389 2026-05-08T09:30:07Z

<p>Hannes Straß: </p> <hr /> <div>{{Vorlesung<br /> |Title=Algorithmic Game Theory<br /> |Research group=Computational Logic<br /> |Lecturers=Hannes Straß<br /> |Tutors=Sarah Alice Gaggl<br /> |Term=SS<br /> |Year=2026<br /> |Module=INF-B-510, INF-B-520, INF-PM-FOR<br /> |SWSLecture=2<br /> |SWSExercise=2<br /> |SWSPractical=0<br /> |Exam type=Klausur, mündliche Prüfung<br /> |Description=Game Theory is a multi-disciplinary and pervasive field that is concerned with how strategic decision making can be formally modelled and mathematically analysed.<br /> <br /> In this course, we will approach the subject from a computer science perspective and – in addition to covering the foundational aspects – also address how game theory can be approached computationally, e.g. consider how computers can be programmed to play games, or analyse the computational complexity of various game-theoretic notions.<br /> <br /> === Dates and times ===<br /> <br /> The lecture takes place as follows:<br /> <br /> * Mondays, DS3, [https://navigator.tu-dresden.de/etplan/bey/00/raum/111100.5500 BEY/E39/U]<br /> <br /> Exercise sessions are offered as follows:<br /> <br /> * Thursdays, DS2, APB/E007<br /> * Thursdays, DS4, APB/E001<br /> * Thursdays, DS5, APB/E006<br /> <br /> === OPAL ===<br /> <br /> There is an [https://bildungsportal.sachsen.de/opal/auth/RepositoryEntry/54256828417/CourseNode/1777257464647455004 OPAL course] that we use to reach you in case exercise sessions or lectures have to be cancelled on short notice. Please register for the lecture and your respective exercise session to stay informed.<br /> <br /> === Topics ===<br /> <br /> * Noncooperative games in normal form<br /> * Noncooperative games in extensive form<br /> * Search in game trees<br /> * Games with missing information<br /> * Evolutionary game theory<br /> * The Game Description Language and General Game Playing<br /> * Cooperative Games<br /> <br /> === Exam ===<br /> <br /> For CMS/Erasmus students and students wishing to use this course for modules INF-B-510 or INF-B-520, there will be a written exam (90min). The exam will be closed book, i.e. without notes, and no other resources (in particular technical aids) are permitted.<br /> <br /> For anyone else (INF-VERT-2/6, INF-BAS-2/6, INF-PM-FOR, IST) the exam will be oral. To obtain an exam slot, please contact [mailto:cl@tu-dresden.de the CL group's secretary].<br /> |Literature=* Jörg Rothe (Ed.): Economics and Computation. An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division. Springer-Verlag Berlin Heidelberg (2016) (Part I: Playing Successfully)<br /> ** Lectures 1, 2, 6, 7, 12, and 13<br /> <br /> * Richard Alan Gillman, David Housman: Game Theory. A Modeling Approach. CRC Press (2019)<br /> ** Lectures 1, 2, 4, and 10<br /> <br /> * Stuart J. Russell, Peter Norvig: Artificial Intelligence. A Modern Approach (Global Edition). Pearson (2021) (Chapter 6: Adversarial Search and Games)<br /> ** Lectures 5 and 6<br /> <br /> * Todd W. Neller, Marc Lanctot: An Introduction to Counterfactual Regret Minimization. Self-published. (2013)<br /> ** Lecture 9<br /> <br /> * Noam Nisan, Tim Roughgarden, Éva Tardos, Vijay Vazirani (eds.): Algorithmic Game Theory. Cambridge University Press (2007)<br /> ** Lecture 10<br /> <br /> * Michael R. Genesereth, Michael Thielscher: General Game Playing (Synthesis Lectures on Artificial Intelligence and Machine Learning) Morgan &amp; Claypool Publishers (2014)<br /> ** Lectures 5, 6, and 11<br /> <br /> * Bernhard von Stengel: Game Theory Basics. Cambridge University Press (2021)<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Noncooperative Games in Normal Form<br /> |Room=BEY/E39/U<br /> |Date=2026-04-13<br /> |DS=DS3<br /> |Download=AGT2026-01.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 1<br /> |Room=APB<br /> |Date=2026-04-16<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-01.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Normal-Form Games: Mixed Strategies<br /> |Room=BEY/E39/U<br /> |Date=2026-04-20<br /> |DS=DS3<br /> |Download=AGT2026-02.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 2<br /> |Room=APB<br /> |Date=2026-04-23<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-02.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Complexity and Correlated Equilibria<br /> |Room=BEY/E39/U<br /> |Date=2026-04-27<br /> |DS=DS3<br /> |Download=AGT2026-03.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 3<br /> |Room=APB<br /> |Date=2026-04-30<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-03.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Sequential Games with Perfect Information<br /> |Room=BEY/E39/U<br /> |Date=2026-05-04<br /> |DS=DS3<br /> |Download=AGT2026-04.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 4<br /> |Room=APB<br /> |Date=2026-05-07<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-04.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Playing Games: Alpha-Beta Tree Search<br /> |Room=BEY/E39/U<br /> |Date=2026-05-11<br /> |DS=DS3<br /> |Download=AGT2026-05.pdf<br /> }}</div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Algorithmic_Game_Theory_(SS2026)&diff=44388 2026-05-08T09:26:53Z

<p>Hannes Straß: </p> <hr /> <div>{{Vorlesung<br /> |Title=Algorithmic Game Theory<br /> |Research group=Computational Logic<br /> |Lecturers=Hannes Straß<br /> |Tutors=Sarah Alice Gaggl<br /> |Term=SS<br /> |Year=2026<br /> |Module=INF-B-510, INF-B-520, INF-PM-FOR<br /> |SWSLecture=2<br /> |SWSExercise=2<br /> |SWSPractical=0<br /> |Exam type=Klausur, mündliche Prüfung<br /> |Description=Game Theory is a multi-disciplinary and pervasive field that is concerned with how strategic decision making can be formally modelled and mathematically analysed.<br /> <br /> In this course, we will approach the subject from a computer science perspective and – in addition to covering the foundational aspects – also address how game theory can be approached computationally, e.g. consider how computers can be programmed to play games, or analyse the computational complexity of various game-theoretic notions.<br /> <br /> === Dates and times ===<br /> <br /> The lecture takes place as follows:<br /> <br /> * Mondays, DS3, [https://navigator.tu-dresden.de/etplan/bey/00/raum/111100.5500 BEY/E39/U]<br /> <br /> Exercise sessions are offered as follows:<br /> <br /> * Thursdays, DS2, APB/E007<br /> * Thursdays, DS4, APB/E001<br /> * Thursdays, DS5, APB/E006<br /> <br /> === OPAL ===<br /> <br /> There is an [https://bildungsportal.sachsen.de/opal/auth/RepositoryEntry/54256828417/CourseNode/1777257464647455004 OPAL course] that we use to reach you in case exercise sessions or lectures have to be cancelled on short notice. Please register for the lecture and your respective exercise session to stay informed.<br /> <br /> === Topics ===<br /> <br /> * Noncooperative games in normal form<br /> * Noncooperative games in extensive form<br /> * Search in game trees<br /> * Games with missing information<br /> * Evolutionary game theory<br /> * The Game Description Language and General Game Playing<br /> * Cooperative Games<br /> <br /> === Exam ===<br /> <br /> For CMS/Erasmus students and students wishing to use this course for modules INF-B-510 or INF-B-520, there will be a written exam (90min). The exam will be closed book, i.e. without notes, and no other resources (in particular technical aids) are permitted.<br /> <br /> For anyone else (INF-VERT-2/6, INF-BAS-2/6, INF-PM-FOR, IST) the exam will be oral. To obtain an exam slot, please contact [mailto:cl@tu-dresden.de the CL group's secretary].<br /> |Literature=* Jörg Rothe (Ed.): Economics and Computation. An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division. Springer-Verlag Berlin Heidelberg (2016) (Part I: Playing Successfully)<br /> ** Lectures 1, 2, 6, 7, 12, and 13<br /> <br /> * Richard Alan Gillman, David Housman: Game Theory. A Modeling Approach. CRC Press (2019)<br /> ** Lectures 1, 2, 4, and 10<br /> <br /> * Stuart J. Russell, Peter Norvig: Artificial Intelligence. A Modern Approach (Global Edition). Pearson (2021) (Chapter 6: Adversarial Search and Games)<br /> ** Lectures 5 and 6<br /> <br /> * Todd W. Neller, Marc Lanctot: An Introduction to Counterfactual Regret Minimization. Self-published. (2013)<br /> ** Lecture 9<br /> <br /> * Noam Nisan, Tim Roughgarden, Éva Tardos, Vijay Vazirani (eds.): Algorithmic Game Theory. Cambridge University Press (2007)<br /> ** Lecture 10<br /> <br /> * Michael R. Genesereth, Michael Thielscher: General Game Playing (Synthesis Lectures on Artificial Intelligence and Machine Learning) Morgan &amp; Claypool Publishers (2014)<br /> ** Lectures 5, 6, and 11<br /> <br /> * Bernhard von Stengel: Game Theory Basics. Cambridge University Press (2021)<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Noncooperative Games in Normal Form<br /> |Room=BEY/E39/U<br /> |Date=2026-04-13<br /> |DS=DS3<br /> |Download=AGT2026-01.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 1<br /> |Room=APB<br /> |Date=2026-04-16<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-01.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Normal-Form Games: Mixed Strategies<br /> |Room=BEY/E39/U<br /> |Date=2026-04-20<br /> |DS=DS3<br /> |Download=AGT2026-02.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 2<br /> |Room=APB<br /> |Date=2026-04-23<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-02.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Complexity and Correlated Equilibria<br /> |Room=BEY/E39/U<br /> |Date=2026-04-27<br /> |DS=DS3<br /> |Download=AGT2026-03.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 3<br /> |Room=APB<br /> |Date=2026-04-30<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-03.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Sequential Games with Perfect Information<br /> |Room=BEY/E39/U<br /> |Date=2026-05-04<br /> |DS=DS3<br /> |Download=AGT2026-04.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 4<br /> |Room=APB<br /> |Date=2026-05-07<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-04.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Playing Games: Alpha-Beta Tree Search<br /> |Room=BEY/E39/U<br /> |Date=2026-05-11<br /> |DS=DS3<br /> |Download=AGT2026-05.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Entfällt<br /> |Title=No exercise sessions: public holiday (Ascension)<br /> |Room=APB<br /> |Date=2026-05-14<br /> |DS=terminlos<br /> }}</div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:AGT2026-05.pdf&diff=44387 2026-05-08T09:25:34Z

<p>Hannes Straß: </p> <hr /> <div></div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:AGT2026-Problems-04.pdf&diff=44381 2026-05-05T09:17:28Z

<p>Hannes Straß: Hannes Straß lud eine neue Version von Datei:AGT2026-Problems-04.pdf hoch</p> <hr /> <div></div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Algorithmic_Game_Theory_(SS2026)&diff=44380 2026-05-04T13:20:00Z

<p>Hannes Straß: </p> <hr /> <div>{{Vorlesung<br /> |Title=Algorithmic Game Theory<br /> |Research group=Computational Logic<br /> |Lecturers=Hannes Straß<br /> |Tutors=Sarah Alice Gaggl<br /> |Term=SS<br /> |Year=2026<br /> |Module=INF-B-510, INF-B-520, INF-PM-FOR<br /> |SWSLecture=2<br /> |SWSExercise=2<br /> |SWSPractical=0<br /> |Exam type=Klausur, mündliche Prüfung<br /> |Description=Game Theory is a multi-disciplinary and pervasive field that is concerned with how strategic decision making can be formally modelled and mathematically analysed.<br /> <br /> In this course, we will approach the subject from a computer science perspective and – in addition to covering the foundational aspects – also address how game theory can be approached computationally, e.g. consider how computers can be programmed to play games, or analyse the computational complexity of various game-theoretic notions.<br /> <br /> === Dates and times ===<br /> <br /> The lecture takes place as follows:<br /> <br /> * Mondays, DS3, [https://navigator.tu-dresden.de/etplan/bey/00/raum/111100.5500 BEY/E39/U]<br /> <br /> Exercise sessions are offered as follows:<br /> <br /> * Thursdays, DS2, APB/E007<br /> * Thursdays, DS4, APB/E001<br /> * Thursdays, DS5, APB/E006<br /> <br /> === OPAL ===<br /> <br /> There is an [https://bildungsportal.sachsen.de/opal/auth/RepositoryEntry/54256828417/CourseNode/1777257464647455004 OPAL course] that we use to reach you in case exercise sessions or lectures have to be cancelled on short notice. Please register for the lecture and your respective exercise session to stay informed.<br /> <br /> === Topics ===<br /> <br /> * Noncooperative games in normal form<br /> * Noncooperative games in extensive form<br /> * Search in game trees<br /> * Games with missing information<br /> * Evolutionary game theory<br /> * The Game Description Language and General Game Playing<br /> * Cooperative Games<br /> <br /> === Exam ===<br /> <br /> For CMS/Erasmus students and students wishing to use this course for modules INF-B-510 or INF-B-520, there will be a written exam (90min). The exam will be closed book, i.e. without notes, and no other resources (in particular technical aids) are permitted.<br /> <br /> For anyone else (INF-VERT-2/6, INF-BAS-2/6, INF-PM-FOR, IST) the exam will be oral. To obtain an exam slot, please contact [mailto:cl@tu-dresden.de the CL group's secretary].<br /> |Literature=* Jörg Rothe (Ed.): Economics and Computation. An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division. Springer-Verlag Berlin Heidelberg (2016) (Part I: Playing Successfully)<br /> ** Lectures 1, 2, 6, 7, 12, and 13<br /> <br /> * Richard Alan Gillman, David Housman: Game Theory. A Modeling Approach. CRC Press (2019)<br /> ** Lectures 1, 2, 4, and 10<br /> <br /> * Stuart J. Russell, Peter Norvig: Artificial Intelligence. A Modern Approach (Global Edition). Pearson (2021) (Chapter 6: Adversarial Search and Games)<br /> ** Lectures 5 and 6<br /> <br /> * Todd W. Neller, Marc Lanctot: An Introduction to Counterfactual Regret Minimization. Self-published. (2013)<br /> ** Lecture 9<br /> <br /> * Noam Nisan, Tim Roughgarden, Éva Tardos, Vijay Vazirani (eds.): Algorithmic Game Theory. Cambridge University Press (2007)<br /> ** Lecture 10<br /> <br /> * Michael R. Genesereth, Michael Thielscher: General Game Playing (Synthesis Lectures on Artificial Intelligence and Machine Learning) Morgan &amp; Claypool Publishers (2014)<br /> ** Lectures 5, 6, and 11<br /> <br /> * Bernhard von Stengel: Game Theory Basics. Cambridge University Press (2021)<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Noncooperative Games in Normal Form<br /> |Room=BEY/E39/U<br /> |Date=2026-04-13<br /> |DS=DS3<br /> |Download=AGT2026-01.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 1<br /> |Room=APB<br /> |Date=2026-04-16<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-01.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Normal-Form Games: Mixed Strategies<br /> |Room=BEY/E39/U<br /> |Date=2026-04-20<br /> |DS=DS3<br /> |Download=AGT2026-02.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 2<br /> |Room=APB<br /> |Date=2026-04-23<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-02.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Complexity and Correlated Equilibria<br /> |Room=BEY/E39/U<br /> |Date=2026-04-27<br /> |DS=DS3<br /> |Download=AGT2026-03.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 3<br /> |Room=APB<br /> |Date=2026-04-30<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-03.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Sequential Games with Perfect Information<br /> |Room=BEY/E39/U<br /> |Date=2026-05-04<br /> |DS=DS3<br /> |Download=AGT2026-04.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 4<br /> |Room=APB<br /> |Date=2026-05-07<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-04.pdf<br /> }}</div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:AGT2026-Problems-04.pdf&diff=44379 2026-05-04T13:19:54Z

<p>Hannes Straß: </p> <hr /> <div></div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Algorithmic_Game_Theory_(SS2026)&diff=44375 2026-05-04T08:15:22Z

<p>Hannes Straß: </p> <hr /> <div>{{Vorlesung<br /> |Title=Algorithmic Game Theory<br /> |Research group=Computational Logic<br /> |Lecturers=Hannes Straß<br /> |Tutors=Sarah Alice Gaggl<br /> |Term=SS<br /> |Year=2026<br /> |Module=INF-B-510, INF-B-520, INF-PM-FOR<br /> |SWSLecture=2<br /> |SWSExercise=2<br /> |SWSPractical=0<br /> |Exam type=Klausur, mündliche Prüfung<br /> |Description=Game Theory is a multi-disciplinary and pervasive field that is concerned with how strategic decision making can be formally modelled and mathematically analysed.<br /> <br /> In this course, we will approach the subject from a computer science perspective and – in addition to covering the foundational aspects – also address how game theory can be approached computationally, e.g. consider how computers can be programmed to play games, or analyse the computational complexity of various game-theoretic notions.<br /> <br /> === Dates and times ===<br /> <br /> The lecture takes place as follows:<br /> <br /> * Mondays, DS3, [https://navigator.tu-dresden.de/etplan/bey/00/raum/111100.5500 BEY/E39/U]<br /> <br /> Exercise sessions are offered as follows:<br /> <br /> * Thursdays, DS2, APB/E007<br /> * Thursdays, DS4, APB/E001<br /> * Thursdays, DS5, APB/E006<br /> <br /> === OPAL ===<br /> <br /> There is an [https://bildungsportal.sachsen.de/opal/auth/RepositoryEntry/54256828417/CourseNode/1777257464647455004 OPAL course] that we use to reach you in case exercise sessions or lectures have to be cancelled on short notice. Please register for the lecture and your respective exercise session to stay informed.<br /> <br /> === Topics ===<br /> <br /> * Noncooperative games in normal form<br /> * Noncooperative games in extensive form<br /> * Search in game trees<br /> * Games with missing information<br /> * Evolutionary game theory<br /> * The Game Description Language and General Game Playing<br /> * Cooperative Games<br /> <br /> === Exam ===<br /> <br /> For CMS/Erasmus students and students wishing to use this course for modules INF-B-510 or INF-B-520, there will be a written exam (90min). The exam will be closed book, i.e. without notes, and no other resources (in particular technical aids) are permitted.<br /> <br /> For anyone else (INF-VERT-2/6, INF-BAS-2/6, INF-PM-FOR, IST) the exam will be oral. To obtain an exam slot, please contact [mailto:cl@tu-dresden.de the CL group's secretary].<br /> |Literature=* Jörg Rothe (Ed.): Economics and Computation. An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division. Springer-Verlag Berlin Heidelberg (2016) (Part I: Playing Successfully)<br /> ** Lectures 1, 2, 6, 7, 12, and 13<br /> <br /> * Richard Alan Gillman, David Housman: Game Theory. A Modeling Approach. CRC Press (2019)<br /> ** Lectures 1, 2, 4, and 10<br /> <br /> * Stuart J. Russell, Peter Norvig: Artificial Intelligence. A Modern Approach (Global Edition). Pearson (2021) (Chapter 6: Adversarial Search and Games)<br /> ** Lectures 5 and 6<br /> <br /> * Todd W. Neller, Marc Lanctot: An Introduction to Counterfactual Regret Minimization. Self-published. (2013)<br /> ** Lecture 9<br /> <br /> * Noam Nisan, Tim Roughgarden, Éva Tardos, Vijay Vazirani (eds.): Algorithmic Game Theory. Cambridge University Press (2007)<br /> ** Lecture 10<br /> <br /> * Michael R. Genesereth, Michael Thielscher: General Game Playing (Synthesis Lectures on Artificial Intelligence and Machine Learning) Morgan &amp; Claypool Publishers (2014)<br /> ** Lectures 5, 6, and 11<br /> <br /> * Bernhard von Stengel: Game Theory Basics. Cambridge University Press (2021)<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Noncooperative Games in Normal Form<br /> |Room=BEY/E39/U<br /> |Date=2026-04-13<br /> |DS=DS3<br /> |Download=AGT2026-01.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 1<br /> |Room=APB<br /> |Date=2026-04-16<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-01.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Normal-Form Games: Mixed Strategies<br /> |Room=BEY/E39/U<br /> |Date=2026-04-20<br /> |DS=DS3<br /> |Download=AGT2026-02.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 2<br /> |Room=APB<br /> |Date=2026-04-23<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-02.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Complexity and Correlated Equilibria<br /> |Room=BEY/E39/U<br /> |Date=2026-04-27<br /> |DS=DS3<br /> |Download=AGT2026-03.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 3<br /> |Room=APB<br /> |Date=2026-04-30<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-03.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Sequential Games with Perfect Information<br /> |Room=BEY/E39/U<br /> |Date=2026-05-04<br /> |DS=DS3<br /> |Download=AGT2026-04.pdf<br /> }}</div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Algorithmic_Game_Theory_(SS2026)&diff=44373 2026-05-04T08:14:29Z

<p>Hannes Straß: </p> <hr /> <div>{{Vorlesung<br /> |Title=Algorithmic Game Theory<br /> |Research group=Computational Logic<br /> |Lecturers=Hannes Straß<br /> |Tutors=Sarah Alice Gaggl<br /> |Term=SS<br /> |Year=2026<br /> |Module=INF-B-510, INF-B-520, INF-PM-FOR<br /> |SWSLecture=2<br /> |SWSExercise=2<br /> |SWSPractical=0<br /> |Exam type=Klausur, mündliche Prüfung<br /> |Description=Game Theory is a multi-disciplinary and pervasive field that is concerned with how strategic decision making can be formally modelled and mathematically analysed.<br /> <br /> In this course, we will approach the subject from a computer science perspective and – in addition to covering the foundational aspects – also address how game theory can be approached computationally, e.g. consider how computers can be programmed to play games, or analyse the computational complexity of various game-theoretic notions.<br /> <br /> === Dates and times ===<br /> <br /> The lecture takes place as follows:<br /> <br /> * Mondays, DS3, [https://navigator.tu-dresden.de/etplan/bey/00/raum/111100.5500 BEY/E39/U]<br /> <br /> Exercise sessions are offered as follows:<br /> <br /> * Thursdays, DS2, APB/E007<br /> * Thursdays, DS4, APB/E001<br /> * Thursdays, DS5, APB/E006<br /> <br /> === OPAL ===<br /> <br /> There is an [https://bildungsportal.sachsen.de/opal/auth/RepositoryEntry/54256828417/CourseNode/1777257464647455004 OPAL course] that we use to reach you in case exercise sessions or lectures have to be cancelled on short notice. Please register to the main course and your respective exercise session to stay informed.<br /> <br /> === Topics ===<br /> <br /> * Noncooperative games in normal form<br /> * Noncooperative games in extensive form<br /> * Search in game trees<br /> * Games with missing information<br /> * Evolutionary game theory<br /> * The Game Description Language and General Game Playing<br /> * Cooperative Games<br /> <br /> === Exam ===<br /> <br /> For CMS/Erasmus students and students wishing to use this course for modules INF-B-510 or INF-B-520, there will be a written exam (90min). The exam will be closed book, i.e. without notes, and no other resources (in particular technical aids) are permitted.<br /> <br /> For anyone else (INF-VERT-2/6, INF-BAS-2/6, INF-PM-FOR, IST) the exam will be oral. To obtain an exam slot, please contact [mailto:cl@tu-dresden.de the CL group's secretary].<br /> |Literature=* Jörg Rothe (Ed.): Economics and Computation. An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division. Springer-Verlag Berlin Heidelberg (2016) (Part I: Playing Successfully)<br /> ** Lectures 1, 2, 6, 7, 12, and 13<br /> <br /> * Richard Alan Gillman, David Housman: Game Theory. A Modeling Approach. CRC Press (2019)<br /> ** Lectures 1, 2, 4, and 10<br /> <br /> * Stuart J. Russell, Peter Norvig: Artificial Intelligence. A Modern Approach (Global Edition). Pearson (2021) (Chapter 6: Adversarial Search and Games)<br /> ** Lectures 5 and 6<br /> <br /> * Todd W. Neller, Marc Lanctot: An Introduction to Counterfactual Regret Minimization. Self-published. (2013)<br /> ** Lecture 9<br /> <br /> * Noam Nisan, Tim Roughgarden, Éva Tardos, Vijay Vazirani (eds.): Algorithmic Game Theory. Cambridge University Press (2007)<br /> ** Lecture 10<br /> <br /> * Michael R. Genesereth, Michael Thielscher: General Game Playing (Synthesis Lectures on Artificial Intelligence and Machine Learning) Morgan &amp; Claypool Publishers (2014)<br /> ** Lectures 5, 6, and 11<br /> <br /> * Bernhard von Stengel: Game Theory Basics. Cambridge University Press (2021)<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Noncooperative Games in Normal Form<br /> |Room=BEY/E39/U<br /> |Date=2026-04-13<br /> |DS=DS3<br /> |Download=AGT2026-01.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 1<br /> |Room=APB<br /> |Date=2026-04-16<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-01.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Normal-Form Games: Mixed Strategies<br /> |Room=BEY/E39/U<br /> |Date=2026-04-20<br /> |DS=DS3<br /> |Download=AGT2026-02.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 2<br /> |Room=APB<br /> |Date=2026-04-23<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-02.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Complexity and Correlated Equilibria<br /> |Room=BEY/E39/U<br /> |Date=2026-04-27<br /> |DS=DS3<br /> |Download=AGT2026-03.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 3<br /> |Room=APB<br /> |Date=2026-04-30<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-03.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Sequential Games with Perfect Information<br /> |Room=BEY/E39/U<br /> |Date=2026-05-04<br /> |DS=DS3<br /> |Download=AGT2026-04.pdf<br /> }}</div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:AGT2026-04.pdf&diff=44372 2026-05-04T08:14:15Z

<p>Hannes Straß: </p> <hr /> <div></div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:AGT2026-03.pdf&diff=44358 2026-04-29T08:06:31Z

<p>Hannes Straß: Hannes Straß lud eine neue Version von Datei:AGT2026-03.pdf hoch</p> <hr /> <div></div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Algorithmic_Game_Theory_(SS2026)&diff=44357 2026-04-27T11:50:22Z

<p>Hannes Straß: </p> <hr /> <div>{{Vorlesung<br /> |Title=Algorithmic Game Theory<br /> |Research group=Computational Logic<br /> |Lecturers=Hannes Straß<br /> |Tutors=Sarah Alice Gaggl<br /> |Term=SS<br /> |Year=2026<br /> |Module=INF-B-510, INF-B-520, INF-PM-FOR<br /> |SWSLecture=2<br /> |SWSExercise=2<br /> |SWSPractical=0<br /> |Exam type=Klausur, mündliche Prüfung<br /> |Description=Game Theory is a multi-disciplinary and pervasive field that is concerned with how strategic decision making can be formally modelled and mathematically analysed.<br /> <br /> In this course, we will approach the subject from a computer science perspective and – in addition to covering the foundational aspects – also address how game theory can be approached computationally, e.g. consider how computers can be programmed to play games, or analyse the computational complexity of various game-theoretic notions.<br /> <br /> === Dates and times ===<br /> <br /> The lecture takes place as follows:<br /> <br /> * Mondays, DS3, [https://navigator.tu-dresden.de/etplan/bey/00/raum/111100.5500 BEY/E39/U]<br /> <br /> Exercise sessions are offered as follows:<br /> <br /> * Thursdays, DS2, APB/E007<br /> * Thursdays, DS4, APB/E001<br /> * Thursdays, DS5, APB/E006<br /> <br /> === OPAL ===<br /> <br /> There is an [https://bildungsportal.sachsen.de/opal/auth/RepositoryEntry/54256828417/CourseNode/1777257464647455004 OPAL course] that we use to reach you in case exercise sessions or lectures have to be cancelled on short notice. Please register to the main course and your respective exercise session to stay informed.<br /> <br /> === Topics ===<br /> <br /> * Noncooperative games in normal form<br /> * Noncooperative games in extensive form<br /> * Search in game trees<br /> * Games with missing information<br /> * Evolutionary game theory<br /> * The Game Description Language and General Game Playing<br /> * Cooperative Games<br /> <br /> === Exam ===<br /> <br /> For CMS/Erasmus students and students wishing to use this course for modules INF-B-510 or INF-B-520, there will be a written exam (90min). The exam will be closed book, i.e. without notes, and no other resources (in particular technical aids) are permitted.<br /> <br /> For anyone else (INF-VERT-2/6, INF-BAS-2/6, INF-PM-FOR, IST) the exam will be oral. To obtain an exam slot, please contact [mailto:cl@tu-dresden.de the CL group's secretary].<br /> |Literature=* Jörg Rothe (Ed.): Economics and Computation. An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division. Springer-Verlag Berlin Heidelberg (2016) (Part I: Playing Successfully)<br /> ** Lectures 1, 2, 6, 7, 12, and 13<br /> <br /> * Richard Alan Gillman, David Housman: Game Theory. A Modeling Approach. CRC Press (2019)<br /> ** Lectures 1, 2, 4, and 10<br /> <br /> * Stuart J. Russell, Peter Norvig: Artificial Intelligence. A Modern Approach (Global Edition). Pearson (2021) (Chapter 6: Adversarial Search and Games)<br /> ** Lectures 5 and 6<br /> <br /> * Todd W. Neller, Marc Lanctot: An Introduction to Counterfactual Regret Minimization. Self-published. (2013)<br /> ** Lecture 9<br /> <br /> * Noam Nisan, Tim Roughgarden, Éva Tardos, Vijay Vazirani (eds.): Algorithmic Game Theory. Cambridge University Press (2007)<br /> ** Lecture 10<br /> <br /> * Michael R. Genesereth, Michael Thielscher: General Game Playing (Synthesis Lectures on Artificial Intelligence and Machine Learning) Morgan &amp; Claypool Publishers (2014)<br /> ** Lectures 5, 6, and 11<br /> <br /> * Bernhard von Stengel: Game Theory Basics. Cambridge University Press (2021)<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Noncooperative Games in Normal Form<br /> |Room=BEY/E39/U<br /> |Date=2026-04-13<br /> |DS=DS3<br /> |Download=AGT2026-01.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 1<br /> |Room=APB<br /> |Date=2026-04-16<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-01.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Normal-Form Games: Mixed Strategies<br /> |Room=BEY/E39/U<br /> |Date=2026-04-20<br /> |DS=DS3<br /> |Download=AGT2026-02.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 2<br /> |Room=APB<br /> |Date=2026-04-23<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-02.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Complexity and Correlated Equilibria<br /> |Room=BEY/E39/U<br /> |Date=2026-04-27<br /> |DS=DS3<br /> |Download=AGT2026-03.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 3<br /> |Room=APB<br /> |Date=2026-04-30<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-03.pdf<br /> }}</div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:AGT2026-Problems-03.pdf&diff=44356 2026-04-27T11:50:13Z

<p>Hannes Straß: </p> <hr /> <div></div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Algorithmic_Game_Theory_(SS2026)&diff=44346 2026-04-27T08:41:35Z

<p>Hannes Straß: </p> <hr /> <div>{{Vorlesung<br /> |Title=Algorithmic Game Theory<br /> |Research group=Computational Logic<br /> |Lecturers=Hannes Straß<br /> |Tutors=Sarah Alice Gaggl<br /> |Term=SS<br /> |Year=2026<br /> |Module=INF-B-510, INF-B-520, INF-PM-FOR<br /> |SWSLecture=2<br /> |SWSExercise=2<br /> |SWSPractical=0<br /> |Exam type=Klausur, mündliche Prüfung<br /> |Description=Game Theory is a multi-disciplinary and pervasive field that is concerned with how strategic decision making can be formally modelled and mathematically analysed.<br /> <br /> In this course, we will approach the subject from a computer science perspective and – in addition to covering the foundational aspects – also address how game theory can be approached computationally, e.g. consider how computers can be programmed to play games, or analyse the computational complexity of various game-theoretic notions.<br /> <br /> === Dates and times ===<br /> <br /> The lecture takes place as follows:<br /> <br /> * Mondays, DS3, [https://navigator.tu-dresden.de/etplan/bey/00/raum/111100.5500 BEY/E39/U]<br /> <br /> Exercise sessions are offered as follows:<br /> <br /> * Thursdays, DS2, APB/E007<br /> * Thursdays, DS4, APB/E001<br /> * Thursdays, DS5, APB/E006<br /> <br /> === OPAL ===<br /> <br /> There is an [https://bildungsportal.sachsen.de/opal/auth/RepositoryEntry/54256828417/CourseNode/1777257464647455004 OPAL course] that we use to reach you in case exercise sessions or lectures have to be cancelled on short notice. Please register to the main course and your respective exercise session to stay informed.<br /> <br /> === Topics ===<br /> <br /> * Noncooperative games in normal form<br /> * Noncooperative games in extensive form<br /> * Search in game trees<br /> * Games with missing information<br /> * Evolutionary game theory<br /> * The Game Description Language and General Game Playing<br /> * Cooperative Games<br /> <br /> === Exam ===<br /> <br /> For CMS/Erasmus students and students wishing to use this course for modules INF-B-510 or INF-B-520, there will be a written exam (90min). The exam will be closed book, i.e. without notes, and no other resources (in particular technical aids) are permitted.<br /> <br /> For anyone else (INF-VERT-2/6, INF-BAS-2/6, INF-PM-FOR, IST) the exam will be oral. To obtain an exam slot, please contact [mailto:cl@tu-dresden.de the CL group's secretary].<br /> |Literature=* Jörg Rothe (Ed.): Economics and Computation. An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division. Springer-Verlag Berlin Heidelberg (2016) (Part I: Playing Successfully)<br /> ** Lectures 1, 2, 6, 7, 12, and 13<br /> <br /> * Richard Alan Gillman, David Housman: Game Theory. A Modeling Approach. CRC Press (2019)<br /> ** Lectures 1, 2, 4, and 10<br /> <br /> * Stuart J. Russell, Peter Norvig: Artificial Intelligence. A Modern Approach (Global Edition). Pearson (2021) (Chapter 6: Adversarial Search and Games)<br /> ** Lectures 5 and 6<br /> <br /> * Todd W. Neller, Marc Lanctot: An Introduction to Counterfactual Regret Minimization. Self-published. (2013)<br /> ** Lecture 9<br /> <br /> * Noam Nisan, Tim Roughgarden, Éva Tardos, Vijay Vazirani (eds.): Algorithmic Game Theory. Cambridge University Press (2007)<br /> ** Lecture 10<br /> <br /> * Michael R. Genesereth, Michael Thielscher: General Game Playing (Synthesis Lectures on Artificial Intelligence and Machine Learning) Morgan &amp; Claypool Publishers (2014)<br /> ** Lectures 5, 6, and 11<br /> <br /> * Bernhard von Stengel: Game Theory Basics. Cambridge University Press (2021)<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Noncooperative Games in Normal Form<br /> |Room=BEY/E39/U<br /> |Date=2026-04-13<br /> |DS=DS3<br /> |Download=AGT2026-01.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 1<br /> |Room=APB<br /> |Date=2026-04-16<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-01.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Normal-Form Games: Mixed Strategies<br /> |Room=BEY/E39/U<br /> |Date=2026-04-20<br /> |DS=DS3<br /> |Download=AGT2026-02.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 2<br /> |Room=APB<br /> |Date=2026-04-23<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-02.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Complexity and Correlated Equilibria<br /> |Room=BEY/E39/U<br /> |Date=2026-04-27<br /> |DS=DS3<br /> |Download=AGT2026-03.pdf<br /> }}</div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Algorithmic_Game_Theory_(SS2026)&diff=44345 2026-04-27T08:40:32Z

<p>Hannes Straß: </p> <hr /> <div>{{Vorlesung<br /> |Title=Algorithmic Game Theory<br /> |Research group=Computational Logic<br /> |Lecturers=Hannes Straß<br /> |Tutors=Sarah Alice Gaggl<br /> |Term=SS<br /> |Year=2026<br /> |Module=INF-B-510, INF-B-520, INF-PM-FOR<br /> |SWSLecture=2<br /> |SWSExercise=2<br /> |SWSPractical=0<br /> |Exam type=Klausur, mündliche Prüfung<br /> |Description=Game Theory is a multi-disciplinary and pervasive field that is concerned with how strategic decision making can be formally modelled and mathematically analysed.<br /> <br /> In this course, we will approach the subject from a computer science perspective and – in addition to covering the foundational aspects – also address how game theory can be approached computationally, e.g. consider how computers can be programmed to play games, or analyse the computational complexity of various game-theoretic notions.<br /> <br /> === Dates and times ===<br /> <br /> The lecture takes place as follows:<br /> <br /> * Mondays, DS3, [https://navigator.tu-dresden.de/etplan/bey/00/raum/111100.5500 BEY/E39/U]<br /> <br /> Exercise sessions are offered as follows:<br /> <br /> * Thursdays, DS2, APB/E007<br /> * Thursdays, DS4, APB/E001<br /> * Thursdays, DS5, APB/E006<br /> <br /> === OPAL ===<br /> <br /> There is an [https://bildungsportal.sachsen.de/opal/auth/RepositoryEntry/54256828417/CourseNode/1777257464647455004 OPAL course] that we use to reach you in case exercise sessions or lectures have to be cancelled on short notice. Please register to your respective groups to stay informed.<br /> <br /> === Topics ===<br /> <br /> * Noncooperative games in normal form<br /> * Noncooperative games in extensive form<br /> * Search in game trees<br /> * Games with missing information<br /> * Evolutionary game theory<br /> * The Game Description Language and General Game Playing<br /> * Cooperative Games<br /> <br /> === Exam ===<br /> <br /> For CMS/Erasmus students and students wishing to use this course for modules INF-B-510 or INF-B-520, there will be a written exam (90min). The exam will be closed book, i.e. without notes, and no other resources (in particular technical aids) are permitted.<br /> <br /> For anyone else (INF-VERT-2/6, INF-BAS-2/6, INF-PM-FOR, IST) the exam will be oral. To obtain an exam slot, please contact [mailto:cl@tu-dresden.de the CL group's secretary].<br /> |Literature=* Jörg Rothe (Ed.): Economics and Computation. An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division. Springer-Verlag Berlin Heidelberg (2016) (Part I: Playing Successfully)<br /> ** Lectures 1, 2, 6, 7, 12, and 13<br /> <br /> * Richard Alan Gillman, David Housman: Game Theory. A Modeling Approach. CRC Press (2019)<br /> ** Lectures 1, 2, 4, and 10<br /> <br /> * Stuart J. Russell, Peter Norvig: Artificial Intelligence. A Modern Approach (Global Edition). Pearson (2021) (Chapter 6: Adversarial Search and Games)<br /> ** Lectures 5 and 6<br /> <br /> * Todd W. Neller, Marc Lanctot: An Introduction to Counterfactual Regret Minimization. Self-published. (2013)<br /> ** Lecture 9<br /> <br /> * Noam Nisan, Tim Roughgarden, Éva Tardos, Vijay Vazirani (eds.): Algorithmic Game Theory. Cambridge University Press (2007)<br /> ** Lecture 10<br /> <br /> * Michael R. Genesereth, Michael Thielscher: General Game Playing (Synthesis Lectures on Artificial Intelligence and Machine Learning) Morgan &amp; Claypool Publishers (2014)<br /> ** Lectures 5, 6, and 11<br /> <br /> * Bernhard von Stengel: Game Theory Basics. Cambridge University Press (2021)<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Noncooperative Games in Normal Form<br /> |Room=BEY/E39/U<br /> |Date=2026-04-13<br /> |DS=DS3<br /> |Download=AGT2026-01.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 1<br /> |Room=APB<br /> |Date=2026-04-16<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-01.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Normal-Form Games: Mixed Strategies<br /> |Room=BEY/E39/U<br /> |Date=2026-04-20<br /> |DS=DS3<br /> |Download=AGT2026-02.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 2<br /> |Room=APB<br /> |Date=2026-04-23<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-02.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Complexity and Correlated Equilibria<br /> |Room=BEY/E39/U<br /> |Date=2026-04-27<br /> |DS=DS3<br /> |Download=AGT2026-03.pdf<br /> }}</div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Algorithmic_Game_Theory_(SS2026)&diff=44341 2026-04-24T15:46:33Z

<p>Hannes Straß: </p> <hr /> <div>{{Vorlesung<br /> |Title=Algorithmic Game Theory<br /> |Research group=Computational Logic<br /> |Lecturers=Hannes Straß<br /> |Tutors=Sarah Alice Gaggl<br /> |Term=SS<br /> |Year=2026<br /> |Module=INF-B-510, INF-B-520, INF-PM-FOR<br /> |SWSLecture=2<br /> |SWSExercise=2<br /> |SWSPractical=0<br /> |Exam type=Klausur, mündliche Prüfung<br /> |Description=Game Theory is a multi-disciplinary and pervasive field that is concerned with how strategic decision making can be formally modelled and mathematically analysed.<br /> <br /> In this course, we will approach the subject from a computer science perspective and – in addition to covering the foundational aspects – also address how game theory can be approached computationally, e.g. consider how computers can be programmed to play games, or analyse the computational complexity of various game-theoretic notions.<br /> <br /> === Dates and times ===<br /> <br /> The lecture takes place as follows:<br /> <br /> * Mondays, DS3, [https://navigator.tu-dresden.de/etplan/bey/00/raum/111100.5500 BEY/E39/U]<br /> <br /> Exercise sessions are offered as follows:<br /> <br /> * Thursdays, DS2, APB/E007<br /> * Thursdays, DS4, APB/E001<br /> * Thursdays, DS5, APB/E006<br /> * Fridays, DS2, APB/E001<br /> <br /> Exercises start in the week of the first lecture, i.e. on 16th April.<br /> <br /> === Topics ===<br /> <br /> * Noncooperative games in normal form<br /> * Noncooperative games in extensive form<br /> * Search in game trees<br /> * Games with missing information<br /> * Evolutionary game theory<br /> * The Game Description Language and General Game Playing<br /> * Cooperative Games<br /> <br /> === Exam ===<br /> <br /> For CMS/Erasmus students and students wishing to use this course for modules INF-B-510 or INF-B-520, there will be a written exam (90min). The exam will be closed book, i.e. without notes, and no other resources (in particular technical aids) are permitted.<br /> <br /> For anyone else (INF-VERT-2/6, INF-BAS-2/6, INF-PM-FOR, IST) the exam will be oral. To obtain an exam slot, please contact [mailto:cl@tu-dresden.de the CL group's secretary].<br /> |Literature=* Jörg Rothe (Ed.): Economics and Computation. An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division. Springer-Verlag Berlin Heidelberg (2016) (Part I: Playing Successfully)<br /> ** Lectures 1, 2, 6, 7, 12, and 13<br /> <br /> * Richard Alan Gillman, David Housman: Game Theory. A Modeling Approach. CRC Press (2019)<br /> ** Lectures 1, 2, 4, and 10<br /> <br /> * Stuart J. Russell, Peter Norvig: Artificial Intelligence. A Modern Approach (Global Edition). Pearson (2021) (Chapter 6: Adversarial Search and Games)<br /> ** Lectures 5 and 6<br /> <br /> * Todd W. Neller, Marc Lanctot: An Introduction to Counterfactual Regret Minimization. Self-published. (2013)<br /> ** Lecture 9<br /> <br /> * Noam Nisan, Tim Roughgarden, Éva Tardos, Vijay Vazirani (eds.): Algorithmic Game Theory. Cambridge University Press (2007)<br /> ** Lecture 10<br /> <br /> * Michael R. Genesereth, Michael Thielscher: General Game Playing (Synthesis Lectures on Artificial Intelligence and Machine Learning) Morgan &amp; Claypool Publishers (2014)<br /> ** Lectures 5, 6, and 11<br /> <br /> * Bernhard von Stengel: Game Theory Basics. Cambridge University Press (2021)<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Noncooperative Games in Normal Form<br /> |Room=BEY/E39/U<br /> |Date=2026-04-13<br /> |DS=DS3<br /> |Download=AGT2026-01.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 1<br /> |Room=APB<br /> |Date=2026-04-16<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-01.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Normal-Form Games: Mixed Strategies<br /> |Room=BEY/E39/U<br /> |Date=2026-04-20<br /> |DS=DS3<br /> |Download=AGT2026-02.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 2<br /> |Room=APB<br /> |Date=2026-04-23<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-02.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Complexity and Correlated Equilibria<br /> |Room=BEY/E39/U<br /> |Date=2026-04-27<br /> |DS=DS3<br /> |Download=AGT2026-03.pdf<br /> }}</div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:AGT2026-03.pdf&diff=44340 2026-04-24T15:46:18Z

<p>Hannes Straß: </p> <hr /> <div></div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:AGT2026-Problems-02.pdf&diff=44325 2026-04-21T13:05:52Z

<p>Hannes Straß: Hannes Straß lud eine neue Version von Datei:AGT2026-Problems-02.pdf hoch</p> <hr /> <div></div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Algorithmic_Game_Theory_(SS2026)&diff=44324 2026-04-21T12:13:30Z

<p>Hannes Straß: </p> <hr /> <div>{{Vorlesung<br /> |Title=Algorithmic Game Theory<br /> |Research group=Computational Logic<br /> |Lecturers=Hannes Straß<br /> |Tutors=Sarah Alice Gaggl<br /> |Term=SS<br /> |Year=2026<br /> |Module=INF-B-510, INF-B-520, INF-PM-FOR<br /> |SWSLecture=2<br /> |SWSExercise=2<br /> |SWSPractical=0<br /> |Exam type=Klausur, mündliche Prüfung<br /> |Description=Game Theory is a multi-disciplinary and pervasive field that is concerned with how strategic decision making can be formally modelled and mathematically analysed.<br /> <br /> In this course, we will approach the subject from a computer science perspective and – in addition to covering the foundational aspects – also address how game theory can be approached computationally, e.g. consider how computers can be programmed to play games, or analyse the computational complexity of various game-theoretic notions.<br /> <br /> === Dates and times ===<br /> <br /> The lecture takes place as follows:<br /> <br /> * Mondays, DS3, [https://navigator.tu-dresden.de/etplan/bey/00/raum/111100.5500 BEY/E39/U]<br /> <br /> Exercise sessions are offered as follows:<br /> <br /> * Thursdays, DS2, APB/E007<br /> * Thursdays, DS4, APB/E001<br /> * Thursdays, DS5, APB/E006<br /> * Fridays, DS2, APB/E001<br /> <br /> Exercises start in the week of the first lecture, i.e. on 16th April.<br /> <br /> === Topics ===<br /> <br /> * Noncooperative games in normal form<br /> * Noncooperative games in extensive form<br /> * Search in game trees<br /> * Games with missing information<br /> * Evolutionary game theory<br /> * The Game Description Language and General Game Playing<br /> * Cooperative Games<br /> <br /> === Exam ===<br /> <br /> For CMS/Erasmus students and students wishing to use this course for modules INF-B-510 or INF-B-520, there will be a written exam (90min). The exam will be closed book, i.e. without notes, and no other resources (in particular technical aids) are permitted.<br /> <br /> For anyone else (INF-VERT-2/6, INF-BAS-2/6, INF-PM-FOR, IST) the exam will be oral. To obtain an exam slot, please contact [mailto:cl@tu-dresden.de the CL group's secretary].<br /> |Literature=* Jörg Rothe (Ed.): Economics and Computation. An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division. Springer-Verlag Berlin Heidelberg (2016) (Part I: Playing Successfully)<br /> ** Lectures 1, 2, 6, 7, 12, and 13<br /> <br /> * Richard Alan Gillman, David Housman: Game Theory. A Modeling Approach. CRC Press (2019)<br /> ** Lectures 1, 2, 4, and 10<br /> <br /> * Stuart J. Russell, Peter Norvig: Artificial Intelligence. A Modern Approach (Global Edition). Pearson (2021) (Chapter 6: Adversarial Search and Games)<br /> ** Lectures 5 and 6<br /> <br /> * Todd W. Neller, Marc Lanctot: An Introduction to Counterfactual Regret Minimization. Self-published. (2013)<br /> ** Lecture 9<br /> <br /> * Noam Nisan, Tim Roughgarden, Éva Tardos, Vijay Vazirani (eds.): Algorithmic Game Theory. Cambridge University Press (2007)<br /> ** Lecture 10<br /> <br /> * Michael R. Genesereth, Michael Thielscher: General Game Playing (Synthesis Lectures on Artificial Intelligence and Machine Learning) Morgan &amp; Claypool Publishers (2014)<br /> ** Lectures 5, 6, and 11<br /> <br /> * Bernhard von Stengel: Game Theory Basics. Cambridge University Press (2021)<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Noncooperative Games in Normal Form<br /> |Room=BEY/E39/U<br /> |Date=2026-04-13<br /> |DS=DS3<br /> |Download=AGT2026-01.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 1<br /> |Room=APB<br /> |Date=2026-04-16<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-01.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Normal-Form Games: Mixed Strategies<br /> |Room=BEY/E39/U<br /> |Date=2026-04-20<br /> |DS=DS3<br /> |Download=AGT2026-02.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 2<br /> |Room=APB<br /> |Date=2026-04-23<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-02.pdf<br /> }}</div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Algorithmic_Game_Theory_(SS2026)&diff=44323 2026-04-21T12:13:09Z

<p>Hannes Straß: </p> <hr /> <div>{{Vorlesung<br /> |Title=Algorithmic Game Theory<br /> |Research group=Computational Logic<br /> |Lecturers=Hannes Straß<br /> |Tutors=Sarah Alice Gaggl<br /> |Term=SS<br /> |Year=2026<br /> |Module=INF-B-510, INF-B-520, INF-PM-FOR<br /> |SWSLecture=2<br /> |SWSExercise=2<br /> |SWSPractical=0<br /> |Exam type=Klausur, mündliche Prüfung<br /> |Description=Game Theory is a multi-disciplinary and pervasive field that is concerned with how strategic decision making can be formally modelled and mathematically analysed.<br /> <br /> In this course, we will approach the subject from a computer science perspective and – in addition to covering the foundational aspects – also address how game theory can be approached computationally, e.g. consider how computers can be programmed to play games, or analyse the computational complexity of various game-theoretic notions.<br /> <br /> === Dates and times ===<br /> <br /> The lecture takes place as follows:<br /> <br /> * Mondays, DS3, [https://navigator.tu-dresden.de/etplan/bey/00/raum/111100.5500 BEY/E39/U]<br /> <br /> Exercise sessions are offered as follows:<br /> <br /> * Thursdays, DS2, APB/E007<br /> * Thursdays, DS4, APB/E001<br /> * Thursdays, DS5, APB/E006<br /> * Fridays, DS2, APB/E001<br /> <br /> Exercises start in the week of the first lecture, i.e. on 16th April.<br /> <br /> === Topics ===<br /> <br /> * Noncooperative games in normal form<br /> * Noncooperative games in extensive form<br /> * Search in game trees<br /> * Games with missing information<br /> * Evolutionary game theory<br /> * The Game Description Language and General Game Playing<br /> * Cooperative Games<br /> <br /> === Exam ===<br /> <br /> For CMS/Erasmus students and students wishing to use this course for modules INF-B-510 or INF-B-520, there will be a written exam (90min). The exam will be closed book, i.e. without notes, and no other resources (in particular technical aids) are permitted.<br /> <br /> For anyone else (INF-VERT-2/6, INF-BAS-2/6, INF-PM-FOR, IST) the exam will be oral. To obtain an exam slot, please contact [mailto:cl@tu-dresden.de the CL group's secretary].<br /> |Literature=* Jörg Rothe (Ed.): Economics and Computation. An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division. Springer-Verlag Berlin Heidelberg (2016) (Part I: Playing Successfully)<br /> ** Lectures 1, 2, 6, 7, 12, and 13<br /> <br /> * Richard Alan Gillman, David Housman: Game Theory. A Modeling Approach. CRC Press (2019)<br /> ** Lectures 1, 2, 4, and 10<br /> <br /> * Stuart J. Russell, Peter Norvig: Artificial Intelligence. A Modern Approach (Global Edition). Pearson (2021) (Chapter 6: Adversarial Search and Games)<br /> ** Lectures 5 and 6<br /> <br /> * Todd W. Neller, Marc Lanctot: An Introduction to Counterfactual Regret Minimization. Self-published. (2013)<br /> ** Lecture 9<br /> <br /> * Noam Nisan, Tim Roughgarden, Éva Tardos, Vijay Vazirani (eds.): Algorithmic Game Theory. Cambridge University Press (2007)<br /> ** Lecture 10<br /> <br /> * Michael R. Genesereth, Michael Thielscher: General Game Playing (Synthesis Lectures on Artificial Intelligence and Machine Learning) Morgan &amp; Claypool Publishers (2014)<br /> ** Lectures 5, 6, and 11<br /> <br /> * Bernhard von Stengel: Game Theory Basics. Cambridge University Press (2021)<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Noncooperative Games in Normal Form<br /> |Room=BEY/E39/U<br /> |Date=2026-04-13<br /> |DS=DS3<br /> |Download=AGT2026-01.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 1<br /> |Room=APB<br /> |Date=2026-04-16<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-01.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Normal-Form Games: Mixed Strategies<br /> |Room=BEY/E39/U<br /> |Date=2026-04-20<br /> |DS=DS3<br /> |Download=AGT2026-02.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Exercises 2<br /> |Room=APB<br /> |Date=2026-04-23<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-02.pdf<br /> }}</div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:AGT2026-Problems-02.pdf&diff=44322 2026-04-21T12:13:04Z

<p>Hannes Straß: </p> <hr /> <div></div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:AGT2026-02.pdf&diff=44313 2026-04-20T11:17:02Z

<p>Hannes Straß: Hannes Straß lud eine neue Version von Datei:AGT2026-02.pdf hoch</p> <hr /> <div></div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:AGT2026-02.pdf&diff=44312 2026-04-20T11:12:20Z

<p>Hannes Straß: Hannes Straß lud eine neue Version von Datei:AGT2026-02.pdf hoch</p> <hr /> <div></div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:AGT2026-02.pdf&diff=44306 2026-04-20T08:02:59Z

<p>Hannes Straß: Hannes Straß lud eine neue Version von Datei:AGT2026-02.pdf hoch</p> <hr /> <div></div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Algorithmic_Game_Theory_(SS2026)&diff=44304 2026-04-17T10:06:39Z

<p>Hannes Straß: </p> <hr /> <div>{{Vorlesung<br /> |Title=Algorithmic Game Theory<br /> |Research group=Computational Logic<br /> |Lecturers=Hannes Straß<br /> |Tutors=Sarah Alice Gaggl<br /> |Term=SS<br /> |Year=2026<br /> |Module=INF-B-510, INF-B-520, INF-PM-FOR<br /> |SWSLecture=2<br /> |SWSExercise=2<br /> |SWSPractical=0<br /> |Exam type=Klausur, mündliche Prüfung<br /> |Description=Game Theory is a multi-disciplinary and pervasive field that is concerned with how strategic decision making can be formally modelled and mathematically analysed.<br /> <br /> In this course, we will approach the subject from a computer science perspective and – in addition to covering the foundational aspects – also address how game theory can be approached computationally, e.g. consider how computers can be programmed to play games, or analyse the computational complexity of various game-theoretic notions.<br /> <br /> === Dates and times ===<br /> <br /> The lecture takes place as follows:<br /> <br /> * Mondays, DS3, [https://navigator.tu-dresden.de/etplan/bey/00/raum/111100.5500 BEY/E39/U]<br /> <br /> Exercise sessions are offered as follows:<br /> <br /> * Thursdays, DS2, APB/E007<br /> * Thursdays, DS4, APB/E001<br /> * Thursdays, DS5, APB/E006<br /> * Fridays, DS2, APB/E001<br /> <br /> Exercises start in the week of the first lecture, i.e. on 16th April.<br /> <br /> === Topics ===<br /> <br /> * Noncooperative games in normal form<br /> * Noncooperative games in extensive form<br /> * Search in game trees<br /> * Games with missing information<br /> * Evolutionary game theory<br /> * The Game Description Language and General Game Playing<br /> * Cooperative Games<br /> <br /> === Exam ===<br /> <br /> For CMS/Erasmus students and students wishing to use this course for modules INF-B-510 or INF-B-520, there will be a written exam (90min). The exam will be closed book, i.e. without notes, and no other resources (in particular technical aids) are permitted.<br /> <br /> For anyone else (INF-VERT-2/6, INF-BAS-2/6, INF-PM-FOR, IST) the exam will be oral. To obtain an exam slot, please contact [mailto:cl@tu-dresden.de the CL group's secretary].<br /> |Literature=* Jörg Rothe (Ed.): Economics and Computation. An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division. Springer-Verlag Berlin Heidelberg (2016) (Part I: Playing Successfully)<br /> ** Lectures 1, 2, 6, 7, 12, and 13<br /> <br /> * Richard Alan Gillman, David Housman: Game Theory. A Modeling Approach. CRC Press (2019)<br /> ** Lectures 1, 2, 4, and 10<br /> <br /> * Stuart J. Russell, Peter Norvig: Artificial Intelligence. A Modern Approach (Global Edition). Pearson (2021) (Chapter 6: Adversarial Search and Games)<br /> ** Lectures 5 and 6<br /> <br /> * Todd W. Neller, Marc Lanctot: An Introduction to Counterfactual Regret Minimization. Self-published. (2013)<br /> ** Lecture 9<br /> <br /> * Noam Nisan, Tim Roughgarden, Éva Tardos, Vijay Vazirani (eds.): Algorithmic Game Theory. Cambridge University Press (2007)<br /> ** Lecture 10<br /> <br /> * Michael R. Genesereth, Michael Thielscher: General Game Playing (Synthesis Lectures on Artificial Intelligence and Machine Learning) Morgan &amp; Claypool Publishers (2014)<br /> ** Lectures 5, 6, and 11<br /> <br /> * Bernhard von Stengel: Game Theory Basics. Cambridge University Press (2021)<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Noncooperative Games in Normal Form<br /> |Room=BEY/E39/U<br /> |Date=2026-04-13<br /> |DS=DS3<br /> |Download=AGT2026-01.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 1<br /> |Room=APB<br /> |Date=2026-04-16<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-01.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Normal-Form Games: Mixed Strategies<br /> |Room=BEY/E39/U<br /> |Date=2026-04-20<br /> |DS=DS3<br /> |Download=AGT2026-02.pdf<br /> }}</div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:AGT2026-02.pdf&diff=44303 2026-04-17T10:06:31Z

<p>Hannes Straß: </p> <hr /> <div></div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Algorithmic_Game_Theory_(SS2026)&diff=44280 2026-04-14T08:14:12Z

<p>Hannes Straß: </p> <hr /> <div>{{Vorlesung<br /> |Title=Algorithmic Game Theory<br /> |Research group=Computational Logic<br /> |Lecturers=Hannes Straß<br /> |Tutors=Sarah Alice Gaggl<br /> |Term=SS<br /> |Year=2026<br /> |Module=INF-B-510, INF-B-520, INF-PM-FOR<br /> |SWSLecture=2<br /> |SWSExercise=2<br /> |SWSPractical=0<br /> |Exam type=Klausur, mündliche Prüfung<br /> |Description=Game Theory is a multi-disciplinary and pervasive field that is concerned with how strategic decision making can be formally modelled and mathematically analysed.<br /> <br /> In this course, we will approach the subject from a computer science perspective and – in addition to covering the foundational aspects – also address how game theory can be approached computationally, e.g. consider how computers can be programmed to play games, or analyse the computational complexity of various game-theoretic notions.<br /> <br /> === Dates and times ===<br /> <br /> The lecture takes place as follows:<br /> <br /> * Mondays, DS3, [https://navigator.tu-dresden.de/etplan/bey/00/raum/111100.5500 BEY/E39/U]<br /> <br /> Exercise sessions are offered as follows:<br /> <br /> * Thursdays, DS2, APB/E007<br /> * Thursdays, DS4, APB/E001<br /> * Thursdays, DS5, APB/E006<br /> * Fridays, DS2, APB/E001<br /> <br /> Exercises start in the week of the first lecture, i.e. on 16th April.<br /> <br /> === Topics ===<br /> <br /> * Noncooperative games in normal form<br /> * Noncooperative games in extensive form<br /> * Search in game trees<br /> * Games with missing information<br /> * Evolutionary game theory<br /> * The Game Description Language and General Game Playing<br /> * Cooperative Games<br /> <br /> === Exam ===<br /> <br /> For CMS/Erasmus students and students wishing to use this course for modules INF-B-510 or INF-B-520, there will be a written exam (90min). The exam will be closed book, i.e. without notes, and no other resources (in particular technical aids) are permitted.<br /> <br /> For anyone else (INF-VERT-2/6, INF-BAS-2/6, INF-PM-FOR, IST) the exam will be oral. To obtain an exam slot, please contact [mailto:cl@tu-dresden.de the CL group's secretary].<br /> |Literature=* Jörg Rothe (Ed.): Economics and Computation. An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division. Springer-Verlag Berlin Heidelberg (2016) (Part I: Playing Successfully)<br /> ** Lectures 1, 2, 6, 7, 12, and 13<br /> <br /> * Richard Alan Gillman, David Housman: Game Theory. A Modeling Approach. CRC Press (2019)<br /> ** Lectures 1, 2, 4, and 10<br /> <br /> * Stuart J. Russell, Peter Norvig: Artificial Intelligence. A Modern Approach (Global Edition). Pearson (2021) (Chapter 6: Adversarial Search and Games)<br /> ** Lectures 5 and 6<br /> <br /> * Todd W. Neller, Marc Lanctot: An Introduction to Counterfactual Regret Minimization. Self-published. (2013)<br /> ** Lecture 9<br /> <br /> * Noam Nisan, Tim Roughgarden, Éva Tardos, Vijay Vazirani (eds.): Algorithmic Game Theory. Cambridge University Press (2007)<br /> ** Lecture 10<br /> <br /> * Michael R. Genesereth, Michael Thielscher: General Game Playing (Synthesis Lectures on Artificial Intelligence and Machine Learning) Morgan &amp; Claypool Publishers (2014)<br /> ** Lectures 5, 6, and 11<br /> <br /> * Bernhard von Stengel: Game Theory Basics. Cambridge University Press (2021)<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Noncooperative Games in Normal Form<br /> |Room=BEY/E39/U<br /> |Date=2026-04-13<br /> |DS=DS3<br /> |Download=AGT2026-01.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 1<br /> |Room=APB<br /> |Date=2026-04-16<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-01.pdf<br /> }}</div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:AGT2026-Problems-01.pdf&diff=44279 2026-04-14T08:13:53Z

<p>Hannes Straß: </p> <hr /> <div></div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Algorithmic_Game_Theory_(SS2026)&diff=44274 2026-04-13T13:21:53Z

<p>Hannes Straß: </p> <hr /> <div>{{Vorlesung<br /> |Title=Algorithmic Game Theory<br /> |Research group=Computational Logic<br /> |Lecturers=Hannes Straß<br /> |Tutors=Sarah Alice Gaggl<br /> |Term=SS<br /> |Year=2026<br /> |Module=INF-B-510, INF-B-520, INF-PM-FOR<br /> |SWSLecture=2<br /> |SWSExercise=2<br /> |SWSPractical=0<br /> |Exam type=Klausur, mündliche Prüfung<br /> |Description=Game Theory is a multi-disciplinary and pervasive field that is concerned with how strategic decision making can be formally modelled and mathematically analysed.<br /> <br /> In this course, we will approach the subject from a computer science perspective and – in addition to covering the foundational aspects – also address how game theory can be approached computationally, e.g. consider how computers can be programmed to play games, or analyse the computational complexity of various game-theoretic notions.<br /> <br /> === Dates and times ===<br /> <br /> The lecture takes place as follows:<br /> <br /> * Mondays, DS3, [https://navigator.tu-dresden.de/etplan/bey/00/raum/111100.5500 BEY/E39/U]<br /> <br /> Exercise sessions are offered as follows:<br /> <br /> * Thursdays, DS2, APB/E007<br /> * Thursdays, DS4, APB/E001<br /> * Thursdays, DS5, APB/E006<br /> * Fridays, DS2, APB/E001<br /> <br /> Exercises start in the week of the first lecture, i.e. on 16th April.<br /> <br /> === Topics ===<br /> <br /> * Noncooperative games in normal form<br /> * Noncooperative games in extensive form<br /> * Search in game trees<br /> * Games with missing information<br /> * Evolutionary game theory<br /> * The Game Description Language and General Game Playing<br /> * Cooperative Games<br /> <br /> === Exam ===<br /> <br /> For CMS/Erasmus students and students wishing to use this course for modules INF-B-510 or INF-B-520, there will be a written exam (90min). The exam will be closed book, i.e. without notes, and no other resources (in particular technical aids) are permitted.<br /> <br /> For anyone else (INF-VERT-2/6, INF-BAS-2/6, INF-PM-FOR, IST) the exam will be oral. To obtain an exam slot, please contact [mailto:cl@tu-dresden.de the CL group's secretary].<br /> |Literature=* Jörg Rothe (Ed.): Economics and Computation. An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division. Springer-Verlag Berlin Heidelberg (2016) (Part I: Playing Successfully)<br /> ** Lectures 1, 2, 6, 7, 12, and 13<br /> <br /> * Richard Alan Gillman, David Housman: Game Theory. A Modeling Approach. CRC Press (2019)<br /> ** Lectures 1, 2, 4, and 10<br /> <br /> * Stuart J. Russell, Peter Norvig: Artificial Intelligence. A Modern Approach (Global Edition). Pearson (2021) (Chapter 6: Adversarial Search and Games)<br /> ** Lectures 5 and 6<br /> <br /> * Todd W. Neller, Marc Lanctot: An Introduction to Counterfactual Regret Minimization. Self-published. (2013)<br /> ** Lecture 9<br /> <br /> * Noam Nisan, Tim Roughgarden, Éva Tardos, Vijay Vazirani (eds.): Algorithmic Game Theory. Cambridge University Press (2007)<br /> ** Lecture 10<br /> <br /> * Michael R. Genesereth, Michael Thielscher: General Game Playing (Synthesis Lectures on Artificial Intelligence and Machine Learning) Morgan &amp; Claypool Publishers (2014)<br /> ** Lectures 5, 6, and 11<br /> <br /> * Bernhard von Stengel: Game Theory Basics. Cambridge University Press (2021)<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Noncooperative Games in Normal Form<br /> |Room=BEY/E39/U<br /> |Date=2026-04-13<br /> |DS=DS3<br /> |Download=AGT2026-01.pdf<br /> }}</div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:AGT2026-01.pdf&diff=44273 2026-04-13T13:21:48Z

<p>Hannes Straß: </p> <hr /> <div></div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3450&diff=44215 2026-03-20T13:12:54Z

<p>Hannes Straß: </p> <hr /> <div>{{Publikation Erster Autor<br /> |ErsterAutorVorname=Piotr<br /> |ErsterAutorNachname=Gorczyca<br /> |FurtherAuthors=Hannes Straß<br /> }}<br /> {{Inproceedings<br /> |Referiert=1<br /> |Title=Non-Monotonic S4F Standpoint Logic<br /> |To appear=0<br /> |Year=2026<br /> |Month=Januar<br /> |Booktitle=Proceedings of the 40th Annual AAAI Conference on Artificial Intelligence (AAAI-26)<br /> |Pages=19126–19134<br /> |Volume=40 (23)<br /> }}<br /> {{Publikation Details<br /> |Abstract=Standpoint logics offer unified modal logic-based formalisms for representing multiple heterogeneous viewpoints. At the same time, many non-monotonic reasoning frameworks can be naturally captured using modal logics — in particular using the modal logic S4F.<br /> In this work, we propose a novel formalism called S4F Standpoint Logic, which generalises both S4F and propositional standpoint logic and is therefore capable of expressing multi-viewpoint, non-monotonic semantic commitments. We define its syntax and semantics and analyze its computational complexity, obtaining the result that S4F Standpoint Logic is not computationally harder than its constituent logics, whether in monotonic or non-monotonic form. We also outline mechanisms for credulous and sceptical acceptance and illustrate the framework with an example.<br /> |Download=Gorczyca-strass2025non-monotonic-s4f-standpoint-logic.pdf<br /> |Slides=Gorczyca-strass-aaai-2026.pdf<br /> |Link=https://doi.org/10.1609/aaai.v40i23.38986<br /> |DOI Name=10.1609/aaai.v40i23.38986<br /> |Projekt=KIMEDS<br /> |Forschungsgruppe=Computational Logic<br /> }}<br /> Access the live presentation at https://cl-tud.github.io/talks/2026/aaai/non-mon-s4f-standpoint-logic</div>

Hannes Straß