Past projects

Design and Complexity of Optimal Mechanisms

No Image Loaded

Funding: CTIT
Running Period: 2010-2014
Staff: Marc Uetz
Ph.D. student: Ruben Hoeksma  

ABSTRACT

In Mechanism Design the aim is to implement a social choice function by taking into account private information and incentives of individuals. The most well know example is the single item auction. Here, an optimal mechanism is an auction that maximizes the revenue of the seller, to give an example. In this project, we aim at the design and analysis of optimal mechanisms in settings other than auctions, for example scheduling and applications in the design of service systems. In particular, we aim at suitable models that allow us to analyze the computational complexity of optimal mechanism design problems.

This project has meanwhile been finished, and PhD student Ruben Hoeksma has defened his PhD thesis.