Voting for multiple winners just got harder - NP-hard computational challenge!
The article explores how different voting rules that elect multiple winners using approval ballots have computational challenges. The researchers found that computing winners for proportional approval voting is NP-hard. They also discovered that none of the rules are strategyproof, meaning it's difficult for individuals or groups to determine the best way to vote based on others' ballots.