https://iccl.inf.tu-dresden.de/w/api.php?action=feedcontributions&feedformat=atom&user=Hannes+Stra%C3%9F 2026-07-22T23:45:22Z Benutzerbeiträge MediaWiki 1.43.1 https://iccl.inf.tu-dresden.de/w/index.php?title=Algorithmic_Game_Theory_(SS2026)&diff=44664 2026-07-20T15:03:45Z

<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 /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Games with Missing Information: Solving<br /> |Room=BEY/E39/U<br /> |Date=2026-06-08<br /> |DS=DS3<br /> |Download=AGT2026-08.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 7<br /> |Room=APB<br /> |Date=2026-06-11<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-07.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Counterfactual Regret Minimisation<br /> |Room=BEY/E39/U<br /> |Date=2026-06-15<br /> |DS=DS3<br /> |Download=AGT2026-09.pdf, AGT2026-09-Overlay.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 8<br /> |Room=APB<br /> |Date=2026-06-18<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-08.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Repeated Play<br /> |Room=BEY/E39/U<br /> |Date=2026-06-22<br /> |DS=DS3<br /> |Download=AGT2026-10.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 9<br /> |Room=https://tu-dresden.zoom-x.de/j/68405366449?pwd=IGD3zvoMA4E4ZQTm0VWBNVM94aQOIC.1<br /> |Date=2026-06-24<br /> |DS=DS2<br /> |Download=AGT2026-Problems-09.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Game Description Language<br /> |Room=BEY/E39/U<br /> |Date=2026-06-29<br /> |DS=DS3<br /> |Download=AGT2026-11.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 10<br /> |Room=APB<br /> |Date=2026-07-02<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-10.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Entfällt<br /> |Title=No lecture<br /> |Room=BEY/E39/U<br /> |Date=2026-07-06<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Entfällt<br /> |Title=No exercise sessions<br /> |Room=APB<br /> |Date=2026-07-09<br /> |DS=terminlos<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Cooperative Games: Definition and the Core<br /> |Room=BEY/E39/U<br /> |Date=2026-07-13<br /> |DS=DS3<br /> |Download=AGT2026-12.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 11<br /> |Room=APB<br /> |Date=2026-07-16<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-11.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Cooperative Games: Stable Sets and Shapley Value<br /> |Room=BEY/E39/U<br /> |Date=2026-07-20<br /> |DS=DS3<br /> |Download=AGT2026-13.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 12<br /> |Room=APB<br /> |Date=2026-07-23<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-12.pdf<br /> }}</div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:AGT2026-Problems-12.pdf&diff=44663 2026-07-20T15:03:37Z

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

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3472&diff=44662 2026-07-20T11:15:59Z

<p>Hannes Straß: </p> <hr /> <div>{{Publikation Erster Autor<br /> |ErsterAutorVorname=Hannes<br /> |ErsterAutorNachname=Straß<br /> |FurtherAuthors=Johannes P. Wallner<br /> }}<br /> {{Inproceedings<br /> |Referiert=1<br /> |Title=On the Complexity of Initial Models in Abstract Dialectical Frameworks<br /> |To appear=1<br /> |Year=2026<br /> |Booktitle=Proceedings of the Eleventh International Conference on Computational Models of Argument (COMMA)<br /> |Publisher=IOS Press<br /> |Editor=Katie Atkinson<br /> }}<br /> {{Publikation Details<br /> |Abstract=Abstract dialectical frameworks (ADFs) constitute one of the most general formal approaches within abstract argumentation. Recently, Bengel and Thimm (2025) proposed so-called initial models in ADFs as a suitable concept for “serializing” reasoning, i.e., decomposing reasoning in ADFs step by step. They showed several complexity results for reasoning with initial models. Our contributions in this paper are (i) that we close a gap in their complexity results of verifying initial models by showing DP-completeness, and (ii) based on our complexity results we provide an answer set programming (ASP) implementation to support systems utilizing initial models.<br /> |Download=COMMA26-9.pdf<br /> |Projekt=ScaDS.AI<br /> |Forschungsgruppe=Computational Logic<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Wissensrepräsentation und logisches Schließen<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Abstrakte Argumentation<br /> }}</div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3473&diff=44661 2026-07-20T11:15:19Z

