Learn / Library / Expected value
When a router should spread
A router can use venues paying , , and ticks. Policy A always uses the first. Policy B routes , , and of its flow to them, in order. A policy is scored by its expected ticks plus times its entropy in bits. At what do the policies tie? Give a fraction.
Checking an answer needs JavaScript. The hint and the solution open without it.
Hint
Policy A has zero entropy.
Solution
- Policy B expects ticks.
- Its entropy is .
- The tie needs , so .
Answer: