Seminar on Markets, Algorithms, Incentives, and Networks WS25/26
Supervision: Alexander Schlenga, and Prof. Felix Brandt
Content
In recent years, there has been an increasing interest in topics at the intersection of economics and computer science, as witnessed by the continued rapid rise of research areas such as algorithmic game theory and computational social choice. This development is due to the emergence of computational networks such as the Internet as well as the need to get a grip on algorithmic questions in economics. In this seminar, we will deal with both the theoretical foundations as well as their computational properties and possible applications.
The seminar will mostly be based on the books Economics and Computation by David C. Parkes and Sven Seuken, which will be available for download (guest key will be published during the overview meeting) for participants of the seminar, and the Handbook of Computational Social Choice, which is freely available as PDF at Cambridge University Press.
The target audience for this seminar are master students and bachelor students after the 2nd semester.
Registration
Visit our overview meeting and tell us that you are interested. More information on the application process is provided in this meeting. In general, students from computer science additionally have to use the matching system for the registration.
Time and venue
| MAIN Seminar | Speaker | Date and Time | Room | Slides |
|---|---|---|---|---|
| Overview Meeting (Vorbesprechung) | Alexander/Chris | July, 9th at 14:00 | 01.10.033 | |
| First Meeting (Kickoff) | Alexander/… | October, tba | 01.10.033 | |
| Session 1 | January, tba | 01.10.033 | ||
| Session 2 | January, tba | 01.10.033 | ||
| Session 3 | January/February, tba | 01.10.033 |
Overview meeting
We will present the contents of the seminar and explain the application procedure. Please note that we do not rank you in the matching tool if you do not adhere to this procedure.
Language
The language for talks and meetings is English.
Prerequisites
Participants should be interested in modelling and analyzing interesting problems with mathematical rigor.
Requirements to Pass
-
Attending the talks and active participation in the discussions
-
Giving a talk (30 to 45 min) in English
-
Deliver a handout for your fellow students one week before the talk
-
Read the handouts of your fellow students and send your questions/comments two days before the respective talk
Module Codes
- IN2107 (Seminar in Master of Science Informatics)
- IN0014 (Seminar in B.Sc. Informatics and B.Sc. Information Systems)
- For all other programs: Please check first whether this seminar fits in your curriculum
Other Resources
Further Literature (available online)
- Felix Brandt, Vincent Conitzer, Ulle Endriss, Jerome Lang, and Ariel D. Procaccia, editors, Handboook of Computational Social Choice (Cambridge University Press, 2016)
- Noam Nisan, Tim Roughgarden, Eva Tardos, and Vijay Vazirani: Algorithmic Game Theory (Cambridge University Press, 2007)
- Tuomas Sandholm: Distributed Rational Decision Making, in Gerhard Weiss: Multiagent Systems (MIT Press, 1999)
- Yoav Shoham, Kevin Leyton-Brown: Multiagent Systems (Cambridge University Press, 2009)
Contact
Alexander Schlenga
Room 01.10.036 (Boltzmannstraße/Garching)
Email: alexander.schlenga(at)tum.de