<p>Hannes Straß: </p> <hr /> <div>{{Publikation Erster Autor<br /> |ErsterAutorVorname=Iosif<br /> |ErsterAutorNachname=Apostolakis<br /> |FurtherAuthors=Hannes Straß; Johannes P. Wallner<br /> }}<br /> {{Inproceedings<br /> |Referiert=1<br /> |Title=Assumption-Based Argumentation Through the Lens of Approximation Fixpoint Theory<br /> |To appear=1<br /> |Year=2026<br /> |Booktitle=Proceedings of the Eleventh International Conference on Computational Models of Argument (COMMA)<br /> |Publisher=IOS Press<br /> |Editor=Katie Atkinson<br /> }}<br /> {{Publikation Details<br /> |Abstract=Approximation fixpoint theory (AFT) was successfully employed as a uniform approach to define the semantics of major formalisms in abstract argumentation, such as argumentation frameworks and abstract dialectical frameworks. So far AFT was not directly applied for capturing formalisms in structured argumentation. We take up this opportunity and place flat assumption-based argumentation (ABA) in AFT.<br /> |Download=COMMA26-70.pdf<br /> |Projekt=ScaDS.AI<br /> |Forschungsgruppe=Computational Logic<br /> }}</div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3473&diff=44660 2026-07-20T11:14:35Z

<p>Hannes Straß: </p> <hr /> <div>{{Publikation Erster Autor<br /> |ErsterAutorVorname=Iosif<br /> |ErsterAutorNachname=Apopstolakis<br /> |FurtherAuthors=Hannes Straß; Johannes P. Wallner<br /> }}<br /> {{Inproceedings<br /> |Referiert=1<br /> |Title=Assumption-Based Argumentation Through the Lens of Approximation Fixpoint Theory<br /> |To appear=1<br /> |Year=2026<br /> |Booktitle=Proceedings of the Eleventh International Conference on Computational Models of Argument (COMMA)<br /> |Publisher=IOS Press<br /> |Editor=Katie Atkinson<br /> }}<br /> {{Publikation Details<br /> |Abstract=Approximation fixpoint theory (AFT) was successfully employed as a uniform approach to define the semantics of major formalisms in abstract argumentation, such as argumentation frameworks and abstract dialectical frameworks. So far AFT was not directly applied for capturing formalisms in structured argumentation. We take up this opportunity and place flat assumption-based argumentation (ABA) in AFT.<br /> |Download=COMMA26-70.pdf<br /> |Projekt=ScaDS.AI<br /> |Forschungsgruppe=Computational Logic<br /> }}</div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3473&diff=44655 2026-07-17T19:30:51Z

