How Does Ivanhoe Stay Ahead in the Pirate Captain Vote?

  • Thread starter Thread starter humanino
  • Start date Start date
  • Tags Tags
    Discussion
AI Thread Summary
Ivanhoe and Isaac, both pirates, are competing for the captaincy through a voting process where Ivanhoe receives P votes and Isaac receives Q votes, with P being greater than Q. The discussion revolves around determining the probability that Ivanhoe leads throughout the entire voting process. It is noted that if all P votes for Ivanhoe are cast first, he remains ahead, while if the first vote is for Isaac, he does not. The conversation highlights that the problem is recognized as the "Ballot problem," which has established solutions, including geometric proofs and methods like Andre's reflection principle. A link to further resources on the Ballot problem is also provided for those interested in a deeper understanding.
humanino
Messages
2,523
Reaction score
8
Ivanhoe and Isaac became pirates a long time ago. Both of them run for the position of captain. Everybody slips his envelop in the box one after the other. Ivanhoe receives P votes, and Isaac receives Q votes. Assuming P>Q, what is the probability for Ivanhoe to lead during the entire voting process ?

If for instance the P votes for him have all been slipped first, he was clearly ahead the whole time. If the very first pirate voted for Isaac, then Ivanhoe was not ahead at this point.
 
Physics news on Phys.org
Partial results.
If q = 0, then the probability is 1
If q = 1, then the probability is (p - 1) / (p + 1) because Ivanhoe must receive the first two votes, and after that it doesn't matter when the 1 vote for Isaac occurs. The probability of Ivanhoe receiving the first two votes is:
(p / p + q) (p - 1)/(p + q - 1)
and since q = 1, this is
(p - 1) / (p + 1)
 
Hi,

your partial results are not only correct, but also very close to the general form of the solution :approve:
 
I don't know if anybody is interested in the solution. I did it the hard way, and once I had found the solution I realized there must be a simpler explanation. After browsing the web I finally found that indeed the problem is well known as the "Ballot problem" and even has generalized versions. There is a geometrical proof, direct solution using so-called "Andre's reflection principle", and more.

This is not a spoiler, this is more than a spoiler. The following link contains it, pretty much all :
The Ballot Problem
 
Similar to the 2024 thread, here I start the 2025 thread. As always it is getting increasingly difficult to predict, so I will make a list based on other article predictions. You can also leave your prediction here. Here are the predictions of 2024 that did not make it: Peter Shor, David Deutsch and all the rest of the quantum computing community (various sources) Pablo Jarrillo Herrero, Allan McDonald and Rafi Bistritzer for magic angle in twisted graphene (various sources) Christoph...
Thread 'My experience as a hostage'
I believe it was the summer of 2001 that I made a trip to Peru for my work. I was a private contractor doing automation engineering and programming for various companies, including Frito Lay. Frito had purchased a snack food plant near Lima, Peru, and sent me down to oversee the upgrades to the systems and the startup. Peru was still suffering the ills of a recent civil war and I knew it was dicey, but the money was too good to pass up. It was a long trip to Lima; about 14 hours of airtime...
Back
Top