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 … full description “Algorithmic Game Theory and Computational Social Choice (completed)”
Supervisor: Argyrios Deligkas
Machine Learning for Crystal Structure Prediction (completed)
Crystal Structure Prediction (CSP) is one of the major problems in computational chemistry with numerous applications in real life. This is essentially the (global) minimisation of a continuous, high-dimensional, complicated function. Many heuristic methods have been proposed for CSP and recently new methods based on Machine Learning were introduced. The goal of this project is … full description “Machine Learning for Crystal Structure Prediction (completed)”
Mixed Nash Equilibria in Net Coordination Games (completed)
Net Coordination Games form a special class of many-player games with several applications in Theoretical Computer Sciene, Multi Agent Systems, and Semi Supervised Learning. Nash equilibria correspond to the stable outcomes and they are the prominent solution concept in games. It is known that Net Coordination Games possess a pure Nash equilibrium, but unfortunately, it … full description “Mixed Nash Equilibria in Net Coordination Games (completed)”