Theses Topics
If you are interested in a particular topic for a Bachelor or Master thesis, please contact us via e-mail.
| Title | Focus | Contact |
|---|---|---|
| Optimization and Market Design (BSc or MSc thesis) |
various topics | |
| Computational Social Choice and Algorithmic Game Theory | various topics (having attended "Computational Social Choice", "Algorithmic Game Theory", "Multiagent Systems", or "Economics & Computation" is recommended) | |
| Experimental analysis of bidder behavior | We analyse human subjetcs' behavior in experiments concerning split award auctions. | Stefan Mayer |
Steuerung virtualisierter Rechenzentren (IDP, SEP, Guided Research, BSc, MSc thesis) |
We explore the operational efficiency of dynamic and static control methods for virtualized data centers hosting enterprise applications in a real world data center infrastructure. In this project several topics for thesis projects are currently available. Students interested in cloud computing research with a background in software engineering, statistics or data mining are invited to contribute to this project. | |
| Automated Horizontal Web Application Scaling in PaaS Environments | Most of the Cloud Computing PaaS platforms built for web applications and especially open source implementations of those can not scale applications automatically. Most of them support the horizontal scalability but lack the ability to adjust the number of application instances dynamically and automatically to the application load. The topic of the proposed thesis is to implement such a feature into the open source PaaS implementation TwoSpot and evaluate it using virtual machines of an IaaS cloud provider. | Andreas Wolke |
| Combinatorial Auctions with bounded communication | A main challenge of combinatorial auctions is to elicit agents valuations which lead to efficient allocation of resources.The huge communicational burden to provably achieve efficient allocations prevents the execution of such auctions in the field.In this work we will explore auctions with bounded communication and derive worst efficiency bounds as well as average performance. Highly motivated students of any discipline with a background in maths (discrete/linear optimization, probabilitiy theory) and elementary programming skills are welcome. | Ioannis Petrakis |
| Vehicle Routing | Objective of this thesis is the conception and implementation of heuristics to solve the Vehicle Routing Problem, which is an important extension of the Traveling Salesman Problem. Highly motivated students with a strong background in algorithms and Java are welcome. Students can form a team and work together. | Ioannis Petrakis |