<p>Hannes Straß: Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Hannes |ErsterAutorNachname=Strass |FurtherAuthors=Johannes P. Wallner }} {{Inproceedings |Referiert=1 |Title=Assumption-Based Argumentation Through the Lens of Approximation Fixpoint Theory |To appear=1 |Year=2026 |Booktitle=Proceedings of the Eleventh International Conference on Computational Models of Argument (COMMA) |Publisher=IOS Press |Editor=Katie Atkinson }} {{Publikation Details |Abstract=Approximat…“</p> <hr /> <div>{{Publikation Erster Autor<br /> |ErsterAutorVorname=Hannes<br /> |ErsterAutorNachname=Strass<br /> |FurtherAuthors=Johannes P. Wallner<br /> }}<br /> {{Inproceedings<br /> |Referiert=1<br /> |Title=Assumption-Based Argumentation Through the Lens of Approximation Fixpoint Theory<br /> |To appear=1<br /> |Year=2026<br /> |Booktitle=Proceedings of the Eleventh International Conference on Computational Models of Argument (COMMA)<br /> |Publisher=IOS Press<br /> |Editor=Katie Atkinson<br /> }}<br /> {{Publikation Details<br /> |Abstract=Approximation fixpoint theory (AFT) was successfully employed as a uniform approach to define the semantics of major formalisms in abstract argumentation, such as argumentation frameworks and abstract dialectical frameworks. So far AFT was not directly applied for capturing formalisms in structured argumentation. We take up this opportunity and place flat assumption-based argumentation (ABA) in AFT.<br /> |Download=COMMA26-70.pdf<br /> |Projekt=ScaDS.AI<br /> |Forschungsgruppe=Computational Logic<br /> }}</div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:COMMA26-70.pdf&diff=44654 2026-07-17T19:29:46Z

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

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3472&diff=44652 2026-07-17T19:28:22Z

<p>Hannes Straß: Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Hannes |ErsterAutorNachname=Strass |FurtherAuthors=Johannes P. Wallner }} {{Inproceedings |Referiert=1 |Title=On the Complexity of Initial Models in Abstract Dialectical Frameworks |To appear=1 |Year=2026 |Booktitle=Proceedings of the Eleventh International Conference on Computational Models of Argument (COMMA) |Publisher=IOS Press |Editor=Katie Atkinson }} {{Publikation Details |Abstract=Abstract dialectical…“</p> <hr /> <div>{{Publikation Erster Autor<br /> |ErsterAutorVorname=Hannes<br /> |ErsterAutorNachname=Strass<br /> |FurtherAuthors=Johannes P. Wallner<br /> }}<br /> {{Inproceedings<br /> |Referiert=1<br /> |Title=On the Complexity of Initial Models in Abstract Dialectical Frameworks<br /> |To appear=1<br /> |Year=2026<br /> |Booktitle=Proceedings of the Eleventh International Conference on Computational Models of Argument (COMMA)<br /> |Publisher=IOS Press<br /> |Editor=Katie Atkinson<br /> }}<br /> {{Publikation Details<br /> |Abstract=Abstract dialectical frameworks (ADFs) constitute one of the most general formal approaches within abstract argumentation. Recently, Bengel and Thimm (2025) proposed so-called initial models in ADFs as a suitable concept for “serializing” reasoning, i.e., decomposing reasoning in ADFs step by step. They showed several complexity results for reasoning with initial models. Our contributions in this paper are (i) that we close a gap in their complexity results of verifying initial models by showing DP-completeness, and (ii) based on our complexity results we provide an answer set programming (ASP) implementation to support systems utilizing initial models.<br /> |Download=COMMA26-9.pdf<br /> |Projekt=ScaDS.AI<br /> |Forschungsgruppe=Computational Logic<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Wissensrepräsentation und logisches Schließen<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Abstrakte Argumentation<br /> }}</div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:COMMA26-9.pdf&diff=44651 2026-07-17T19:26:02Z

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

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Algorithmic_Game_Theory_(SS2026)&diff=44650 2026-07-17T15:22:26Z

<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 /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Games with Missing Information: Solving<br /> |Room=BEY/E39/U<br /> |Date=2026-06-08<br /> |DS=DS3<br /> |Download=AGT2026-08.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 7<br /> |Room=APB<br /> |Date=2026-06-11<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-07.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Counterfactual Regret Minimisation<br /> |Room=BEY/E39/U<br /> |Date=2026-06-15<br /> |DS=DS3<br /> |Download=AGT2026-09.pdf, AGT2026-09-Overlay.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 8<br /> |Room=APB<br /> |Date=2026-06-18<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-08.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Repeated Play<br /> |Room=BEY/E39/U<br /> |Date=2026-06-22<br /> |DS=DS3<br /> |Download=AGT2026-10.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 9<br /> |Room=https://tu-dresden.zoom-x.de/j/68405366449?pwd=IGD3zvoMA4E4ZQTm0VWBNVM94aQOIC.1<br /> |Date=2026-06-24<br /> |DS=DS2<br /> |Download=AGT2026-Problems-09.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Game Description Language<br /> |Room=BEY/E39/U<br /> |Date=2026-06-29<br /> |DS=DS3<br /> |Download=AGT2026-11.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 10<br /> |Room=APB<br /> |Date=2026-07-02<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-10.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Entfällt<br /> |Title=No lecture<br /> |Room=BEY/E39/U<br /> |Date=2026-07-06<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Entfällt<br /> |Title=No exercise sessions<br /> |Room=APB<br /> |Date=2026-07-09<br /> |DS=terminlos<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Cooperative Games: Definition and the Core<br /> |Room=BEY/E39/U<br /> |Date=2026-07-13<br /> |DS=DS3<br /> |Download=AGT2026-12.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 11<br /> |Room=APB<br /> |Date=2026-07-16<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-11.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Cooperative Games: Stable Sets and Shapley Value<br /> |Room=BEY/E39/U<br /> |Date=2026-07-20<br /> |DS=DS3<br /> |Download=AGT2026-13.pdf<br /> }}</div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:AGT2026-13.pdf&diff=44649 2026-07-17T15:22:21Z

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

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

<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 /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Games with Missing Information: Solving<br /> |Room=BEY/E39/U<br /> |Date=2026-06-08<br /> |DS=DS3<br /> |Download=AGT2026-08.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 7<br /> |Room=APB<br /> |Date=2026-06-11<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-07.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Counterfactual Regret Minimisation<br /> |Room=BEY/E39/U<br /> |Date=2026-06-15<br /> |DS=DS3<br /> |Download=AGT2026-09.pdf, AGT2026-09-Overlay.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 8<br /> |Room=APB<br /> |Date=2026-06-18<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-08.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Repeated Play<br /> |Room=BEY/E39/U<br /> |Date=2026-06-22<br /> |DS=DS3<br /> |Download=AGT2026-10.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 9<br /> |Room=https://tu-dresden.zoom-x.de/j/68405366449?pwd=IGD3zvoMA4E4ZQTm0VWBNVM94aQOIC.1<br /> |Date=2026-06-24<br /> |DS=DS2<br /> |Download=AGT2026-Problems-09.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Game Description Language<br /> |Room=BEY/E39/U<br /> |Date=2026-06-29<br /> |DS=DS3<br /> |Download=AGT2026-11.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 10<br /> |Room=APB<br /> |Date=2026-07-02<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-10.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Entfällt<br /> |Title=No lecture<br /> |Room=BEY/E39/U<br /> |Date=2026-07-06<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Entfällt<br /> |Title=No exercise sessions<br /> |Room=APB<br /> |Date=2026-07-09<br /> |DS=terminlos<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Cooperative Games: Definition and the Core<br /> |Room=BEY/E39/U<br /> |Date=2026-07-13<br /> |DS=DS3<br /> |Download=AGT2026-12.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 11<br /> |Room=APB<br /> |Date=2026-07-16<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-11.pdf<br /> }}</div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:AGT2026-Problems-11.pdf&diff=44637 2026-07-13T13:13: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=44632 2026-07-13T07:54: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, 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 /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Games with Missing Information: Solving<br /> |Room=BEY/E39/U<br /> |Date=2026-06-08<br /> |DS=DS3<br /> |Download=AGT2026-08.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 7<br /> |Room=APB<br /> |Date=2026-06-11<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-07.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Counterfactual Regret Minimisation<br /> |Room=BEY/E39/U<br /> |Date=2026-06-15<br /> |DS=DS3<br /> |Download=AGT2026-09.pdf, AGT2026-09-Overlay.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 8<br /> |Room=APB<br /> |Date=2026-06-18<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-08.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Repeated Play<br /> |Room=BEY/E39/U<br /> |Date=2026-06-22<br /> |DS=DS3<br /> |Download=AGT2026-10.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 9<br /> |Room=https://tu-dresden.zoom-x.de/j/68405366449?pwd=IGD3zvoMA4E4ZQTm0VWBNVM94aQOIC.1<br /> |Date=2026-06-24<br /> |DS=DS2<br /> |Download=AGT2026-Problems-09.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Game Description Language<br /> |Room=BEY/E39/U<br /> |Date=2026-06-29<br /> |DS=DS3<br /> |Download=AGT2026-11.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 10<br /> |Room=APB<br /> |Date=2026-07-02<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-10.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Entfällt<br /> |Title=No lecture<br /> |Room=BEY/E39/U<br /> |Date=2026-07-06<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Entfällt<br /> |Title=No exercise sessions<br /> |Room=APB<br /> |Date=2026-07-09<br /> |DS=terminlos<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Cooperative Games: Definition and the Core<br /> |Room=BEY/E39/U<br /> |Date=2026-07-13<br /> |DS=DS3<br /> |Download=AGT2026-12.pdf<br /> }}</div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:AGT2026-12.pdf&diff=44631 2026-07-13T07:53:50Z

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

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Algorithmic_Game_Theory_(SS2026)&diff=44565 2026-06-29T18:47:37Z

<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 /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Games with Missing Information: Solving<br /> |Room=BEY/E39/U<br /> |Date=2026-06-08<br /> |DS=DS3<br /> |Download=AGT2026-08.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 7<br /> |Room=APB<br /> |Date=2026-06-11<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-07.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Counterfactual Regret Minimisation<br /> |Room=BEY/E39/U<br /> |Date=2026-06-15<br /> |DS=DS3<br /> |Download=AGT2026-09.pdf, AGT2026-09-Overlay.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 8<br /> |Room=APB<br /> |Date=2026-06-18<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-08.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Repeated Play<br /> |Room=BEY/E39/U<br /> |Date=2026-06-22<br /> |DS=DS3<br /> |Download=AGT2026-10.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 9<br /> |Room=https://tu-dresden.zoom-x.de/j/68405366449?pwd=IGD3zvoMA4E4ZQTm0VWBNVM94aQOIC.1<br /> |Date=2026-06-24<br /> |DS=DS2<br /> |Download=AGT2026-Problems-09.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Game Description Language<br /> |Room=BEY/E39/U<br /> |Date=2026-06-29<br /> |DS=DS3<br /> |Download=AGT2026-11.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 10<br /> |Room=APB<br /> |Date=2026-07-02<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-10.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Entfällt<br /> |Title=No lecture<br /> |Room=BEY/E39/U<br /> |Date=2026-07-06<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Entfällt<br /> |Title=No exercise sessions<br /> |Room=APB<br /> |Date=2026-07-09<br /> |DS=terminlos<br /> }}</div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:AGT2026-Problems-10.pdf&diff=44564 2026-06-29T18:46:46Z

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

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:AGT2026-11.pdf&diff=44560 2026-06-29T08:39:56Z

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

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Algorithmic_Game_Theory_(SS2026)&diff=44555 2026-06-25T14:23:40Z

<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 /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Games with Missing Information: Solving<br /> |Room=BEY/E39/U<br /> |Date=2026-06-08<br /> |DS=DS3<br /> |Download=AGT2026-08.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 7<br /> |Room=APB<br /> |Date=2026-06-11<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-07.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Counterfactual Regret Minimisation<br /> |Room=BEY/E39/U<br /> |Date=2026-06-15<br /> |DS=DS3<br /> |Download=AGT2026-09.pdf, AGT2026-09-Overlay.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 8<br /> |Room=APB<br /> |Date=2026-06-18<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-08.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Repeated Play<br /> |Room=BEY/E39/U<br /> |Date=2026-06-22<br /> |DS=DS3<br /> |Download=AGT2026-10.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 9<br /> |Room=https://tu-dresden.zoom-x.de/j/68405366449?pwd=IGD3zvoMA4E4ZQTm0VWBNVM94aQOIC.1<br /> |Date=2026-06-24<br /> |DS=DS2<br /> |Download=AGT2026-Problems-09.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Game Description Language<br /> |Room=BEY/E39/U<br /> |Date=2026-06-29<br /> |DS=DS3<br /> |Download=AGT2026-11.pdf<br /> }}</div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:AGT2026-11.pdf&diff=44554 2026-06-25T14:23:30Z

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

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Algorithmic_Game_Theory_(SS2026)&diff=44544 2026-06-23T10:33:54Z

<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 /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Games with Missing Information: Solving<br /> |Room=BEY/E39/U<br /> |Date=2026-06-08<br /> |DS=DS3<br /> |Download=AGT2026-08.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 7<br /> |Room=APB<br /> |Date=2026-06-11<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-07.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Counterfactual Regret Minimisation<br /> |Room=BEY/E39/U<br /> |Date=2026-06-15<br /> |DS=DS3<br /> |Download=AGT2026-09.pdf, AGT2026-09-Overlay.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 8<br /> |Room=APB<br /> |Date=2026-06-18<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-08.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Repeated Play<br /> |Room=BEY/E39/U<br /> |Date=2026-06-22<br /> |DS=DS3<br /> |Download=AGT2026-10.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 9<br /> |Room=https://tu-dresden.zoom-x.de/j/68405366449?pwd=IGD3zvoMA4E4ZQTm0VWBNVM94aQOIC.1<br /> |Date=2026-06-24<br /> |DS=DS2<br /> |Download=AGT2026-Problems-09.pdf<br /> }}</div>

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

<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 /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Games with Missing Information: Solving<br /> |Room=BEY/E39/U<br /> |Date=2026-06-08<br /> |DS=DS3<br /> |Download=AGT2026-08.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 7<br /> |Room=APB<br /> |Date=2026-06-11<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-07.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Counterfactual Regret Minimisation<br /> |Room=BEY/E39/U<br /> |Date=2026-06-15<br /> |DS=DS3<br /> |Download=AGT2026-09.pdf, AGT2026-09-Overlay.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 8<br /> |Room=APB<br /> |Date=2026-06-18<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-08.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Repeated Play<br /> |Room=BEY/E39/U<br /> |Date=2026-06-22<br /> |DS=DS3<br /> |Download=AGT2026-10.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 9<br /> |Room=virtual<br /> |Date=2026-06-24<br /> |DS=DS2<br /> |Download=AGT2026-Problems-09.pdf<br /> }}</div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:AGT2026-Problems-09.pdf&diff=44542 2026-06-22T11:49: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=44533 2026-06-22T08:09: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-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 /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Games with Missing Information: Solving<br /> |Room=BEY/E39/U<br /> |Date=2026-06-08<br /> |DS=DS3<br /> |Download=AGT2026-08.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 7<br /> |Room=APB<br /> |Date=2026-06-11<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-07.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Counterfactual Regret Minimisation<br /> |Room=BEY/E39/U<br /> |Date=2026-06-15<br /> |DS=DS3<br /> |Download=AGT2026-09.pdf, AGT2026-09-Overlay.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 8<br /> |Room=APB<br /> |Date=2026-06-18<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-08.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Repeated Play<br /> |Room=BEY/E39/U<br /> |Date=2026-06-22<br /> |DS=DS3<br /> |Download=AGT2026-10.pdf<br /> }}</div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:AGT2026-10.pdf&diff=44532 2026-06-22T08:09:00Z

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

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Algorithmic_Game_Theory_(SS2026)&diff=44494 2026-06-15T11:53:04Z

