Collective schedules : How to find a consensus schedule ?
Speaker(s) : Martin Durand (LIP6)
Summary: Given a profile of v schedules representing the preferences of voters on n tasks, we want to find a consensus schedule that aggregates the preferences of the voters. The preference aggregation problem has been widely studied when the candidates that the voters rank are similar. However, in our context, tasks may have different lengths and could therefore be treated differently. We study two classic preference aggregation rules and extend them to fit in our context, we then study their axiomatic and computational properties.
bruno.escoffier (at) nulllip6.fr