Quitting games are sequential games in which, at any stage, each player has the choice between continuing and quitting. The game ends as soon as at least player chooses to quit; player i then receives a payoff r, which depends on the set S of players that did choose to quit. If the game never ends, the payoff to each player is 0. We prove the existence of cyclic E-equilibrium under some assumptions on the payoff function (r sub s). We prove on an example that our result is essentially optimal. We also discuss the relation to Dynkin's stopping games, and provide a generalization of our result to these games.
|Date of creation:||Sep 1998|
|Date of revision:|
|Contact details of provider:|| Postal: |
Web page: http://www.kellogg.northwestern.edu/research/math/
More information through EDIRC
|Order Information:|| Email: |
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Janos Flesch & Frank Thuijsman & Koos Vrieze, 1997. "Cyclic Markov Equilibria in Stochastic Games," International Journal of Game Theory, Springer, vol. 26(3), pages 303-314.
- Wilson, Robert, 1992. "Strategic models of entry deterrence," Handbook of Game Theory with Economic Applications, in: R.J. Aumann & S. Hart (ed.), Handbook of Game Theory with Economic Applications, edition 1, volume 1, chapter 10, pages 305-329 Elsevier.
When requesting a correction, please mention this item's handle: RePEc:nwu:cmsems:1227. 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: (Fran Walker)
If references are entirely missing, you can add them using this form.