How do I weight votes based on number of possible voters? Scenario:
I have a book club that reads a book every month. My website allows the readers to give a 5 star rating to each book. We have 10 members and a rule that a member may only vote on a book they have read.
At the end of the year we read a book by the highest rated author.
The problem: If only one person votes for a book but the other 9 didn't finish the that one person determines the sole vote for that book.
Example:
Book - number of votes - Average Vote
Catcher in the Rye - 7 - 4.0
Catch 22 - 5 - 3.8
The Hunger Games - 1 - 5.0
In this example hunger games would win the year. But clearly Catcher in the Rye is more favored as most of the group just didn't bother to finish hunger games.
Desired Outcome
An ideal algorithm would weight the votes based on the number possible votes reducing the multiplier as the percentage of votes decreases.
votes < 3 - (33% of total available) Multiply average by .5
3 > votes < 7 - (66% of total available) Multiply average by .75
votes > 7 - Vote stands.
Is their a linear equation I can use to implement this type of weighting? or is there a more logical method of calculating the votes?
Note: I want to avoid making the average by the number of possible voters (add 0 for each non vote) as this would bottom out some of the longer books that people did not get the time to read. A gradual decrease that only considers the votes cast is much preferred.

You can assume some model for votes for a book, e.g. that is basically Gaussian with an unknown mean vote score $\mu$, and some global standard deviation that you calculate for example by computing the average standard deviation $\sigma$ over all books, where you take the average over all books that have more than 1 vote. Then your assumption, under a Gaussian model, is that each voter will assign a vote rating of $k$ with probability proportional to $e^{-(k-\mu)^2/2 \sigma^2}$ (scaled so that the sum of the probabilities of the 5 possible votes is 1). Then for each book, assume the votes are independent and optimize the joint probability of the votes to find the value of $\mu$ that maximizes the probability of the observed votes. Then if you have $n$ votes, the standard deviation of the estimated mean is $\sigma / \sqrt{n}$. So subtract two of these standard deviations from the estimated mean $\mu$ for the book to get an estimated $95\%$ confidence interval lower bound on what the true mean vote is for the book, and rank books according to their lower bounds. This will cause books with higher means but lower number of votes $n$ to be ranked below some books with lower means that have higher number of votes $n$, basically because you can "trust" the calculated value of the mean more as the value of $n$ increases.
