Voting for multiple winners just got harder - NP-hard computational challenge!
The article explores how different voting rules that use approval ballots to elect multiple winners have computational challenges. The researchers found that computing the winner for one of the rules is NP-hard, which is a difficult problem to solve. They also discovered that none of the rules are completely fair, even with simple preferences. Additionally, it is hard for individuals or groups to figure out the best way to vote based on how others have voted.