Algorithms and Complexity
This project will be co-supervised with Eduard Eiben.
We will study a topic arising from Algorithmic Game Theory and/or Computational Social Choice. The specific topic/area will be defined during an inital meeting with Eduard and myself. Some examples of such topics are (this list is by no means exhaustive):
– Computation of Nash Equilibria;
– Fair Division of Resources;
– Computation of socially beneficial outcomes , .
We will explain to you the basics of Game Theory and Social Choice and help you to understand the solution concepts we will study. Depending on the outcome of the project, we can submit our findings to a conference related to Algorithmic Game Theory, Artificial Intelligence, or Theoretical Computer Science. This project is algorithms/math-oriented, but it is possible to include some programming experiments.
If you have any questions, feel free to ask us!