Variant: Ties Allowed
The original problem is to find the probability that the first candidate is always strictly ahead in the vote count. Consider now the problem to find the probability that the second candidate is never ahead (i.e. ties are allowed); the solution is
- .
The variant problem can be solved by the reflection method in a similar way to the original problem. First note that the number of possible vote sequences is . Call a sequence "bad" if the second candidate is ever ahead, and if the number of bad sequences can be enumerated then the number of "good" sequences can be found by subtraction and the probability can be computed.
Represent a voting sequence as a lattice path on the Cartesian plane as follows:
- Start the path at (0, 0)
- Each time a vote for the first candidate is received move right 1 unit.
- Each time a vote for the second candidate is received move up 1 unit.
Each such path corresponds to a unique sequence of votes and will end at (p, q). A sequence is 'good' exactly when the corresponding path never goes above the diagonal line y = x; equivalently, a sequence is 'bad' exactly when the corresponding path touches the line y = x + 1.
For each 'bad' path P, define a new path P′ by reflecting the part of P up to the first point it touches the line across it. P′ is a path from (−1, 1) to (p, q). The same operation applied again restores the original P. This produces a one-to-one correspondence between the 'bad' paths and the paths from (−1, 1) to (p, q). The number of these paths is and so that is the number of 'bad' sequences. This leaves the number of 'good' sequences as
Since there are altogether, the probability of a sequence being good is .
In fact, the solutions to the original problem and the variant problem are easily related. For candidate A to be strictly ahead throughout the vote count, they must receive the first vote and for the remaining votes (ignoring the first) they must be either strictly ahead or tied throughout the count. Hence the solution to the original problem is
as required.
Read more about this topic: Bertrand's Ballot Theorem
Famous quotes containing the words ties and/or allowed:
“But, though light-headed man forget,
Remembering Matter pays her debt:
Still, through her motes and masses, draw
Electric thrills and ties of Law,
Which bind the strengths of Nature wild
To the conscience of the child.”
—Ralph Waldo Emerson (1803–1882)
“We’ve forgotten what it’s like not to be able to reach the light switch. We’ve forgotten a lot of the monsters that seemed to live in our room at night. Nevertheless, those memories are still there, somewhere inside us, and can sometimes be brought to the surface by events, sights, sounds, or smells. Children, though, can never have grown-up feelings until they’ve been allowed to do the growing.”
—Fred Rogers (20th century)