This paper studies two player stopping games in a discrete time multiple prior framework with a finite time horizon. Optimal stopping times as well as recursive formulas for the value processes of the games are derived. These results are used to characterize the set of no-arbitrage prices for a...

We reformulate the Humean farmer game on the basis of random assignment of advantage and the cost e of helping in another’s harvest. The result is a game that is a coordination game if e < ½ or a dominant strategy Prisoner’s Dilemma Game if e > ½ which allows a joint treatment of the two interpretations of the Humean farmer game. We employ two...</½>