Answer to Question #102343 in Statistics and Probability for user

Question

You wish to answer a decision problem (i.e. the answer is Yes or No) by consulting some experts. There are n experts, and the ith expert has probability pi > 0.5 of being correct for your question. You will ask a subset of experts and take their majority vote. For example, if there are three experts with probabilities 0.9 each, then asking all of them and taking the majority vote is better than asking just one of them. If the probabilities are 0.9, 0.6 and 0.6, then asking only the first expert is better than asking all three of them.
Your goal is to ensure that the error probability is at most ε and thus you want to find an odd number k such that asking the top k experts will ensure this error probability.
One way to find k is to exactly compute the error probability for each k, but for a com- putationally efficient (linear-time) solution, describe an algorithm using the Chernoff bound to find such k

Answer 1

Dear user, your question requires a lot of work, which neither of our experts is ready to perform for free. We advise you to convert it to a fully qualified order and we will try to help you. Please click the link below to proceed: Submit order