<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 /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Games with Missing Information: Solving<br /> |Room=BEY/E39/U<br /> |Date=2026-06-08<br /> |DS=DS3<br /> |Download=AGT2026-08.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 7<br /> |Room=APB<br /> |Date=2026-06-11<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-07.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Counterfactual Regret Minimisation<br /> |Room=BEY/E39/U<br /> |Date=2026-06-15<br /> |DS=DS3<br /> |Download=AGT2026-09.pdf, AGT2026-09-Overlay.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 8<br /> |Room=APB<br /> |Date=2026-06-18<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-08.pdf<br /> }}</div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:AGT2026-Problems-08.pdf&diff=44493 2026-06-15T11:52:56Z

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

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Algorithmic_Game_Theory_(SS2026)&diff=44492 2026-06-15T11:41:46Z

<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 /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Games with Missing Information: Solving<br /> |Room=BEY/E39/U<br /> |Date=2026-06-08<br /> |DS=DS3<br /> |Download=AGT2026-08.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 7<br /> |Room=APB<br /> |Date=2026-06-11<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-07.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Counterfactual Regret Minimisation<br /> |Room=BEY/E39/U<br /> |Date=2026-06-15<br /> |DS=DS3<br /> |Download=AGT2026-09.pdf, AGT2026-09-Overlay.pdf<br /> }}</div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:AGT2026-09-Overlay.pdf&diff=44491 2026-06-15T11:41:42Z

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

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:AGT2026-09.pdf&diff=44490 2026-06-15T11:41:07Z

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

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Algorithmic_Game_Theory_(SS2026)&diff=44487 2026-06-12T08:00: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, 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 /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Games with Missing Information: Solving<br /> |Room=BEY/E39/U<br /> |Date=2026-06-08<br /> |DS=DS3<br /> |Download=AGT2026-08.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 7<br /> |Room=APB<br /> |Date=2026-06-11<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-07.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Counterfactual Regret Minimisation<br /> |Room=BEY/E39/U<br /> |Date=2026-06-15<br /> |DS=DS3<br /> |Download=AGT2026-09.pdf<br /> }}</div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:AGT2026-09.pdf&diff=44486 2026-06-12T08:00:03Z

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

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Algorithmic_Game_Theory_(SS2026)&diff=44473 2026-06-09T06:35:55Z

<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 /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Games with Missing Information: Solving<br /> |Room=BEY/E39/U<br /> |Date=2026-06-08<br /> |DS=DS3<br /> |Download=AGT2026-08.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 7<br /> |Room=APB<br /> |Date=2026-06-11<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-07.pdf<br /> }}</div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:AGT2026-Problems-07.pdf&diff=44472 2026-06-09T06:35:40Z

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

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:AGT2026-08.pdf&diff=44471 2026-06-08T08:50:37Z

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

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Algorithmic_Game_Theory_(SS2026)&diff=44466 2026-06-05T07:34: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, 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 /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Games with Missing Information: Solving<br /> |Room=BEY/E39/U<br /> |Date=2026-06-08<br /> |DS=DS3<br /> |Download=AGT2026-08.pdf<br /> }}</div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:AGT2026-08.pdf&diff=44465 2026-06-05T07:33:09Z

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

Hannes Straß 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ß