Available Theses Topics

If you are interested in a particular topic listed here for a Bachelor or Master thesis, please contact the corresponding person from the table below.

If you are interested in writing a thesis on another (non-listed) topic within the scope of our group or you want to participate in guided research or an interdisciplinary project, write an email to Mete Ahunbay. Please state your skills and interests and also attach a current CV and a recent grade report. First contact should be established at least one month before registration of the project in order to allow for sufficient time to settle for a suitable topic.

Title
Focus
Contact
Optimization and Market Design (BSc or MSc thesis) Various topics Prof. Martin Bichler
Computational Social Choice and Algorithmic Game Theory Various topics (having passed "Computational Social Choice", "Algorithmic Game Theory", "Markets Algorithms Incentives and Networks" or "Economics & Computation" is required) Prof. Felix Brandt
Simulations and analysis in shared-economy markets

The sharing economy depends on the development of the sharing platform. Different platforms (e.g., ride-hailing, freight exchange, kidney exchange, resource allocation, ... ) have different characteristics. We are committed to abstracting mathematical models from reality to simulate, analyze and provide theory. Research issues include but are not limited to matching strategies, pricing issues, and online prediction.

Requirements: advanced programming skills (e.g., Python, Matlab, at least one), mathematics, operation research.

Donghao Zhu
Electricity Market Design Optimization

Electricity Market Design: Electricity market design is dynamic in its nature and has recently been exposed to fundamental changes due to the integration of renewable energy resources. We examine sustainable market designs and the underlying allocation and pricing problems as part of the Kopernikus SynErgie project

Pricing in non-convex markets: Although nonconvex markets (such as electricity markets) are widespread, finding appropriate prices is not trivial. We study different pricing approaches and associated properties.

Requirements: programming skills, operations research

Johannes Knörr
Interdependencies in Mutli-Agent Reinforcement Learning Systems

Recent advances in Multi-Agent Reinforcement Learning, such as OpenAI-Five or AlphaStar, demonstrated that high-performing policies can be learned through complex algorithms. However, interpreting resulting policies in terms of cooperative or competitive behavior is an open problem. Study existing and novel interdependency measures ([1], [2]) and use these to tackle problems such as directing communication or exploration in complex environments ([3]). 

Requirements: Python, Basic knowledge in RL, Machine Learning

Fabian Pieroth
Equilibrium computation in finite partial information games

Recent advances in algorithmic game theory enabled the computation of approximated Bayesian Nash equilibria in complex settings (e.g., auctions). However, developments in this direction are still at the beginning. Therefore, we want to explore local learning methods, e.g., policy gradient, in partial information sequential games (e.g., Goofspiel, or Hanabi) for equilibrium computation.

Requirements: Python, Game Theory, Basic knowledge in RL, Machine Learning

Fabian Pieroth
Algorithms for Computing Nash Equilibria

While the computation Nash Equilibria in matrix games is a PPAD-complete problem, there are several algorithms that compute exact Equilibria for such games.  There are several possibilities for a thesis in this area: a literature review on existing algorithms, or an implementation of a particular algorithm applied to some specific games. Depending on the chosen topic, both bachelor and master theses would be possible.

Requirements: experience in algorithms, mathematics, (depending on the project:) good programming skills in the language of your choice

Maximilian Fichtl