Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: In a committee election, a set of candidates has to be determined as winner of the election. Baumeister and Denniseni¾?[2] proposed to extend the minisum and minimax approach, initially defined for approval votes, to other forms of votes. They define minisum and minimax committee election rules for trichotomous votes, incomplete linear orders and complete linear orders, by choosing a winning committee that minimizes the dissatisfaction of the voters. Minisum election rules minimize the voter dissatisfaction by choosing a winning committee with minimum sum of the disagreement values for all individual votes, whereas in a minimax winning committee the maximum disagreement value for an individual vote is minimized. ,  investigate the computational complexity of winner determination in these voting rules.  show that winner determination is possible in polynomial time for all minisum rules  consider, whereas it is $$\mathrm{NP}$$-complete for three of the minimax rules. Furthermore,  study different forms of manipulation for these committee election rules.
['Dorothea Baumeister', 'Sophie Dennisen', 'Lisa A. Rocca Rey']
I am writing a research paper on a idea Winner Determination and Manipulation in Minisum and Minimax Committee Elections
[{"from": "human", "value": "I am writing a research paper on a idea Winner Determination and Manipulation in Minisum and Minimax Committee Elections"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: In a committee election, a set of candidates has to be determined as winner of the election. Baumeister and Denniseni\u00be?[2] proposed to extend the minisum and minimax approach, initially defined for approval votes, to other forms of votes. They define minisum and minimax committee election rules for trichotomous votes, incomplete linear orders and complete linear orders, by choosing a winning committee that minimizes the dissatisfaction of the voters. Minisum election rules minimize the voter dissatisfaction by choosing a winning committee with minimum sum of the disagreement values for all individual votes, whereas in a minimax winning committee the maximum disagreement value for an individual vote is minimized. ,  investigate the computational complexity of winner determination in these voting rules.  show that winner determination is possible in polynomial time for all minisum rules  consider, whereas it is $$\\mathrm{NP}$$-complete for three of the minimax rules. Furthermore,  study different forms of manipulation for these committee election rules."}]