If you are interested in a particular topic for a Bachelor or Master thesis, please either contact the corresponding person from the list 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 Stefan Waldherr. 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 | |
| Computational Social Choice and Algorithmic Game Theory | various topics (having attended one of the courses "Computational Social Choice" or "Algorithmic Game Theory" or seminars "Multiagent Systems" or "Economics & Computation" is recommended) | |
| Efficient simulation of load flexibility auctions for the smart grid | Our preliminary simulation system is to be extended by efficient processing of publicly available real-world data for energy demand and supply for load balancing in the smart grid. Challenges include processing of the large amounts of available data (e.g., balancing power prices, wind generation) as well as extension to various pricing schemes (e.g., core-pricing, k-pricing). required: advanced programming skills (python); helpful: auction theory, OR/Plebis |
Dr. Paul Karänke |
| Stable Matching with Bundle Preferences (MSc,BSc) | We consider a generalization of the stable matching problem where students have preferences over bundles of courses, while the course organizer have preferences or priorities over the single students. We want to anlyze, implement and simulate existing mechanisms for this problem (required: PLEBIS, discrete maths; for MSc: Auction Theory) | Sören Merting |
| OR, Matching | Various topics (required: Plebis,discrete maths) | Sören Merting |
| Dynamic and online Mechanisms | Analysis and implementation of appropriate dynamic and online mechanism to solve an online display ad setting. Here, bidders bid on items in multiple, sequentially performed, second price auctions. Also, bidders are limited by budget constraints. | Paul Sutterer |
| Combinatorial Exchanges for load balancing in the smart grid | We want to analyze an exchange markets in which participants aim to either consume or produce energy (thus either want to buy or sell energy in the market) in order to ensure continuous load balancing of supply and demand in the smart grid. We aim at extending the work on single-sided auctions in order to design and analyze these combinatorial exchanges. (required: plebis / auction theory, discrete maths) | Dr. Stefan Waldherr |
| Combinatorial Markets | Various Topics, either theoretical or applied | Dr. Stefan Waldherr |
| OR, Scheduling | Various topics (required: Plebis/OR, good understanding of discrete maths and combinatorial optimization) | Dr. Stefan Waldherr |
Templates and Information for Creating Thesises:
General Information for Theses