Bernardo and Ledoit (2000) develop a very appealing framework to compute pricing bounds based on the so-called gain-loss ratio. Their method has many advantages and very interesting properties and so far one important drawback: the complexity of the numerical computation of the pricing bounds....

In Young (1993, 1998) agents are recurrently matched to play a finite game and almost always play a myopic best reply to a frequency distribution based on a sample from the recent history of play. He proves that in a generic class of finite n-player games, as the mutation rate tends to zero,...

In this paper we discuss the significant computational simplification that occurs when option pricing is approached through the change of numeraire technique. The original impetus was a recently published paper (Hoang, Powell, Shi 1999) on endowment options; in the present paper we extend these...