Efficient algorithms for hard problems on structured electorates

Efficient algorithms for hard problems on structured electorates

Research

InterestsPublicationsTalksWorkshops and SchoolsPhD ThesisMasters Thesis

Efficient algorithms for hard problems on structured electorates

This talk was a part of the Workshop on Parametric Complexity at NUS, which in turn was a part of a four-week program called “Aspects of Computation” held in celebration of the research work of Professor Rod Downey at NUS. The four-week full program focused on recent developments in parametric complexity theory, computability theory with applications in algebra, algorithmic randomness, model theory, etc. I spoke about exploiting structure in voting profiles to obtain efficient algorithms for problems that are computationally intractable in general.