#include <adlib.h>Max Shinn's blog.
/
Sat, 02 Mar 2019 23:52:31 +0000Sat, 02 Mar 2019 23:52:31 +0000Jekyll v3.7.4Are buffets efficient?
<p>I recently attended an academic conference and was struck by the
inefficiency of the buffet-style dinner. The conference had
approximately 500 attendees, and dinner was scheduled for 6:30 PM
following a 15 minute break in the conference program. A 15 minute
break is not enough time to go back to the hotel room and take a nap,
and barely enough time to find a quiet corner and get some work done,
but it is a perfect amount of time to crowd around the buffet waiting
for dinner to open.</p>
<p>When dinner finally opened, all of the food was arranged on a single
table, inviting the attendees to form a single line to serve
themselves. As you can imagine, this line was quite long. I was
lucky enough to be one of the first people through the line, but by
the time I finished eating a half hour later, the line was still very
long. I had been waiting for someone who was towards the middle to
end of the line, and this person still had not made it through yet.</p>
<p>I found it odd that feeding people should be so slow. From my
experiences in undergraduate dining halls, it is possible to feed more
people in a shorter amount of time. A key difference between these
situations is that in undergraduate dining halls, food is often served
at individual stations, meaning you only need to wait in line for food
you want to eat. By contrast, in the catering style, it is often
served all at one table, with diners waiting in a single line and
accessing the dishes one by one. I wanted to examine the efficiency of
these two systems. This is important not only for minimizing the mean
wait time so that everyone gets their food faster, but also for
minimizing inequality between people at the front and end of the line.
This ensures that everyone has the opportunity to dine together.</p>
<h2 id="model">Model</h2>
<p>I modeled this situation as a single line in a buffet versus
individual lines for each different dish. I made the following
assumptions:</p>
<ul>
<li>Some people may be faster or slower at serving themselves.</li>
<li>Some foods can be served faster than other foods.</li>
<li>People may not want all of the food which is being served, and each
person wants a different random selection of foods.</li>
<li>Only one person can serve themself a particular dish at one time.</li>
<li>When dishes have their own individual lines, people look at the
lines for the foods they want to eat and stand in the shortest line
next.</li>
<li>People already know what the options are and where they are located.</li>
</ul>
<p>I calculated the wait time for each person in the simulation as the
total amount of time it took a person to pass through the buffet. I
then looked at the mean wait time for the group as well as the
inequality in wait time for people in the group, defined as the third
quartile minus the first quartile. Each simulation was run many times
to ensure accurate statistics.</p>
<h2 id="number-of-dishes-wanted">Number of dishes wanted</h2>
<p>Let us suppose that not everyone wants the same number of dishes, but
that all dishes are equally attractive. First we look at the case
when there are a limited number of dishes.</p>
<div>
<figure>
<center><img src="/res/buffet/wait-ineq-few-dishes.png" /></center>
<figcaption class="imagecaption"><p>100 people serving themselves in a buffet with 6 dishes</p>
</figcaption>
</figure>
</div>
<p>We see that when there aren’t very many dishes and most people want
all of them, it is faster to have a single line. This may be
counter-intuitive, but it is due to the fact that people do not
optimally distribute themselves, but instead choose the shortest line.
Suppose for example that one dish is much slower to serve than all of
the others. People who choose this food last will have to wait
approximately the same amount of time as they would have if there was
a single line and they ended up at the end, because this dish serves
as the bottleneck. However, the people who are at the front of this
line will still need to wait in more lines for the other dishes,
because other people tried to serve themselves these dishes first. As
a result, having multiple lines can sometimes increase the amount of
time for the fastest people and not decrease the amount of time for
the slowest people.</p>
<p>Additionally, there is a large inequality in wait times, i.e. some
people will get through the line quickly, while others will be stuck
in line for a long time. This is the case for both serving styles,
but is especially pronounced for the case with multiple lines.</p>
<p>Let us also examine the case when there are many dishes to choose
from.</p>
<div>
<figure>
<center><img src="/res/buffet/wait-ineq-many-dishes.png" /></center>
<figcaption class="imagecaption"><p>100 people serving themselves in a buffet with 20 dishes</p>
</figcaption>
</figure>
</div>
<p>When there are many dishes to choose from (here 20), no matter how
many dishes people may want (within reason), individual lines reduce
both the mean wait time and the inequality in wait times compared to a
single line. Intuitively, this is because people can distribute
themselves and they only have to wait for the dishes they want to eat.</p>
<p>Additionally, let’s look at the case when there are many people.</p>
<div>
<figure>
<center><img src="/res/buffet/wait-ineq-many-people.png" /></center>
<figcaption class="imagecaption"><p>500 people serving themselves in a buffet with 6 dishes</p>
</figcaption>
</figure>
</div>
<p>In this case, we see the counter-intuitive result again: the mean wait
time is quite a bit higher for individual lines when most people want
most of the foods, however inequality is still lower.</p>
<p>Finally, we can examine the case when there are very few people.</p>
<div>
<figure>
<center><img src="/res/buffet/wait-ineq-veryfew-people.png" /></center>
<figcaption class="imagecaption"><p>30 people serving themselves in a buffet with 6 dishes</p>
</figcaption>
</figure>
</div>
<p>In this case, separate lines are better for both mean wait time and
equality.</p>
<h2 id="fairness">Fairness</h2>
<p>A fair system is one in which the amount of time someone waits is
proportional to the number of dishes they want. In an unfair
scenario, someone who only wants one dish must wait for the same
amount of time as someone who wants all of the dishes.</p>
<p>Let’s look at whether this form of fairness holds. First, we look at
how long someone must wait depending on how many dishes they want.</p>
<div>
<figure>
<center><img src="/res/buffet/fairness.png" /></center>
<figcaption class="imagecaption"><p>Average wait time differs depending on how many dishes a person would like</p>
</figcaption>
</figure>
</div>
<p>As expected, when there is only one line, everyone must wait for
approximately the same amount of time, no matter how much food they
want to eat. People who want all of the dishes in a line must wait
for less time on average, but someone who only wants one dish must
wait for a very long time. By contrast, when there are multiple
lines, the amount of time people wait is proportional to the number of
dishes they want to try.</p>
<p>Similarly, it might be fairer that someone who can serve themself
quickly has a shorter waiting time than someone who is slower.</p>
<div>
<figure>
<center><img src="/res/buffet/speed-vs-time.png" /></center>
<figcaption class="imagecaption"><p>Points
represent people. There is no significant correlation (<span class="MathJax_Preview">p>.2</span><script type="math/tex">p>.2</script>)
between time spent waiting and serving speed</p>
</figcaption>
</figure>
</div>
<p>Unfortunately this does not seem to be the case in either system.
Rather, people who are slow to serve themselves take approximately the
same amount of time in line as those who are fast.</p>
<h2 id="summary-and-conclusions">Summary and conclusions</h2>
<p>In summary, when there are a lot of people present, if everyone wants
most of the food at the buffet, a single line counter-intuitively
reduces the mean wait time. However, this single line substantially
increases inequality in wait times, meaning that some people will have
to wait for a long time while others can go through immediately.
Additionally, people who only want a small amount of food must wait a
long time to serve themselves. A more fair but slightly less
efficient system is one where there is a separate station for each
dish, but this can be inefficient when most people want most of the
dishes available.</p>
<p>This analysis leaves out a few factors which are difficult to account
for. For example, it assumes the amount of time taken to walk from
one food to another is negligible, and that people know <em>a priori</em>
what food they would like to eat and where it is located. Both of
these have the potential to slow down serving times in the case with
separate lines. This analysis also doesn’t account for several other
factors which are important in real life. For example, it assumes
that space is not an issue. It also assumes there is enough seating
to accommodate everybody; if only a limited amount of seating is
available, a high inequality is desirable as it prevents everyone from
going to the dining area at one time.</p>
<p>One method which is often employed to speed up single lines is having
more than one identical line, or two sides on the same line, likewise,
in the case of separate lines, there are sometimes “stations” which
have identical dishes. In both cases, because we assume people balance
themselves by going to the shortest line, doubling the number of
copies of all dishes would be expected to approximately cut the mean
wait time in half.</p>
<h3>Code/Data:</h3>
<ul>
<li><a href="/res/buffet/buffet_model.py">Data analysis script</a></li>
</ul>
Sat, 02 Mar 2019 00:00:00 +0000
/2019/03/02/are-buffets-efficient.html
/2019/03/02/are-buffets-efficient.htmlmodelingfoodbuffetqueuing-theoryModelOptimality in card shuffling
<p>Many powerful minds have devoted countless decades to the academic
study of card games. However, relatively little attention has been
given to the best way to shuffle a deck of cards. There are several
different methods that people have developed to shuffle cards:</p>
<ul>
<li><a href="https://www.youtube.com/watch?v=O8W9ipOSmWA">The riffle shuffle</a>:
The classic shuffling method. Cut the deck approximately in half.
Take one half in each hand, and let the cards from both decks fall
on top of one another.</li>
<li><a href="https://www.youtube.com/watch?v=x5tLNHuvf6s">The overhand shuffle</a>:
Another very popular method. Hold the cards in one hand, and take
the cards with your other hand, and let them fall on top.</li>
<li><a href="https://www.youtube.com/watch?v=0ZXhPWkro9A">The Hindu shuffle</a>: A
method popular in India. It is a different style of performing an
overhand shuffle.</li>
<li><a href="https://youtu.be/pnULsmjX4VA?t=26">The pile shuffle</a>: Create
several sub-decks of cards, by placing cards one-by-one into a
(potentially random) sub-deck. Then, combine the sub-decks together.</li>
</ul>
<p><a href="http://www.ams.org/samplings/feature-column/fcarc-shuffle">It has been claimed</a>
that seven, eight, or more riffle shuffles are necessary to obtain
complete randomization. However, these studies assume that any
difference in probability between a shuffled deck and a fully random
permutation can be exploited by the players. This is an important
model for casinos where large amounts of money are at stake, but for
games between friends where perfect randomness is not needed, seven or
eight shuffles in between hands causes a substantial delay in the
game.</p>
<p>Thus, below I describe how many shuffles you need <em>in practice</em>
instead of <em>in theory</em>. My evaluation looks for patterns and
irregularities in hands that would be dealt. It accounts for three
types of patterns—suits, ranks, and clusters/straights—by looking
at the joint distribution of of these frequencies compared to a null
distribution. (For instance, a six card hand containing four of one
suit and two of another is highly unlikely.) I simulate a number of
different shuffling methods and find the probability of obtaining the
arrangements generated by these shuffles in a truly random deck.</p>
<p>Each of the shuffles starts with either fully ordered decks (i.e. a
new deck of cards), or else with cards in an order representative of a
specific card game. I compare these to a deck which started out fully
randomized before the shuffle as a control, which is therefore
guaranteed to be fully randomized after the shuffle. All shuffles
should be compared to the randomized deck, i.e. the red line in the
plots.</p>
<div>
<figure>
<center><img src="/res/shuffle/legend.png" /></center>
<figcaption class="imagecaption"><p>Card game deck patterns used in all figures which follow.</p>
</figcaption>
</figure>
</div>
<h2 id="riffle-shuffle">Riffle shuffle</h2>
<p>The riffle shuffle is arguably the most popular shuffling method. The
standard accepted mathematical model for the Riffle shuffle is called
the
<a href="https://en.wikipedia.org/wiki/Gilbert%E2%80%93Shannon%E2%80%93Reeds_model">Gilbert-Shannon-Reeds model</a>
(GSR model). (Yes, that’s
<a href="https://en.wikipedia.org/wiki/Claude_Shannon">Claude Shannon</a>.) This
model assumes that the shuffler is an expert and can dynamically
adjust the rate at which cards are laid down from each hand during the
shuffle. It states that the probability of putting down a card from
either hand is proportional to the relative size of the deck in that
hand. For example, if your left hand had 30 cards and your right hand
had 10, you would have a 3/4 probability of the next card coming from
your left hand.</p>
<p>Hesitant to accept this definition, I developed another model which
includes a skill parameter <span class="MathJax_Preview">\lambda</span><script type="math/tex">\lambda</script>. High <span class="MathJax_Preview">\lambda</span><script type="math/tex">\lambda</script> means that
there is a low probability of two consecutive cards being dealt from
the same hand, whereas low <span class="MathJax_Preview">\lambda</span><script type="math/tex">\lambda</script> means there will be large
bunches of cards from the same hand in the deck. This is motivated by
the fact that, given the speed at which cards are shuffled, most
people do not have the reaction time necessary to adjust the rate at
which they let cards fall from either hand, and also by the fact that
casino dealers come close to alternating cards from each hand.</p>
<p>In order to test these models, I collected data from my own shuffles
to determine the most likely model. I found that my model was
slightly more likely given the data, but if you account for the fact
that my model has a parameter whereas the GSR model has none, the GSR
model is a slightly better fit to the data.</p>
<p>Because they were close, I decided to test both cases, and also to
vary the skill level <span class="MathJax_Preview">\lambda</span><script type="math/tex">\lambda</script>. I tested four cases: a novice
shuffler (<span class="MathJax_Preview">\lambda=0.3</span><script type="math/tex">\lambda=0.3</script>), an average shuffler (<span class="MathJax_Preview">\lambda=0.45</span><script type="math/tex">\lambda=0.45</script>, the
best fit to my shuffling data), an expert shuffler (<span class="MathJax_Preview">\lambda=0.8</span><script type="math/tex">\lambda=0.8</script>),
and the ideal GSR case (which has no parameter).</p>
<div>
<figure>
<center><img src="/res/shuffle/riffle.png" /></center>
<figcaption class="imagecaption"><p>Effectiveness of riffle shuffles as a function of the number of consecutive shuffles.</p>
</figcaption>
</figure>
</div>
<p>As we can see, people comfortable with a riffle shuffle need
approximately <strong>4 shuffles</strong> in order to randomize the deck, which is
approximately
<a href="https://projecteuclid.org/download/pdf_1/euclid.aoap/1177005705">half of the theoretical recommendation</a>.
An average card player does not have any advantage over a professional
casino dealer in this regard. Of course, if you’re not riffle
shuffling very well, it will take far more shuffles to achieve the
same degree of randomness.</p>
<h2 id="overhandhindu-shuffle">Overhand/Hindu shuffle</h2>
<p>The overhand shuffle is equivalent to dividing the deck into a number
of sub-decks and then recombining those decks in reverse order. By
watching several YouTube videos of people performing the overhand
shuffle, there is a wide variety in the number of times people will
divide the deck when performing the shuffle. Most people do it around
5 times, but some people consistently do more or fewer than this.</p>
<p>Here, we consider the cases of 5 cuts, 3 cuts, and 8 cuts, as these
values covers the typical range of cuts.</p>
<div>
<figure>
<center><img src="/res/shuffle/overhand.png" /></center>
<figcaption class="imagecaption"><p>Effectiveness of overhand shuffles as a function of the number of consecutive shuffles.</p>
</figcaption>
</figure>
</div>
<p>It takes many more overhand shuffles to randomize the deck. Assuming
an average number of cuts, it takes approximately <strong>25 shuffles</strong>, which
is 20-60 times less than
<a href="https://www.math.upenn.edu/~pemantle/papers/overhand2.pdf">the theoretical result</a>.
When you only cut the deck 3 times during an overhand shuffle, this
number jumps to almost 40. Nevertheless, this goes against the
theoretical finding, and suggests that the overhand shuffle is a valid
and useful method, even if it is a bit more time consuming.</p>
<h2 id="pile-shuffle">Pile shuffle</h2>
<p>The pile shuffle has many variants. In the strict form, the shuffler
deals all of the cards into some number of piles, and then stacks the
cards on top of each other.</p>
<p>Clearly this strict form is both deterministic and highly patterned,
and thus it is rather ineffective. Sometimes, people will add a
slight bit of randomization by picking up the piles in a different
order than they laid them down. More frequently, people will perform
this deal by randomizing the order in which they lay down cards into
the decks. Sometimes they will do so while keeping the decks
approximately the same size, and sometimes they will disregard deck
size. (However, note that
<a href="http://blog.maxshinnpotential.com/2017/07/05/can-humans-generate-random-numbers.html">people are notoriously bad at randomizing</a>,
so these should be considered the maximum limits of randomization
rather than the method’s true amount of randomization.)</p>
<div>
<figure>
<center><img src="/res/shuffle/piles.png" /></center>
<figcaption class="imagecaption"><p>Effectiveness of pile shuffles as a function of the number of piles.</p>
</figcaption>
</figure>
</div>
<p>We see that pile shuffling is not very efficient when only performed
once. The reason appears to be that this method does not randomize
the ranks in the deck. If you started with an ordered deck, you can
be nearly certain that if you pick up a 3, the next card will not be
a 2. Most versions of pile shuffling are ineffective for this reason.
The only version which works is the version which keeps the decks at
an approximately similar size throughout the duration of the shuffle,
while using at least eight decks. However, this also assumes that the
shuffler is able to generate near-random numbers, which is impossible
without either a random number generator or knowledge of strategies
for generating random numbers without one.</p>
<h2 id="miscellaneous-results">Miscellaneous results</h2>
<p>I simulated two styles of deals from the shuffled deck: one where the
top 6 cards were taken from the deck, and one where there were 4
players, and 6 cards were dealt to each in a clockwise manner. Results
were nearly identical for both cases, so only results for the former
are included here.</p>
<p>I also simulated the mixed case which combines riffle shuffles and
that overhand shuffles, with the hypothesis that adding a few overhand
shuffles could reduce the number of riffle shuffles needed to
randomize the deck. Unfortunately, this turned out to not be the
case. Adding one or two overhand shuffles to different places in the
riffle shuffle sequence was not able to reduce the number of riffle
shuffles needed to randomize the deck.</p>
<p>If we assume that the riffle shuffle takes approximately 5 seconds to
perform and the overhand shuffle takes 2 seconds to perform, it takes
40 seconds to randomize the deck using the overhand shuffle but 20
seconds to randomize it using the riffle shuffle. If we assume that
four cards can be dealt per second and decks can be straightened and
stacked at a rate of one per subpile, a suitable pile shuffle would
take 21 seconds. However, this is also assuming suitable
randomization, and thus, cards may not be as randomized as in the
other methods.</p>
<p>There are other considerations in choosing the shuffling method as
well; for instance, the overhand shuffle is considered to be less
damaging to the cards than a riffle shuffle, which may bend the cards.</p>
<h2 id="summary">Summary</h2>
<p>From this analysis, we have learned the following:</p>
<ul>
<li>The riffle shuffle is highly efficient, requiring only 4 shuffles in
order to make a deck random for most practical purposes.</li>
<li>When using 5 deck cuts in the overhand shuffle, about 25 shuffles
are necessary to randomize the deck. While it takes longer to
perform, it is equally as effective as 4 riffle shuffles after 25
iterations.</li>
<li>10 or more riffle shuffles may be required if the shuffler lacks
experience.</li>
<li>The pile shuffle should generally be avoided, unless using eight or
more piles, distributing cards randomly, ensuring all piles are
approximately the same size, and ideally finding a way to circumvent
the limitations humans have in generating random numbers.</li>
<li>Combining overhand shuffles with riffle shuffles does not increase
randomization compared to just using riffle shuffles.</li>
</ul>
<h3>Code/Data:</h3>
<ul>
<li><a href="/res/shuffle/cards.py">Python library for performing these analyses</a></li>
<li><a href="/res/shuffle/make_figures.py">Python script to make the figures in this post</a></li>
<li><a href="/res/shuffle/analyze_riffle_data.py">Python script for riffle shuffle experiment</a></li>
<li><a href="/res/shuffle/riffle_data.txt">Data from riffle shuffle experiment</a></li>
</ul>
Sun, 05 Nov 2017 00:00:00 +0000
/2017/11/05/optimality-in-card-shuffling.html
/2017/11/05/optimality-in-card-shuffling.htmldatamodelingcardsgamerandomnessModelCan humans generate random numbers?
<p>It is widely known that humans cannot generate sequences of random
binary numbers
<a href="http://dx.doi.org/10.1037/h0032060">(e.g. see Wagenaar (1972))</a>. The
main problem is that we see true randomness as being “less random”
than it truly is.</p>
<p>A fun party trick (if you attend the right parties) is to have one
person generate a 10-15 digit random binary number by herself, and
another generate a random binary sequence using coin flips. You,
using your magical abilities, can identify which one was generated
with the coin.</p>
<p>The trick to distinguishing a human-generated sequence from a random
sequence is by <em>finding the number of times the sequence switches
between runs of <code class="highlighter-rouge">0</code>s and <code class="highlighter-rouge">1</code>s</em>. For instance, <code class="highlighter-rouge">0011</code> switches once, but
<code class="highlighter-rouge">0101</code> switches three times. A truly random sequence will have a switch
probability of 50%. A human generated sequence will be greater
than 50%. To demonstrate this, I have generated two sequences
below, one by myself and one with a random number generator:</p>
<div class="highlighter-rouge"><div class="highlight"><pre class="highlight"><code>(A) 11101001011010100010
(B) 11111011001001011000
</code></pre></div></div>
<p>For the examples above, sequence (A) switches 13 times, and sequence
(B) switches 9 times. As you can guess, sequence (A) was mine, and
sequence (B) was a random number generator.</p>
<p>However, when there is a need to generate random numbers, is it
possible for humans to use some type of procedure to quickly generate
random numbers? For simplicity, let us assume that the switch
probability is the only bias that people have when generating random
numbers.</p>
<h2 id="can-we-compensate-manually">Can we compensate manually?</h2>
<p>If we know that the switch probability is abnormal, it is possible
(but much more difficult than you might expect) to generate a sequence
which takes this into account. If you have time to sit and consider
the binary sequence you have generated, this can work. It is
especially effective for short sequences, but is not efficient for
longer sequences. Consider the following longer sequence, which I
generated myself.</p>
<div class="highlighter-rouge"><div class="highlight"><pre class="highlight"><code>1101100011011010100
1101010111101011000
0101011110101001011
0100110101011110100
1010010101010111111
</code></pre></div></div>
<p>This sequence is 100 digits long, and switches 62 times. A simple
algorithm which will equalize the number of switches is to replace
digits at the beginning of the string with zero until the desired
number of switches has been obtained. For example:</p>
<div class="highlighter-rouge"><div class="highlight"><pre class="highlight"><code>0000000000000000000
0001010111101011000
0101011110101001011
0100110101011110100
1010010101010111111
</code></pre></div></div>
<p>But intuitively, this “feels” much less random. Why might that be?
In a truly random string, not only will the switch probability be
approximately 50%, but the <em>switch probability of switching</em> will be
approximately 50%, which we will call “2nd order switching”. What
exactly is 2nd order switching? Consider the truly random string:</p>
<div class="highlighter-rouge"><div class="highlight"><pre class="highlight"><code>01000011011100010000
</code></pre></div></div>
<p>Now, let’s generate a new binary sequence, where a <code class="highlighter-rouge">0</code> means that a
switch did not happen at a particular location, and a <code class="highlighter-rouge">1</code> means a
switch did happen at that location. This resulting sequence will be
one digit shorter than the initial sequence. Doing this to the above
sequence, we obtain</p>
<div class="highlighter-rouge"><div class="highlight"><pre class="highlight"><code>1100010110010011000
</code></pre></div></div>
<p>For reference, notice that the sum of these digits is equal to the
total number of switches. We define the 2nd order switches as the
number of switches in this sequence of switches.</p>
<p>We can generalize this to <span class="MathJax_Preview">n</span><script type="math/tex">n</script>‘th order switches by taking the sum of
the sequence once we have recursively found the sequence of switches
<span class="MathJax_Preview">n</span><script type="math/tex">n</script> times. So the number of 1st order switches is equal to the
number of switches in the sequence, the 2nd order is the number of
switches in the switch sequence, the number of 3rd order switches is
equal to the number of switches in the switch sequence of the switch
sequence, and so on.</p>
<p>Incredibly, in an infinitely-long truly random sequence, <em>the
percentage of <span class="MathJax_Preview">n</span><script type="math/tex">n</script>‘th order switches will always be 50%, for all
<span class="MathJax_Preview">n</span><script type="math/tex">n</script></em>. In other words, no matter how many times we find the
sequence of switches, we will always have about 50% of the digits be
<code class="highlighter-rouge">1</code>.</p>
<p>Returning to our naive algorithm, we can see why this does not mimic a
random sequence. The number of 2nd order switches is only 24%. In a
truly random sequence, it would be close to 50%.</p>
<h2 id="is-there-a-better-algorithm">Is there a better algorithm?</h2>
<p>So what if we make a smarter algorithm? In particular, what if our
algorithm is based on the very concept of switch probability? If we
find the sequence of <span class="MathJax_Preview">n</span><script type="math/tex">n</script>‘th order switches, can we get a random
sequence?</p>
<p>It would take a very long time to do this by hand, so I have written
some code to do it for me. In particular, this code specifies a
switch probability, and generates a sequence of arbitrary length based
on this (1st order) switch probability. Then, it will also find the
<span class="MathJax_Preview">n</span><script type="math/tex">n</script>‘th order switch probability.</p>
<p>As a first measure, we can check if high order switch probabilities
eventually become approximately 50%. Below, we plot across the switch
probability the average of the <span class="MathJax_Preview">n</span><script type="math/tex">n</script>‘th order difference, which is
very easy to calculate for powers of 2 (see Technical Notes).</p>
<div>
<figure>
<center><img src="/res/randombinary/nthdiffmeans-2powers.png" /></center>
<figcaption class="imagecaption"><p>As we
increase the precision by powers of two, we get sequences that have
<span class="MathJax_Preview">n</span><script type="math/tex">n</script>‘th switch probabilities increasingly close to 50%, no matter what
the 1st order switch probability was.</p>
</figcaption>
</figure>
</div>
<p>From this, it would be easy to conclude that the <span class="MathJax_Preview">n</span><script type="math/tex">n</script>‘th switch
probability of a sequence approximates a random sequence as <span class="MathJax_Preview">n → ∞</span><script type="math/tex">n → ∞</script>.
But is this true? What if we do the powers of 2 plus one?</p>
<div>
<figure>
<center><img src="/res/randombinary/nthdiffmeans-2powers-plus1.png" /></center>
<figcaption class="imagecaption"><p>As we increase the precision by powers of two plus one, we
get no closer to a random sequence than the 2nd order switch
probability.</p>
</figcaption>
</figure>
</div>
<p>As we see, even though the switch probability approaches 50%, there is
“hidden information” in the second order switch probability which
makes this sequence non-random.</p>
<h2 id="is-it-possible">Is it possible?</h2>
<p>Mathematicians have already figured out how we can turn biased coins
(i.e. coins that have a <span class="MathJax_Preview">p≠0.5</span><script type="math/tex">p≠0.5</script> probability of landing heads) into
fair coin flips. This was
<a href="https://mcnp.lanl.gov/pdf_files/nbs_vonneumann.pdf">famously described by Von Neumann</a>.
(While the Von Neumann procedure is not optimal,
<a href="http://dl.acm.org/citation.cfm?id=1070587">it is close</a>, and its
simplicity makes it appropriate for our purposes as a heuristic
method.) To summarize this method, suppose you have a coin which
comes up heads with a probability <span class="MathJax_Preview">p≠0.5</span><script type="math/tex">p≠0.5</script>. Then in order to obtain
a random sequence, flip the coin twice. If the coins come up with the
same value, discard both values. If they come up with different
values, discard the second value. This takes on average
<span class="MathJax_Preview">n/(p-p^2)</span><script type="math/tex">n/(p-p^2)</script> coin flips to generate a sequence of <span class="MathJax_Preview">n</span><script type="math/tex">n</script> values.</p>
<p>In our case, we want to correct for a biased switch probability.
Thus, we must generate a sequence of random numbers, find the
switches, apply this technique, and then map the switches back to the
initial choices. So for example,</p>
<div class="highlighter-rouge"><div class="highlight"><pre class="highlight"><code>1011101000101011010100101000010
</code></pre></div></div>
<p>has switches at</p>
<div class="highlighter-rouge"><div class="highlight"><pre class="highlight"><code>110011100111110111110111100011
</code></pre></div></div>
<p>So converting this into pairs, we have</p>
<div class="highlighter-rouge"><div class="highlight"><pre class="highlight"><code>11 00 11 10 01 11 11 01 11 11 01 11 10 00 11
</code></pre></div></div>
<p>Applying the procedure, we get</p>
<div class="highlighter-rouge"><div class="highlight"><pre class="highlight"><code>1 0 0 0 1
</code></pre></div></div>
<p>and mapping it back, we get a random sequence of</p>
<div class="highlighter-rouge"><div class="highlight"><pre class="highlight"><code>100001
</code></pre></div></div>
<p>(With a bias of <span class="MathJax_Preview">p=0.7</span><script type="math/tex">p=0.7</script> in this example, the predicted length of our
initial sequence of 31 was 6.5. This is a sequence of length 6.)</p>
<p>It is possible to recreate this precisely with a sliding window.
However, there is an easier way. In humans, the speed limiting step
is performing these calculations, not generating biased binary digits.
If we are willing to sacrifice theoretical efficiency (i.e. using as
few digits as possible) for simplicity, we can also look at our initial
sequence in chunks of 3. We then discard the sequences <code class="highlighter-rouge">101</code>,
<code class="highlighter-rouge">010</code>, <code class="highlighter-rouge">111</code>, and <code class="highlighter-rouge">000</code>, but keep the most frequent digit
in the triple for the other observations, namely keeping a <code class="highlighter-rouge">0</code> for
<code class="highlighter-rouge">001</code> and <code class="highlighter-rouge">100</code>, or a <code class="highlighter-rouge">1</code> for <code class="highlighter-rouge">110</code>, and <code class="highlighter-rouge">011</code>.
(Note that this is only true because we assume an equal probability of
<code class="highlighter-rouge">0</code> or <code class="highlighter-rouge">1</code> in the initial sequence. A more general choice
procedure would be a <code class="highlighter-rouge">0</code> if we observe <code class="highlighter-rouge">110</code> or <code class="highlighter-rouge">001</code>, and
a <code class="highlighter-rouge">1</code> if we observe <code class="highlighter-rouge">100</code> or <code class="highlighter-rouge">011</code>. However, this is more
difficult for humans to compute.) A proof that this method generates
truly random sequences is trivial.</p>
<p>When we apply this method to the sequences in Figures 1 and 2, we get
the following, which shows both powers of two and powers of two plus
one.</p>
<div>
<figure>
<center><img src="/res/randombinary/nthdiffmeans-2powers-plus1-triplet.png" /></center>
<figcaption class="imagecaption"><p>Using the triplet method, no differences of the sequence show
structure, i.e. the probability of a <code class="highlighter-rouge">0</code> or <code class="highlighter-rouge">1</code> is approximately 50%
in all differences. These values mimic those of the two previous
figures. The variance increases at the edges because the probability
of finding the triplets <code class="highlighter-rouge">010</code> and <code class="highlighter-rouge">101</code> is high when switch
probability is high, and the triplets <code class="highlighter-rouge">000</code> and <code class="highlighter-rouge">111</code> is high when
switch probability is low, so the resulting sequence is shorter.</p>
</figcaption>
</figure>
</div>
<h2 id="testing-for-randomness-of-these-methods">Testing for randomness of these methods</h2>
<p>While there are many definitions of random sequences, the normalized
<a href="https://en.wikipedia.org/wiki/Entropy_(information_theory)">entropy</a>
is especially useful for our purposes. In short, normalized entropy
divides the sequence into blocks of size <span class="MathJax_Preview">k</span><script type="math/tex">k</script> and looks at the
probability of finding any given sequence of length <span class="MathJax_Preview">k</span><script type="math/tex">k</script>. If it is a
uniform probability, i.e. no block is any more likely than another
block, the function gives a value of 1, but if some occur more
frequently than others, it gives a value less than 1. In the extreme
case where only one block appears, it gives a value of 0.</p>
<p>Intuitively, if we have a high switch probability, we would expect to
see the blocks <code class="highlighter-rouge">01</code> and <code class="highlighter-rouge">10</code> more frequently than <code class="highlighter-rouge">00</code> or <code class="highlighter-rouge">11</code>.
Likewise, if we have a low switch probability, we would see more <code class="highlighter-rouge">00</code>
and <code class="highlighter-rouge">11</code> blocks than <code class="highlighter-rouge">01</code> or <code class="highlighter-rouge">10</code>. Similar relationships extend
beyond blocks of size 2. Entropy is useful for determining randomness
because it makes no assumptions about the form of the non-random
component.</p>
<p>As we can see below, the triplet method is identical to random, but
all other methods show non-random patterns.</p>
<div>
<figure>
<center><img src="/res/randombinary/binary-sequence-entropy.png" /></center>
<figcaption class="imagecaption"><p>Using entropy, we can see which methods are able to mimic a
random sequence. Of those we have considered here, only the triplet
method is able to generate random values, as the normalized entropy is
approximately equal to 1 for all sequence lengths.</p>
</figcaption>
</figure>
</div>
<h2 id="conclusions">Conclusions</h2>
<p>Humans are not very effective at generating random numbers. With
random binary numbers, human-generated random numbers tend to switch
back and forth between sequences of <code class="highlighter-rouge">0</code>s and <code class="highlighter-rouge">1</code>s too quickly. Even
when made aware of this bias, it is difficult to compensate for it.</p>
<p>However, there may be ways that humans can generate sequences which
are closer to random sequences. One way is to split the sequence into
three-digit triplets, discarding the entire triplet for <code class="highlighter-rouge">000</code>, <code class="highlighter-rouge">111</code>,
<code class="highlighter-rouge">010</code>, and <code class="highlighter-rouge">101</code>, and taking the most frequent number in all other
triplets. When the key non-random element is switch probability, this
creates an easy-to-compute method for generating a random binary
sequence.</p>
<p>Nevertheless, this triplet method relies on the assumption that the
only bias humans have when generating random binary numbers is the
switch probability bias. Since no data were analyzed here, it is
still necessary to look into whether human-generated sequences have
more non-random elements than just a change in switch probability.</p>
<h2 id="more-information">More information</h2>
<h3 id="technical-notes">Technical notes</h3>
<p>The 1st order switch sequence is also called differencing. Similarly,
the sequence of <span class="MathJax_Preview">n</span><script type="math/tex">n</script>‘th order switches is equal to the <span class="MathJax_Preview">n</span><script type="math/tex">n</script>‘th
difference. The 1st difference can also be thought of as a sliding
XOR window, i.e. a parity sliding window of size 2.</p>
<p>Using the concept of a sliding XOR window raises the idea that the
<span class="MathJax_Preview">n</span><script type="math/tex">n</script>‘th difference can be represented as as sliding parity window of
size greater than 2. By construction, for a sequence of length <span class="MathJax_Preview">N</span><script type="math/tex">N</script>,
a sliding window of size <span class="MathJax_Preview">k</span><script type="math/tex">k</script> would end up producing a sequence of
length <span class="MathJax_Preview">N-k+1</span><script type="math/tex">N-k+1</script>. Since the <span class="MathJax_Preview">n</span><script type="math/tex">n</script>‘th difference produces a sequence
of length <span class="MathJax_Preview">N-n</span><script type="math/tex">N-n</script>, this means that a sliding window of length <span class="MathJax_Preview">k</span><script type="math/tex">k</script>
would be limited to only the <span class="MathJax_Preview">(k-1)</span><script type="math/tex">(k-1)</script>‘th difference.</p>
<p>It turns out that this can only be shown to hold for window sizes of
powers of two. The proof by induction that this holds for window
sizes of powers of two is a simple proof by induction. The 0th
difference corresponds to a window of size 1. The parity of a single
binary digit is just the digit itself. So it holds trivially in this
case.</p>
<p>For the induction step, suppose the <span class="MathJax_Preview">(k-1)</span><script type="math/tex">(k-1)</script>‘th difference is equal
to the parity for a window of size <span class="MathJax_Preview">k</span><script type="math/tex">k</script> where <span class="MathJax_Preview">k</span><script type="math/tex">k</script> is a power of 2.
Let <span class="MathJax_Preview">x</span><script type="math/tex">x</script> be any bit in at least the <span class="MathJax_Preview">(2k-1)</span><script type="math/tex">(2k-1)</script>‘th difference. Let
the window of <span class="MathJax_Preview">x</span><script type="math/tex">x</script> be the appropriate window of <span class="MathJax_Preview">2k</span><script type="math/tex">2k</script> digits of the
original sequence which determines the value of <span class="MathJax_Preview">x</span><script type="math/tex">x</script>. We need to
show that the parity of the window of <span class="MathJax_Preview">x</span><script type="math/tex">x</script> is equal to the value of
<span class="MathJax_Preview">x</span><script type="math/tex">x</script>.</p>
<p>Without loss of generality, suppose the sequence of bits is of length
<span class="MathJax_Preview">2k</span><script type="math/tex">2k</script> (the window of <span class="MathJax_Preview">x</span><script type="math/tex">x</script>), and <span class="MathJax_Preview">x</span><script type="math/tex">x</script> is the single bit that is the
<span class="MathJax_Preview">(2k-1)</span><script type="math/tex">(2k-1)</script>‘th difference.</p>
<p>Let us split the sequence in half, and apply the assumption to the
first half and then to the second half separately. We notice that the
parity of the parities of these halves is equal to the parity of the
entire sequence. Splitting the sequence in half tells us that the
first bit in the <span class="MathJax_Preview">(k-1)</span><script type="math/tex">(k-1)</script>‘th difference is equal to the parity of the
first half of the bits, and the second bit in the <span class="MathJax_Preview">(k-1)</span><script type="math/tex">(k-1)</script>‘th
difference is equal to the parity of the second half of the bits.</p>
<p>We can reason that these two bits would be equal iff the parity of the
<span class="MathJax_Preview">k</span><script type="math/tex">k</script>‘th difference is 0, and different iff the parity of the <span class="MathJax_Preview">k</span><script type="math/tex">k</script>‘th
difference is 1, because by the definition of a difference, we switch
every time there is a 1 in the sequence, so an even number of switches
means that the two bits would have the same parity. By applying our
original assumption again, we know that if the <span class="MathJax_Preview">k</span><script type="math/tex">k</script>‘th difference is
0, then <span class="MathJax_Preview">x</span><script type="math/tex">x</script> will be 0, and if the <span class="MathJax_Preview">k</span><script type="math/tex">k</script>‘th difference is 1, <span class="MathJax_Preview">x</span><script type="math/tex">x</script>
will be 1.</p>
<p>Therefore, <span class="MathJax_Preview">x</span><script type="math/tex">x</script> is equal to the parity of a window of size <span class="MathJax_Preview">2k</span><script type="math/tex">2k</script>,
and hence the <span class="MathJax_Preview">(2k-1)</span><script type="math/tex">(2k-1)</script>‘th difference is equal to the parity of a
sliding window of size <span class="MathJax_Preview">2k</span><script type="math/tex">2k</script>. QED.</p>
<div>
<figure>
<center><img src="/res/randombinary/proof.png" /></center>
<figcaption class="imagecaption"><p>A visual version of
the above proof.</p>
</figcaption>
</figure>
</div>
<h3>Code/Data:</h3>
<ul>
<li><a href="/res/randombinary/randombinary.py">Analysis script</a></li>
</ul>
Wed, 05 Jul 2017 00:00:00 +0000
/2017/07/05/can-humans-generate-random-numbers.html
/2017/07/05/can-humans-generate-random-numbers.htmlrandomnessstatsalgorithmPsychWhen to stop and when to keep going
<p>I was recently posed the following puzzle:</p>
<blockquote>
<p>Imagine you are offered a choice between two different bets. In
(A), you must make 2/3 soccer shots, and in (B), you must make
5/8. In either case, you receive a <span class="MathJax_Preview">$100</span><script type="math/tex">$100</script> prize for winning the bet.
Which bet should you choose?</p>
</blockquote>
<p>Intuitively, a professional soccer player would want to take the
second bet, whereas a hopeless case like me would want to take the
first. However, suppose you have no idea whether your skill level is
closer to Lionel Messi or to Max Shinn. The puzzle continues:</p>
<blockquote>
<p>You are offered the option to take practice shots to determine your
skill level at a cost of <span class="MathJax_Preview">$0.01</span><script type="math/tex">$0.01</script> for each shot. Assuming you and
the goalie never fatigue, how do you decide when to stop taking
practice shots and choose a bet?</p>
</blockquote>
<p>Clearly it is never advisable to take more than <span class="MathJax_Preview">100/.01=10000</span><script type="math/tex">100/.01=10000</script>
practice shots, but how many <em>should</em> we take? A key to this question
is that you do not have to determine the number of shots to take
beforehand. Therefore, rather than determining a fixed number of
shots to take, we will instead need to determine a decision procedure
for when to stop shooting and choose a bet.</p>
<p>There is no single “correct” answer to this puzzle, so I have
documented my approach below.</p>
<h2 id="approach">Approach</h2>
<p>To understand my approach, first realize that there are a finite
number of potential states that the game can be in, and that you can
fully define each state based on how many shots you have made and how
many you have missed. The sum of these is the total number of shots
you have taken, and the order does not matter. Additionally, we
assume that all states exist, even if you will never arrive at that
state by the decision procedure.</p>
<p>An example of a state is taking 31 shots, making 9 of them, and
missing 22 of them. Another example is taking 98 shots, making 1 of
them and missing 97 of them. Even though we may have already made a
decision before taking 98 shots, the concept of a state does not
depend on the procedure used to “get there”.</p>
<p>Using this framework, it is sufficient to show which decision we
should take given what state we are in. My approach is as follows:</p>
<ol>
<li>Find a tight upper bound <span class="MathJax_Preview">B \ll 10000</span><script type="math/tex">B \ll 10000</script> on the number of practice
shots to take. This limits the number of states to work with.</li>
<li>Determine the optimal choice based on each potential state after
taking <span class="MathJax_Preview">B</span><script type="math/tex">B</script> total shots. Once <span class="MathJax_Preview">B</span><script type="math/tex">B</script> shots have been taken, it is
always best to have chosen either bet (A) or bet (B), so choose the
best bet without the option of shooting again.</li>
<li>Working backwards, starting with states with <span class="MathJax_Preview">B-1</span><script type="math/tex">B-1</script> shots and
moving down to <span class="MathJax_Preview">B-2,...,0</span><script type="math/tex">B-2,...,0</script>, determine the expected value of each
of the three choices: select bet (A), select bet (B), or shoot
again. Use this to determine the optimal choice to make at that
position.</li>
</ol>
<p>The advantage of this approach is that the primary criterion we will
work with is the expected value for each decision. This means that if
we play the game many times we will maximize the amount of money we
earn. As a convenient consequence of this, we know much money we can
expect to earn given our current state.</p>
<p>The only reason this procedure is necessary is because we don’t know
our skill level. If we could determine with 100% accuracy what are
skill level was, we would never need to take any shots at all. Thus,
a key part of this procedure is estimating our skill level.</p>
<h2 id="what-if-you-know-your-skill-level">What if you know your skill level?</h2>
<p>We define skill level as the probability <span class="MathJax_Preview">p_0</span><script type="math/tex">p_0</script> that you will make a
shot. So if you knew your probability of making each shot, we could
find your expected payoff from each bet. On the plot below, we show
the payoff (in dollars) of each bet on the y-axis, and how it changes
with skill on the x-axis.</p>
<div>
<figure>
<center><img src="/res/soccer/winning_prob_binom.png" /></center>
<figcaption class="imagecaption"><p>Assuming
we have a precise knowledge of your skill level, we can find how much
money you can expect to make from each bet.</p>
</figcaption>
</figure>
</div>
<p>The first thing to notice is the obvious: as our skill improves, the
amount of money we can expect to win increases. Second, we see that
there is some point (the “equivalence point”) at which the bets are
equal; we compute this numerically to be <span class="MathJax_Preview">p_0 = 0.6658</span><script type="math/tex">p_0 = 0.6658</script>. We should
choose bet (A) if our skill level is worse than <span class="MathJax_Preview">0.6658</span><script type="math/tex">0.6658</script>, and bet (B) if
it is greater than <span class="MathJax_Preview">0.6658</span><script type="math/tex">0.6658</script>.</p>
<p>But suppose our guess is poor. We notice that <em>the consequence for
guessing too high is less than the consequence for guessing too low</em>.
It is better to bias your choice towards (A) unless you obtain
substantial evidence that you have a high skill level and (B) would be
a better choice. In other words, the potential gains from choosing
(A) over (B) are larger than the potential gains for choosing (B) over
(A).</p>
<h2 id="finding-a-tight-upper-bound">Finding a tight upper bound</h2>
<p>Quantifying this intuition, we compute the maximal possible gain of
choosing (A) over (B) and (B) over (A) as the maximum distance between
the curves on each side of the equivalence point. In other words, we
find the skill level at which the incentive is strongest to choose one
bet over the other, and then find what the incentive is at these
points.</p>
<div>
<figure>
<center><img src="/res/soccer/winning_prob_binom_lines.png" /></center>
<figcaption class="imagecaption"><p>We
see here the locations where the distance between the curves is
greatest, showing the skill levels where it is most advantageous to
choose (A) or (B).</p>
</figcaption>
</figure>
</div>
<p>This turns out to be <span class="MathJax_Preview">$4.79</span><script type="math/tex">$4.79</script> for choosing (B) over (A), and
<span class="MathJax_Preview">$17.92</span><script type="math/tex">$17.92</script> for choosing (A) over (B). Since each shot costs
<span class="MathJax_Preview">$0.01</span><script type="math/tex">$0.01</script>, we conclude that it is never a good idea to take more than
479 practice shots. Thus, our upper bound <span class="MathJax_Preview">B=479</span><script type="math/tex">B=479</script>.</p>
<h2 id="determining-the-optimal-choice-at-the-upper-bound">Determining the optimal choice at the upper bound</h2>
<p>Because we will never take more than 479 shots, we use this as a
cutoff point, and force a decision once 479 shots have been taken. So
for each possible combinations of successes and failures, we must
find whether bet (A) or bet (B) is better.</p>
<p>In order to determine this, we need two pieces of information: first,
we need the expected value of bets (A) and (B) given <span class="MathJax_Preview">p_0</span><script type="math/tex">p_0</script> (i.e. the
curve shown above); second, we need the distribution representing our
best estimate of <span class="MathJax_Preview">p_0</span><script type="math/tex">p_0</script>. Remember, it is not enough to simply choose
(A) when our predicted skill is less than <span class="MathJax_Preview">0.6658</span><script type="math/tex">0.6658</script> and (B) when it
is greater than <span class="MathJax_Preview">0.6658</span><script type="math/tex">0.6658</script>; since we are biased towards choosing (A),
we need a probability distribution representing potential values of
<span class="MathJax_Preview">p_0</span><script type="math/tex">p_0</script>. Then, we can find the expected value of each bet given the
distribution of <span class="MathJax_Preview">p_0</span><script type="math/tex">p_0</script> (see appendix for more details). This can be
computed with a simple integral, and is easy to approximate
numerically.</p>
<p>Once we have performed these computations, in addition to having
information about whether (A) or (B) was chosen, we also know the
expected value of the chosen bet. This will be critical for
determining whether it is beneficial to take more shots before we have
reached the upper bound.</p>
<h2 id="determining-the-optimal-choice-below-the-upper-bound">Determining the optimal choice below the upper bound</h2>
<p>We then go down one level: if 478 shots have been taken, with <span class="MathJax_Preview">k</span><script type="math/tex">k</script>
successes and <span class="MathJax_Preview">(478-k)</span><script type="math/tex">(478-k)</script> failures, should we choose (A), should we
choose (B), or should we take another shot? Remember, we would like
to select the choice which will give us the highest expected outcome.</p>
<p>Based on this principle, it is only advisable to take another shot if
it would influence the outcome; in other words, if you would choose
the same bet no matter what the outcome of your next shot, it does not
make sense to take another shot, because you lose <span class="MathJax_Preview">$0.01</span><script type="math/tex">$0.01</script> without
gaining any information. It only makes sense to take the shot if the
information gained from taking the shot increases the expected value
by more than <span class="MathJax_Preview">$0.01</span><script type="math/tex">$0.01</script>.</p>
<p>Thus, we would only like to take another shot if the information
gained is worth more than <span class="MathJax_Preview">$0.01</span><script type="math/tex">$0.01</script>. We can compute this by finding the
expected value of each of the three options (choose (A), choose (B),
or shoot again). Using our previous experiments to judge the
probability of a successful shot (see appendix), we can find the
expected payoff of taking another shot. If it is greater than
choosing (A) or (B), we take the shot.</p>
<p>Working backwards, we continue until we are on our first shot, where
we assume we have a <span class="MathJax_Preview">50</span><script type="math/tex">50</script>% chance of succeeding. Once we reach this
point, we have a full decision tree, indicating which action we should
take based on the outcome of each shot, and the entire decision
process can be considered solved.</p>
<h2 id="conclusion">Conclusion</h2>
<p>Here is the decision tree, plotted in raster form.</p>
<div>
<figure>
<center><img src="/res/soccer/decision-tree.png" /></center>
<figcaption class="imagecaption"><p>Starting at
the point (0,0), go one to the right for every shot that you take, and
one up for every shot that you make. Red indicates you should shoot
again, blue indicates you should choose (A), and green indicates you
should choose (B).</p>
</figcaption>
</figure>
</div>
<p>Looking more closely at the beginning, we see that unless you are
really good, you should choose (A) rather quickly.</p>
<div>
<figure>
<center><img src="/res/soccer/decision-tree-zoomed.png" /></center>
<figcaption class="imagecaption"><p>An
identical plot to that above, but zoomed in near the beginning.</p>
</figcaption>
</figure>
</div>
<p>We can also look at the amount of money you will win on average if you
play by this strategy. As expected, when you make more shots, you
will have a higher chance of winning more money.</p>
<div>
<figure>
<center><img src="/res/soccer/value-tree.png" /></center>
<figcaption class="imagecaption"><p>For each point in
the previous figures, these values correspond to the choices.</p>
</figcaption>
</figure>
</div>
<p>We can also look at the zoomed in version.</p>
<div>
<figure>
<center><img src="/res/soccer/value-tree-zoomed.png" /></center>
<figcaption class="imagecaption"><p>An
identical plot to the one above, but zoomed in near the beginning.</p>
</figcaption>
</figure>
</div>
<p>This algorithm grows in memory and computation time like <span class="MathJax_Preview">O(B^2)</span><script type="math/tex">O(B^2)</script>,
meaning that if we double the size of the upper bound, we quadruple
the amount of memory and CPU time we require.</p>
<p>This may not be the best strategy, but it seems to be a principled
strategy which works reasonably well with a relatively small runtime.</p>
<h2 id="appendix-determining-the-distribution-of-p_0">Appendix: Determining the distribution of <span class="MathJax_Preview">p_0</span><script type="math/tex">p_0</script></h2>
<p>In order to find the distribution for <span class="MathJax_Preview">p_0</span><script type="math/tex">p_0</script>, we consider the
distribution of <span class="MathJax_Preview">p_0</span><script type="math/tex">p_0</script> for a single shot. The chance that we make a
shot is <span class="MathJax_Preview">100</span><script type="math/tex">100</script>% if <span class="MathJax_Preview">p_0=1</span><script type="math/tex">p_0=1</script>, <span class="MathJax_Preview">0</span><script type="math/tex">0</script>% if <span class="MathJax_Preview">p_0=0</span><script type="math/tex">p_0=0</script>, <span class="MathJax_Preview">50</span><script type="math/tex">50</script>% if
<span class="MathJax_Preview">p_0=0.5</span><script type="math/tex">p_0=0.5</script>, and so on. Thus, the distribution of <span class="MathJax_Preview">p_0</span><script type="math/tex">p_0</script> from a
single successful trial is <span class="MathJax_Preview">f(p)=p</span><script type="math/tex">f(p)=p</script> for <span class="MathJax_Preview">0 ≤ p ≤ 1</span><script type="math/tex">0 ≤ p ≤ 1</script>. Similarly,
if we miss the shot, then the distribution is <span class="MathJax_Preview">f(p)=(1-p)</span><script type="math/tex">f(p)=(1-p)</script> for
<span class="MathJax_Preview">0≤p≤1</span><script type="math/tex">0≤p≤1</script>. Since these probabilities are independent, we can multiply
them together and find that, for <span class="MathJax_Preview">n</span><script type="math/tex">n</script> shots, <span class="MathJax_Preview">k</span><script type="math/tex">k</script> successes, and
<span class="MathJax_Preview">(n-k)</span><script type="math/tex">(n-k)</script> failures, we have <span class="MathJax_Preview">f(p)=p^k (1-p)^{n-k}/c</span><script type="math/tex">f(p)=p^k (1-p)^{n-k}/c</script> for some
normalizing constant <span class="MathJax_Preview">c</span><script type="math/tex">c</script>. It turns out, this is identical to the
beta distribution, with parameters <span class="MathJax_Preview">α=k+1</span><script type="math/tex">α=k+1</script> and <span class="MathJax_Preview">β=n-k+1</span><script type="math/tex">β=n-k+1</script>.</p>
<p>However, we need a point estimate of <span class="MathJax_Preview">p_0</span><script type="math/tex">p_0</script> to compute the expected
value of taking another shot. We cannot simply use the ratio <span class="MathJax_Preview">n/k</span><script type="math/tex">n/k</script>
for two practical reasons: first, it is undefined when no shots have
been taken, and second, when the first shot has been taken, we have a
<span class="MathJax_Preview">100</span><script type="math/tex">100</script>% probability of one outcome and a <span class="MathJax_Preview">0</span><script type="math/tex">0</script>% probability of the
other. If we want to assume a <span class="MathJax_Preview">50</span><script type="math/tex">50</script>% probability of making the shot
initially, an easy way to solve this problem is to use the ratio
<span class="MathJax_Preview">(k+1)/(n+2)</span><script type="math/tex">(k+1)/(n+2)</script> instead of <span class="MathJax_Preview">k/n</span><script type="math/tex">k/n</script> to estimate the probability.
Interestingly, this quick and dirty solution is equivalent to finding
the mean of the beta distribution. When no shots have been taken,
<span class="MathJax_Preview">k=0</span><script type="math/tex">k=0</script> and <span class="MathJax_Preview">n=0</span><script type="math/tex">n=0</script>, so <span class="MathJax_Preview">α=1</span><script type="math/tex">α=1</script> and <span class="MathJax_Preview">β=1</span><script type="math/tex">β=1</script>, which is equivalent to the
uniform distribution, hence our non-informative prior.</p>
<h3>Code/Data:</h3>
<ul>
<li><a href="/res/soccer/find-best-strategy.py">Analysis script</a></li>
</ul>
Wed, 08 Mar 2017 00:00:00 +0000
/2017/03/08/when-to-stop-and-when-to-keep-going.html
/2017/03/08/when-to-stop-and-when-to-keep-going.htmlalgorithmstatsmodelingpuzzlegamePuzzleWhich hints are best in Towers?
<p>There is a wonderful collection of puzzles by Simon Tatham called the
<a href="http://www.chiark.greenend.org.uk/~sgtatham/puzzles/">Portable Puzzle Collection</a>
which serves as a fun distraction. The game “Towers” is a simple puzzle
where you must fill in a
<a href="https://en.wikipedia.org/wiki/Latin_square">Latin square</a> with
numbers <span class="MathJax_Preview">1 \ldots N</span><script type="math/tex">1 \ldots N</script>, only one of each per row/column, as if the
squares contained towers of this height. The number of towers visible
from the edges of rows and columns are given as clues. For example,</p>
<div>
<figure>
<center><img src="/res/towers/example-board.png" /></center>
<figcaption class="imagecaption"><p>An example starting board from the Towers game.</p>
</figcaption>
</figure>
</div>
<p>Solved, the board would appear as,</p>
<div>
<figure>
<center><img src="/res/towers/solved-example.png" /></center>
<figcaption class="imagecaption"><p>The previous example solved.</p>
</figcaption>
</figure>
</div>
<p>In more advanced levels, not all of the hints are given.
Additionally, in these levels, hints can also be given in the form of
the value of particular cells. For example, the initial conditions of
the puzzle may be,</p>
<div>
<figure>
<center><img src="/res/towers/hard-level.png" /></center>
<figcaption class="imagecaption"><p>A more difficult example board.</p>
</figcaption>
</figure>
</div>
<p>With such different types of hints, it raises the question of whether
some hints are better than others.</p>
<h2 id="how-will-we-approach-the-problem">How will we approach the problem?</h2>
<p>We will use an
<a href="https://en.wikipedia.org/wiki/Shannon_information">information-theoretic</a>
framework to understand how useful different hints are. This allows
us to measure the amount of information that a particular hint gives
about the solution to a puzzle in bits, a nearly-identical unit to
that used by computers to measure file and memory size.</p>
<p>Information theory is based on the idea that random variables
(quantities which can take on one of many values probabilistically)
are not always independent, so sometimes knowledge of the value of one
random variable can change the probabilities for a different random
variable. For instance, one random variable may be a number 1-10, and
a second random variable may be whether that number is even or odd. A
bit is an amount of information equal to the best possible yes or no
question, or (roughly speaking) information that can cut the number of
possible outcomes in half. Knowing whether a number is even or odd
gives us one bit of information, since it specifies that the first
random variable can only be one of five numbers instead of one of ten.</p>
<p>Here, we will define a few random variables. Most importantly, we
will have the random variable describing the correct solution of the
board, which could be any possible board. We will also have random
variables which represent hints. There are two types of hints:
initial cell value hints (where one of the cells is already filled in)
and tower visibility hints (which define how many towers are visible
down a row or column).</p>
<p>The number of potential Latin squares of size <span class="MathJax_Preview">N</span><script type="math/tex">N</script> grows very fast.
For a <span class="MathJax_Preview">5×5</span><script type="math/tex">5×5</script> square, there are 161,280 possibilities, and for a
<span class="MathJax_Preview">10×10</span><script type="math/tex">10×10</script>, there are over <span class="MathJax_Preview">10^{47}</span><script type="math/tex">10^{47}</script>. Thus, for computational
simplicity, we analyze a <span class="MathJax_Preview">4×4</span><script type="math/tex">4×4</script> puzzle with a mere 576 possibilities.</p>
<h2 id="how-useful-are-initial-cell-value-hints">How useful are “initial cell value” hints?</h2>
<p>First, we measure the entropy, or the maximal information content that
a single cell will give. For the first cell chosen, there is an equal
probability that any of the values (<code class="highlighter-rouge">1</code>, <code class="highlighter-rouge">2</code>, <code class="highlighter-rouge">3</code>, or <code class="highlighter-rouge">4</code>) will be
found in that cell. Since there are two options, this give us 2 bits
of information.</p>
<p>What about the second initial cell value? Interestingly, it depends
both on the location and on the value. If the second clue is in the
same row or column as the first, it will give less information. If it
is the same number as the first, it will also give less information.</p>
<p>Counter-intuitively, in the 4×4 board, this means we gain <em>more</em> than
2 bits of information from the second hint. This is because, once we
reveal the first cell’s value, the probabilities of each of the other
cell’s possible values are not equal as they were before. Since we
are not choosing from the same row or column of our first choice, is
more likely that this cell will be equal to the first cell’s value
than to any other value. So therefore if we reveal a value which is
different, it will provide more information.</p>
<p>Intuitively, for the 4×4 board, suppose we reveal the value of a cell
and it is <code class="highlighter-rouge">4</code>. There cannot be another <code class="highlighter-rouge">4</code> in the same column or row,
so if we are to choose a hint from a different column or row, we are
effectively choosing from a leaving a 3×3 grid. There must be 3 <code class="highlighter-rouge">4</code>
values in the 3×3 grid, so the probability of selecting it is 1/3. We
have an even probability of selecting a <code class="highlighter-rouge">1</code>, <code class="highlighter-rouge">2</code>, or <code class="highlighter-rouge">3</code>, so each
other symbol has a probability of 2/9. Being more surprising finds,
we gain 2.17 bits of information from each of these three.</p>
<p>Consequently, selecting a cell in the same row or column, or one which
has the same value as the first, will give an additional 1.58 bits of
information.</p>
<h2 id="how-about-tower-visibility-hints">How about “tower visibility” hints?</h2>
<p>In a 4×4 puzzle, it is very easy to compute the information gained if
the hint is a <code class="highlighter-rouge">1</code> or a <code class="highlighter-rouge">4</code>. A hint of <code class="highlighter-rouge">1</code> always gives the same
amount of information as a single square: it tells us that the cell on
the edge of the hint must be a <code class="highlighter-rouge">4</code>, and gives no information about the
rest of the squares. If only one tower can be seen, the tallest tower
must come first. Thus, it must give 2 bits of information.</p>
<p>Additionally, we know that if the hint is equal to <code class="highlighter-rouge">4</code>, the only
possible combination for the row is <code class="highlighter-rouge">1</code>, <code class="highlighter-rouge">2</code>, <code class="highlighter-rouge">3</code>, <code class="highlighter-rouge">4</code>. Thus, this
gives an amount of information equal to the entropy of a single row,
which turns out to be 4.58 bits.</p>
<p>For a hint of <code class="highlighter-rouge">2</code> or <code class="highlighter-rouge">3</code>, the information content is not as
immediately clear, but we can calculate them numerically. For a hint
of <code class="highlighter-rouge">2</code>, we have 1.13 bits, and for a hint of <code class="highlighter-rouge">3</code>, we have 2 bits.</p>
<p>Conveniently, due to the fact that the reduction of entropy in a row
must be equal to the reduction of entropy in the entire puzzle, we can
compute values for larger boards. Below, we show the information
gained about the solution from each possible hint (indicated by the
color). In general, it seems higher hints are usually better, but a
hint of <code class="highlighter-rouge">1</code> is generally better than one of <code class="highlighter-rouge">2</code> or <code class="highlighter-rouge">3</code>.</p>
<div>
<figure>
<center><img src="/res/towers/information-by-board-size.png" /></center>
<figcaption class="imagecaption"><p>For each board size, the information content of each
potential hint is plotted.</p>
</figcaption>
</figure>
</div>
<h2 id="conclusion">Conclusion</h2>
<p>In summary:</p>
<ul>
<li>The more information given by a hint for a puzzle, the easier that
hint makes it to solve the puzzle.</li>
<li>Of the two types of hints, usually the hints about the tower
visibility are best.</li>
<li>On small boards (of size less than 5), hints about individual cells
are very useful.</li>
<li>The more towers visible from a row or column, the more information is
gained about the puzzle from that hint.</li>
</ul>
<p>Of course, remember that all of the hints combined of any given puzzle
must be sufficient to completely solve the puzzle (assuming the puzzle
is solvable), so the information content provided by the hints must be
equal to the entropy of the puzzle of the given size. When combined,
we saw in the “initial cell value” that hints may become more or less
effective, so these entropy values cannot be directly added to
determine which hints provide the most information. Nevertheless,
this serves as a good starting point in determining which hints are
the most useful.</p>
<h2 id="more-information">More information</h2>
<h3 id="theoretical-note">Theoretical note</h3>
<p>For initial cell hints, it is possible to compute the information
content analytically for any size board. For a board of size <span class="MathJax_Preview">N×N</span><script type="math/tex">N×N</script>
with <span class="MathJax_Preview">N</span><script type="math/tex">N</script> symbols, we know that the information contained in the
first hint is <span class="MathJax_Preview">-\log(1/N)</span><script type="math/tex">-\log(1/N)</script> bits. Suppose this play uncovers token
<code class="highlighter-rouge">X</code>. Using this first play, we construct a sub-board where the row
and column of the first hint are removed, leaving us with an
<span class="MathJax_Preview">(N-1)×(N-1)</span><script type="math/tex">(N-1)×(N-1)</script> board. If we choose a cell from this board, it has a
<span class="MathJax_Preview">1/(N-1)</span><script type="math/tex">1/(N-1)</script> probability of being <code class="highlighter-rouge">X</code> and an equal chance of being
anything else, giving a <span class="MathJax_Preview">\frac{N-2}{(N-1)^2}</span><script type="math/tex">\frac{N-2}{(N-1)^2}</script> probability of each of
the other tokens. Thus, information gained is
<span class="MathJax_Preview">-\frac{N-2}{(N-1)^2}×\log\left(\frac{N-2}{(N-1)^2}\right)</span><script type="math/tex">-\frac{N-2}{(N-1)^2}×\log\left(\frac{N-2}{(N-1)^2}\right)</script> if the
value is different from the first, and
<span class="MathJax_Preview">-1/(N-1)×\log\left(1/(N-1)\right)</span><script type="math/tex">-1/(N-1)×\log\left(1/(N-1)\right)</script> if they are the same; these
expressions are approximately equal for large <span class="MathJax_Preview">N</span><script type="math/tex">N</script>. Note how no
information is gained when the second square is revealed if <span class="MathJax_Preview">N=2</span><script type="math/tex">N=2</script>.</p>
<p>Similarly, when a single row is revealed (for example by knowing that
<span class="MathJax_Preview">N</span><script type="math/tex">N</script> towers are visible from the end of a row or column) we know that
the entropy must be reduced by <span class="MathJax_Preview">-\sum_{i=1}^N \log(1/N)</span><script type="math/tex">-\sum_{i=1}^N \log(1/N)</script>. This is
because the first element revealed in the row gives <span class="MathJax_Preview">-\log(1/N)</span><script type="math/tex">-\log(1/N)</script>
bits, the second gives <span class="MathJax_Preview">-\log(1/(N-1))</span><script type="math/tex">-\log(1/(N-1))</script> bits, and so on.</p>
<h3 id="solving-a-puzzle-algorithmically">Solving a puzzle algorithmically</h3>
<p>Most of these puzzles are solvable without backtracking, i.e. the next
move can always be logically deduced from the state of the board
without the need for trial and error. By incorporating the
information from each hint into the column and row states and then
integrating this information across rows and columns, it turned out to
be surprisingly simple to write a quick and dirty algorithm to solve
the puzzles. This algorithm, while probably not of optimal
computational complexity, worked reasonably well. Briefly,</p>
<ol>
<li>Represent the initial state of the board by a length-<span class="MathJax_Preview">N</span><script type="math/tex">N</script> list of
lists, where each of the <span class="MathJax_Preview">N</span><script type="math/tex">N</script> lists represents a row of the board,
and each sub-list contains all of the possible combinations of this
row (there are <span class="MathJax_Preview">N!</span><script type="math/tex">N!</script> of them to start). Similarly, define an
equivalent (yet redundant) data structure for the columns.</li>
<li>Enforce each condition on the start of the board by eliminating the
impossible combinations using the number of towers visible from
each row and column, and using the cells given at initialization.
Update the row and column lists accordingly.</li>
<li>Now, the possible moves for certain squares will be restricted by
the row and column limitations; for instance, if only 1 tower is
visible in a row or column, the tallest tower in the row or column
must be on the edge of the board. Iterate through the cells,
restricting the potential rows by the limitations on the column and
vice versa. For example, if we know the position of the tallest
tower in a particular <em>column</em>, eliminate the corresponding <em>rows</em>
which do not have the tallest tower in this position in the row.</li>
<li>After sufficient iterations of (3), there should only be one
possible ordering for each row (assuming it is solvable without
backtracking). The puzzle is now solved.</li>
</ol>
<p>This is not a very efficient algorithm, but it is fast enough and
memory-efficient enough for all puzzles which might be fun for a human
to solve. This algorithm also does not work with puzzles which
require backtracking, but could be easily modified to do
so.</p>
<h3>Code/Data:</h3>
<ul>
<li><a href="/res/towers/compute_information.py">Analysis script</a></li>
<li><a href="/res/towers/solve.py">Script to solve a Towers puzzle</a></li>
</ul>
Sat, 28 Jan 2017 00:00:00 +0000
/2017/01/28/which-hints-are-best-in-towers.html
/2017/01/28/which-hints-are-best-in-towers.htmlpuzzlegametowersalgorithminformation-theoryMathWhen should you leave for the bus?
<p>Anyone who has taken the bus has at one time or another wondered,
“When should I plan to be at the bus stop?” or more importantly, “When
should I leave if I want to catch the bus?” Many bus companies
suggest
<a href="http://www.matatransit.com/ridersguide/how-to-ride/">arriving</a>
<a href="http://www.riderta.com/howtoride">a</a>
<a href="http://routes.valleymetro.org/">few</a>
<a href="http://www.metrotransit.org/ride-the-bus">minutes</a>
<a href="http://atltransit.org/guide/tips/">early</a>, but there seem to be no
good analyses on when to leave for the bus. I decided to find out.</p>
<h2 id="finding-a-cost-function">Finding a cost function</h2>
<p>Suppose we have a bus route where a bus runs every <span class="MathJax_Preview">I</span><script type="math/tex">I</script> minutes, so if
you don’t catch your bus, you can always wait for the next bus.
However, since more than just your time is at stake for missing the
bus (e.g. missed meetings, stress, etc.), we assume there is a penalty
<span class="MathJax_Preview">\delta</span><script type="math/tex">\delta</script> for missing the bus in addition to the extra wait time.
<span class="MathJax_Preview">\delta</span><script type="math/tex">\delta</script> here is measured in minutes, i.e. how many minutes of your
time would you exchange to be guaranteed to avoid missing the bus.
<span class="MathJax_Preview">\delta=0</span><script type="math/tex">\delta=0</script> therefore means that you have no reason to prefer one bus
over another, and that you only care about minimizing your lifetime
bus wait time.</p>
<p>Assuming we will not be late enough to need to catch the third bus, we
can model this with two terms, representing the cost to you (in
minutes) of catching each of the next two buses, weighted by the
probability that you will catch that bus:</p>
<div class="MathJax_Preview">C(t) = \left(E(T_B) - t\right) P\left(T_B > t + L_W\right) + \left(I + E(T_B) - t + \delta\right) P(T_B < t + L_W)</div>
<script type="math/tex; mode=display">% <![CDATA[
C(t) = \left(E(T_B) - t\right) P\left(T_B > t + L_W\right) + \left(I + E(T_B) - t + \delta\right) P(T_B < t + L_W) %]]></script>
<p>where <span class="MathJax_Preview">T_B</span><script type="math/tex">T_B</script> is the random variable representing the time at which
the bus arrives, <span class="MathJax_Preview">L_W</span><script type="math/tex">L_W</script> is the random variable respresenting the
amount of time it takes to walk to the bus stop, and <span class="MathJax_Preview">t</span><script type="math/tex">t</script> is the time
you leave. (<span class="MathJax_Preview">E</span><script type="math/tex">E</script> is expected value and <span class="MathJax_Preview">P</span><script type="math/tex">P</script> is the probability.) We
wish to choose a time to leave the office <span class="MathJax_Preview">t</span><script type="math/tex">t</script> which minimizes the cost
function <span class="MathJax_Preview">C</span><script type="math/tex">C</script>.</p>
<p>If we assume that <span class="MathJax_Preview">T_B</span><script type="math/tex">T_B</script> and <span class="MathJax_Preview">L_W</span><script type="math/tex">L_W</script> are Gaussian, then it can shown that
the optimal time to leave (which minimizes the above function) is</p>
<div class="MathJax_Preview">t = -\mu_W - \sqrt{\left(\sigma_B^2 + \sigma_W^2\right)\left(2\ln\left(\frac{I+\delta}{\sqrt{\sigma_B^2+\sigma_W^2}}\right)-2\ln\left(\sqrt{2\pi}\right)\right)}</div>
<script type="math/tex; mode=display">t = -\mu_W - \sqrt{\left(\sigma_B^2 + \sigma_W^2\right)\left(2\ln\left(\frac{I+\delta}{\sqrt{\sigma_B^2+\sigma_W^2}}\right)-2\ln\left(\sqrt{2\pi}\right)\right)}</script>
<p>where <span class="MathJax_Preview">\sigma_B^2</span><script type="math/tex">\sigma_B^2</script> is the variance of the bus arrival time,
<span class="MathJax_Preview">\sigma_W^2</span><script type="math/tex">\sigma_W^2</script> is the variance of your walk, and <span class="MathJax_Preview">\mu_W</span><script type="math/tex">\mu_W</script> is expected
duration of your walk. In other words, you should plan to arrive at
the bus stop on average <span class="MathJax_Preview">\sqrt{\left(\sigma_B^2 + \sigma_W^2\right)\left(2\ln\left(\left(I+\delta\right)/\sqrt{\sigma_B^2+\sigma_W^2}\right)-2\ln\left(\sqrt{2\pi}\right)\right)}</span><script type="math/tex">\sqrt{\left(\sigma_B^2 + \sigma_W^2\right)\left(2\ln\left(\left(I+\delta\right)/\sqrt{\sigma_B^2+\sigma_W^2}\right)-2\ln\left(\sqrt{2\pi}\right)\right)}</script> minutes before your bus arrives.</p>
<p>Note that one deliberate oddity of the model is that the cost function
does not just measure wait time, but also walking time. I optimized
on this because, in the end, what matters is the total time you spend
getting on the bus.</p>
<h2 id="what-does-this-mean">What does this mean?</h2>
<p>The most important factor you should consider when choosing which bus
to take is the variability in the bus’ arrival time and the
variability in the time it takes you to walk to the bus. The arrival
time scales approximately linearly with the standard deviation of the
variability.</p>
<p>Additionally, it scales at approximately the square root of the log
the your value of time and of the frequency of the buses. So even if
very high values of time and very infrequent buses do not
substantially change the time at which you should arrive. For
approximation purposes, you might consider adding a constant in place
of this term, anywhere from 2-5 minutes depending on the frequency of
the bus.</p>
<h2 id="checking-the-assumption">Checking the assumption</h2>
<p>First, we need to collect some data to assess whether the bus time
arrival (<span class="MathJax_Preview">T_B</span><script type="math/tex">T_B</script>) is normally distributed. I wrote scripts to scrape
data from Yale University’s Blue Line campus shuttle route. Many bus
systems (including Yale’s) now have real-time predictions, so I used
many individual predictions by Yale’s real-time arrival prediction
system as the expected arrival time, simulating somebody checking this
to see when the next bus comes.</p>
<p>For our purposes, the expected arrival time looks close enough to a
Gaussian distribution:</p>
<div>
<figure>
<center><img src="/res/bus/isnormal.png" /></center>
<figcaption class="imagecaption"><p>It actually looks like a Gaussian!</p>
</figcaption>
</figure>
</div>
<h2 id="so-what-time-should-i-leave">So what time should I leave?</h2>
<p>When estimating the <span class="MathJax_Preview">\sigma_B^2</span><script type="math/tex">\sigma_B^2</script> parameter, we only examine bus
times which are 10 minutes away or later. This is because you can’t
use a real-time bus system to plan ahead of time to catch something if
it is too near in the future, which defeats the purpose of the present
analysis. The variance in arrival time for the Yale buses is
<span class="MathJax_Preview">\sigma_B^2=5.7</span><script type="math/tex">\sigma_B^2=5.7</script>.</p>
<p>We use an inter-bus interval of <span class="MathJax_Preview">I=15</span><script type="math/tex">I=15</script> minutes.</p>
<p>While the variability of the walk to the bus station <span class="MathJax_Preview">\sigma_W^2</span><script type="math/tex">\sigma_W^2</script> is
unique for each person, I consider two cases: one case, where we
assume that arrival time variability is small (<span class="MathJax_Preview">\sigma_W^2=0</span><script type="math/tex">\sigma_W^2=0</script>)
compared to the bus’ variability, representing the case where the bus
stop is (for intance) located right outside one’s office building. I
also consider the case where the time variability is comperable to the
variability for the bus (<span class="MathJax_Preview">\sigma_W=5</span><script type="math/tex">\sigma_W=5</script>), representing the case where
one must walk a long distance to the bus stop.</p>
<p>Finally, I consider the case where we strongly prioritize catching the
desired bus (<span class="MathJax_Preview">\delta=60</span><script type="math/tex">\delta=60</script> corresponding to, e.g., an important meeting)
and also the case where we seek to directly minimize the expected wait
time (<span class="MathJax_Preview">\delta=0</span><script type="math/tex">\delta=0</script> corresponding to, e.g., the commute home).</p>
<div>
<figure>
<center><img src="/res/bus/variants.png" /></center>
<figcaption class="imagecaption"><p>Even though the
shape of the optimization function changes greatly, the optimal
arrival time changes very little.</p>
</figcaption>
</figure>
</div>
<p>We can also look at a spectrum of different cost tradeoffs for missing
the bus (values of <span class="MathJax_Preview">\delta</span><script type="math/tex">\delta</script>) and variance in the walk time (values
of <span class="MathJax_Preview">\sigma_W^2 = var(W)</span><script type="math/tex">\sigma_W^2 = var(W)</script>). Because they appear similarly in the
equations, we can also consider these values to be changes in the
interval of the bus arrival <span class="MathJax_Preview">I</span><script type="math/tex">I</script> and the variance of the bus’ arrival
time <span class="MathJax_Preview">\sigma_B^2=var(B)</span><script type="math/tex">\sigma_B^2=var(B)</script> respectively.</p>
<div>
<figure>
<center><img src="/res/bus/howearly.png" /></center>
<figcaption class="imagecaption"><p>Across all
reasonable values, the optimal time to plan to arrive is between 3.5
and 8 minutes early.</p>
</figcaption>
</figure>
</div>
<h2 id="conclusion">Conclusion</h2>
<p>So to summarize:</p>
<ul>
<li>If it always takes you approximately the same amount of time to walk
to the bus stop, plan to be there 3-4 minutes early on your commute
home, or 5-6 minutes early if it’s the last bus before an important
meeting.</li>
<li>If you have a long walk to the bus stop which can vary in duration,
plan to arrive at the bus stop 4-5 minutes early if you take the bus
every day, or around 7-8 minutes early if you need to be somewhere
for a special event.</li>
<li>These estimations assume that you know how long it takes you on
average to walk to the bus stop. As we saw previously, if you need
to be somewhere at a certain time, arriving a minute early is much
better than arriving a minute late. If you don’t need to be
somewhere, just make your best guess.</li>
<li>The best way to reduce waiting time is to decrease variability.</li>
<li>These estimates also assume that the interval between buses is
sufficiently large. If it is small, as in the case of a subway,
there are
<a href="http://erikbern.com/2016/07/09/waiting-time-math.html">different factors</a>
that govern the time you spend waiting.</li>
<li>This analysis focuses on buses with an expected arrival time, not
with a scheduled arrival time. When buses have schedules, they will
usually wait at the stop if they arrive early. This situation would
require a different analysis than what was performed here.</li>
</ul>
<h3>Code/Data:</h3>
<ul>
<li><a href="/res/bus/2016-07-28-data.csv">Data</a></li>
<li><a href="/res/bus/getyalebus.py">Data collection script</a></li>
<li><a href="/res/bus/analyzebus.py">Data analysis script</a></li>
</ul>
Mon, 01 Aug 2016 00:00:00 +0000
/2016/08/01/when-should-you-leave-for-the-bus.html
/2016/08/01/when-should-you-leave-for-the-bus.htmldatabusstatsmodelingData