# doc. RNDr. Dušan Knop, Ph.D.

- +420224359879 +420224359879
- dusan.knop@fit.cvut.cz
- TH:A-1237

- Profile
- Publications
- Projects
- Teaching
- Theses

### Dissertation theses

### Complexity of problems in social choice and network processes

Numerous topics in (computational) social choice are nowadays important parts of various systems in our day to day life. These include, e.g., recommender systems, or distribution of goods stored in food banks. Now, as the use of these crucial tools grows so does the need for efficient computation of solutions to these problems. The main (suggested) toolbox used to pursue this task is the framework of parameterized (or, multivariate) complexity that is becoming more and more popular in the past decades. The practical need for the computation also yields the possibility to a more applied research using, e.g., ILP or SAT solvers. The biggest challenges in the area include problems which are complete for “higher classes” of classical complexity (i.e., possibly above NP); e.g., the Judgement Aggregation problem.