This thesis is an examination of the traveler’s dilemma and its backward induction argument. I begin by explaining relevant terminology, the prisoner’s dilemma, and the iterated prisoner’s dilemma; the discussion of which aids my examination of the traveler’s dilemma and its backward induction argument. My evaluation of the traveler’s dilemma involves a dissection of the game into its different components, a presentation of the salient similarities and differences between the traveler’s dilemma and the prisoner’s dilemma, and the exploration of three possible solutions. The first two solutions are adapted from ones initially created to solve other backward induction argument problems. The third solution is original and its foundation rests on the unique structure of the traveler’s dilemma. I focus on this third solution and consider several objections to it. I end this thesis with some ancillary comments about the possibility of generalizing the third solution to other backward induction argument problems.