Aurora Hiveley, Rutgers University

Abstract

You're driving on a two lane road, approaching a stoplight. Shortly after the light, the left lane merges into the right lane. Do you stay in the right lane for a speedy merge, or choose the shorter of the two lanes in hopes of getting through the light quickly? Using the framework established by Bardenova et al. in a 2022 paper, we will represent cars' lane preferences with binary strings before computing the expected number of cars in each lane using recursion and a bijection to lattice paths.