Commitment Through Incomplete Information in a Simple Repeated Bargaining Model
The paper analyzes a finitely repeated bargaining game with asymmetric information. It gives a precise characterization of the equilibrium path and the equilibrium payoffs of all sequential equilibria satisfying a weak Markov property. The method used allows for arbitrarily many different types and provides an intuitive understanding of how "reputation" works. It is shown that the seller can use the incomplete information about his costs to credibly threaten never to accept a price lower than his highest possible costs before the very end of the game. This result is independent of the discount factors of the two players.
(This abstract was borrowed from another version of this item.)
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:||1989|
|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:200. 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.