Universiteit van Amsterdam

Please note that this newsitem has been archived, and may contain outdated information or links.

Structural and Algorithmic Aspects of Preference-based Problems in Social Choice, Vienna University of Technology

Deadline: Friday 31 July 2020

In Computational Social Choice (COMSOC), we explore the computational and algorithmic aspects of problems arising from social choice and decision making such as how to aggregate individual preferences or judgments to reach a consensus, how to fairly allocate a set of resources to some agents, how to assign schools or colleges to students based on their preferences, or how to recommend potential interesting products such as movies to a user based on her and others' past and current preferences.

The primary goal of this project is to develop new efficient algorithms for practically relevant COMSOC problems and to gain new insights into how to "deconstruct" the hardness of these problems. To achieve our goal, we will investigate the computational complexity of COMSOC problems through the lens of Parameterized Algorithmics (PA), which has become an important research technique for designing exact and efficient algorithms primarily for graph problems.

Please note that this newsitem has been archived, and may contain outdated information or links.