I'm considering the computational hardness of winner determination under two well-known rules, i.e., the Monroe and Chamberlin-Courant rules. Skowron et al. have mentioned in Achieving fully proportional representation: Approximability results that:

Procaccia, Rosenschein and Zohar were the first to show the hardness of these two rules for the case of a particular approval-style dissatisfaction function. Their results were complemented by Lu and Boutilier who proved the hardness of the Chamberlin–Courant rule for the case of Borda satisfaction function.

Thus, I was wondering whether there is any reference on the hardness of computing Monroe rule for the case of Borda satisfaction function?


Your Answer

By clicking "Post Your Answer", you acknowledge that you have read our updated terms of service, privacy policy and cookie policy, and that your continued use of the website is subject to these policies.

Browse other questions tagged or ask your own question.