Robustness radius for Chamberlin-Courant on restricted domains

DOI10.1007/978-3-030-10801-4_27zbMath1446.91041OpenAlexW2908682086MaRDI QIDQ2206242

Chinmay Sonar, Neeldhara Misra

Publication date: 22 October 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-10801-4_27

zbMATH Keywords

NP-hardnesssingle-crossingrobustness radiussingle-peakedChamberlin-Courant

Mathematics Subject Classification ID

Voting theory (91B12) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (3)

The radius of robust feasibility of uncertain mathematical programs: a survey and recent developments ⋮ Robustness among multiwinner voting rules ⋮ Robustness of approval-based multiwinner voting rules

This page was built for publication: Robustness radius for Chamberlin-Courant on restricted domains