no code implementations • 28 May 2019 • Palash Dey, Neeldhara Misra, Swaprava Nath, Garima Shakya
We study the parameterized complexity of the optimal defense and optimal attack problems in voting.
no code implementations • 24 Feb 2019 • Palash Dey, Swaprava Nath, Garima Shakya
We further explore the effect of assuming that the {\em outlier} preferences/alternatives to be random (instead of arbitrary) on the sample complexity of the testing problem.
