Normal view MARC view ISBD view

An application of ramsey theorem to stopping games [Texte imprimé] / Groupe HEC, [Direction de la recherche] ; Nicolas Vieille

Auteur secondaire : : Vieille, Nicolas, Auteur secondaire collectivité : Groupe HEC, Jouy-en-Josas, Yvelines, Direction de la recherche, Langue :de résumé, Anglais.Publication :Jouy-en-Josas : Groupe HEC, Paris : Chambre de commerce et d'industrie, 2001Description : 1 vol. (13-VII p.) : tabl., graph. ; 21 cmISBN : 2-85418-746-6.Collections : Les cahiers de recherche, 746Résumé : 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. Journal of Economic Literature Classification Number: C72, C73.Bibliographie: Bibliogr. p. 11-12.Sujet - Nom d'actualité : Ramsey, Théorie de ;Mathématiques financières Sujet : Théorie jeu ;Jeu
Current location Call number Status Date due Barcode
Bib. Paris
EMP C 149 (746) Available EMP62332D

Bibliogr. p. 11-12

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. Journal of Economic Literature Classification Number: C72, C73

Powered by Koha

//]]>