On Connections Between Renegotiation Proof Sets of Long Finitely and Infinitely Repeated Games with Low Discounting
This paper looks at connections between Renegotiation Proof Equilibrium sets for finitely and infinitely repeated games. We look at the Benoit and Krishna (1993) definition of renegotiation proof sets for discounted finitely repeated games. We focus on the long run behaviour of these sets for low discounting. If these sets converge to a set when the time horizon goes to infinity, then this limit set is an Internally Renegotiation Proof set (almost) for the corresponding infinitely repeated game as defined by Ray (1994). However, if such a limit does not exist, then the collection of the limit point sets can look like a collection of non-stationary internally renegotiation proof sets.
To our knowledge, this item is not available for
download. To find whether it is available, there are three
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
|Date of creation:||Jan 1996|
|Date of revision:|
|Contact details of provider:|| Web page: http://sticerd.lse.ac.uk/_new/publications/default.asp|
When requesting a correction, please mention this item's handle: RePEc:cep:stitep:304. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: ()
If references are entirely missing, you can add them using this form.