Abstract
We propose a finite-horizon continuous-time framework for coalitional bargaining, in which players can make offers at random discrete times. In our model: (i) expected payoffs in Markov perfect equilibrium (MPE) are unique, generating sharp predictions and facilitating comparative statics; and (ii) MPE are the only subgame perfect Nash equilibria (SPNE) that can be approximated by SPNE of nearby discrete-time bargaining models. We investigate the limit MPE payoffs as the time horizon goes to infinity and players get infinitely patient. In convex games, we establish that the set of these limit payoffs achievable by varying recognition rates is exactly the core of the characteristic function. (JEL C78)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.