An Application of Ramsey Theorem to Stopping Games
We prove that every two-player non zero-sum deterministic stopping game with uniformly bounded payoffs admits an e-equilibrium, for every e>0. The proof uses Ramsey Theorem that states that for every coloring of a complete infinite graph by finitely many colors there is a complete infinite subgraph which is monochromatic.
(This abstract was borrowed from another version of this item.)
|Date of creation:||Jul 2001|
|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.:
- Dinah Rosenberg & Eilon Solan & Nicolas Vieille, 1999. "Stopping Games with Randomized Strategies," Discussion Papers 1258, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Eilon Solan & Nicolas Vieille, 2002.
"Quitting games - An example,"
- Solan, Eilon & Vieille, Nicolas, 2001. "Quitting Games," Economics Papers from University Paris Dauphine 123456789/6017, Paris Dauphine University.
- Fine, Charles H. & Li, Lode, 1989. "Equilibrium exit in stochastically declining industries," Games and Economic Behavior, Elsevier, vol. 1(1), pages 40-59, March.
- Vrieze, O J & Thuijsman, F, 1989. "On Equilibria in Repeated Games with Absorbing States," International Journal of Game Theory, Springer, vol. 18(3), pages 293-310.
When requesting a correction, please mention this item's handle: RePEc:nwu:cmsems:1323. 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.