I have a problem with Positive and Negative asnwers and I want to assign a score ranging from 0 to 1. I want I also want is to penalize the Negative answers. The more the worst. For example, the Case 1 has 5 Positive and 3 Negative answers. How can I calculate its score? Can someone suggest to me an algorithm to look for?
EDIT
As correctly Bill O'Haran mentioned in the comments, what I am looking for is a sort of scoring function that calculates a very bad score once negative answers occur and also take into consideration the amount of negative answers. Moreover, the function should not award with a high score the positive answers.
Summing up my proposition:
initialize the score as $s_0=\frac{1}{2}$
if a new positive answer (the $p$-th one) occurs, the adjusted score is $c_{k+1}(P) = c_{k}+\frac{1}{2^{p+1}}$
if a new negative answer (the $n$-th one) occurs, the adjusted score is $c_{k+1}(N) = \max (c_{k}-c, 0)$ where $c$ has been defined in advance.
This way, negative answers will yield a $0$ within at most $\lceil \frac{1}{c}\rceil$ occurences. Also, positive answers allow to get as close to a perfect score as possible but $1$ is not reachable.