Misra, NeeldharaNeeldharaMisraSonar, ChinmayChinmaySonar2025-08-312025-08-312019-01-01[9783030108007]10.1007/978-3-030-10801-4_272-s2.0-85062348451https://d8.irins.org/handle/IITG2025/23388The notion of robustness in the context of committee elections was introduced by Bredereck et al. [SAGT 2018] [2] to capture the impact of small changes in the input preference orders, depending on the voting rules used. They show that for certain voting rules, such as Chamberlin-Courant, checking if an election instance is robust, even to the extent of a small constant, is computationally hard. More specifically, it is NP-hard to determine if one swap in any of the votes can change the set of winning committees with respect to the Chamberlin-Courant voting rule. Further, the problem is also W[1] -hard when parameterized by the size of the committee, k. We complement this result by suggesting an algorithm that is in XP with respect to k. We also show that on nearly-structured profiles, the problem of robustness remains NP-hard. We also address the case of approval ballots, where we show a hardness result analogous to the one established in [2] about rankings and again demonstrate an XP algorithm.falseChamberlin-Courant | NP-hardness | Robustness radius | Single-crossing | Single-peakedConference Paper16113349341-353201910cpBook Series5