#### IMSc Webinar

#### Well-Structured Committees

#### Sushmita Gupta

##### IMSc

*Webinar; Join at
https://zoom.us/j/99291584554?pwd=bW02L001RzlrS1E4SERtc2pRYlNEQT09
.
In the standard model of committee selection we are given a set of ordinal votes over a set of candidates and a desired committee size, and the goal is to select a committee that relates to the given votes. Motivated by possible interactions and dependencies between candidates, we study a generalization of committee selection in which the candidates are connected via a network and the task is to select a committee that also satisfies certain properties with respect to this candidate network. To accommodate few possibilities of taking voter preferences into account, we consider several well-known voting rules; and to model different aspects of interactions and dependencies between candidates, we consider two graph properties (namely, independence and connectivity). In this talk we will discuss the parameterized complexity of the corresponding combinatorial problems and discuss some implications of our algorithmic results.*

Done