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,...

This paper studies a class of Markov models which consist of two components. Typically, one of the components is observable and the other is unobservable or 'hidden'. Conditions under which (a form of) geometric ergodicity of the unobservable component is inherited by the joint process formed of...

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....