josef andersson wrote:but if we add the condition that the votes that gives the most voters "right" wins , ie {J,L}, {D,H},{J,L}, {D,J} gives 3 voters "ok" {J,L}, {D,H},{J,L}
josef andersson wrote:"
10 people and 10 votes. First vote is {1,2} , second is {2,3} ........ 99th vote is {99,100} , and last vote is {100,1}. "
First sentence should be "100 people and 100 votes", right?
The tuples and votes in the second sentence says you mean 100 people to vote on to stay and leave {Pn,Pn} where n > 0 and < 101 , and 100 voters voting on these
Vote number x {Stay, Leave}
Vote 1 {J,L}
Vote 2 {D,H}
Vote 3 {J,L}
Vote 4 {D,J}
Myke Enriq wrote:In case of a reality show , I imagine that voting is done by phone or SMS , and that each vote costs some $.
Therefore the ideal voting algorithm should try to maximize the number of time people vote.
Myke Enriq wrote:The equal importance for a negative vote as for a positive one , gets us into situations mentioned above where you have a lot of votes bu still can not make a sound decision.
In fact , any method where a negative vote equals a constant * the value of a positive vote , will still lead to tie situations.
Myke Enriq wrote:A better approach could be one where you count the number of positive and negative votes for a person X , then you ponder that with the total number of votes for the person Y to decide between the 2.