The Faculty of Information Technology, Czech Technical University in Prague, offers 1 postdoc position as a part of the CTU Global Postdoc Fellowship. This new and attractive fellowship programme provides an opportunity for excellent researchers who have recently completed their PhD to continue their research careers at the CTU in Prague. Fellows receive a two-year fellowship and become members of a team led by a mentor.
The fellowship aims primarily at external international scientists who are currently conducting research abroad. Applicants must have completed their PhD within the last seven years (i.e. 2018 or later). The fellowship aims at authors/co-authors of three or more publications in a journal with IF or an A*/A conference.
Applicants are advised to contact mentors for more details on the position/topic.
The first topic of the project is the algorithmic game theory, which is a modern branch of classical game theory, focusing on algorithmic aspects of modelling the behaviour of participants (players) of certain competitive process (game). The motivation is the study of methods, how to control competitive environment with many players and without a central authority which may impose demands on players. It is possible to attain this goal by designing locally defined games, whose Nash equilibria correspond to globally desirable outcomes. This fact is captured by the low price of anarchy of the game. The goal of the project is to establish and publish new results in algorithmic game theory, mainly by designing games where the Nash equilibria correspond to globally desirable outcomes and by investigating their algorithmic and computational complexity aspects.
The second topic deals with the broad range of combinatorial games, mainly in the subfield of the various cops-and-robber settings. Here the setting is usually defined as a game on graph between two players controlling two sets of pawns, where the typical goal of one player is to capture the pawns of the second player. There is however great variability on the rules. Here the task is to study the computational complexity of questions like who wins or how many pawns are neede to win.
The project is theoretical, with the expected outcome in the form of publications in high-ranking conferences or prestigious journals.
Algorithmic game theory Combinatorial game theory MENTOR’S PAGE
The applicants are expected to have a strong background in combinatorics, graph theory, foundations of algorithmic game theory or combinatorial game theory. Additionally, specialization in the following areas is a bonus: graph algorithms, cops-and-robber-type problems, computational complexity or approximation algorithms. The applicant must have obtained a PhD in the relevant area no later than 7 years ago.
Start date: 1st July 2025
Salary: CZK 65,000 per month
Applications deadlines are 28th April 2025.
To apply for this programme, you need the following documents in English:
The application must reach CTU by the indicated deadline and should be sent to research@fit.cvut.cz by email or by post to:
Office of Science and Research
Faculty of Information Technology
CTU in Prague
Thákurova 9
160 00 Prague 6
Czech Republic
Applications will be assessed by a committee based on documents sent by applicants. The mentor has a strong vote in the selection process. An (online) interview will be organized.
Fellows are expected to start their job at CTU on the dates indicated for each research topic/position. Starting date may eventually be postponed by a reasonable period.
The person responsible for the content of this page: Bc. Veronika Dvořáková
