Back to Search
Start Over
STABLE EXTENSIVE GAME FORMS.
- Source :
- Mathematics of Operations Research; Nov87, Vol. 12 Issue 4, p626-633, 8p
- Publication Year :
- 1987
-
Abstract
- Peleg established a fundamental theorem which says that convex effectivity functions are stable. He also proved its partial converse: Within the class of maximal effectivity functions, stability implies convexity. The present paper provides another partial converse: Within the class of α-effectivity functions derived from extensive game forms (without chance moves), stability implies convexity. It also provides a geometric characterization of the stability condition for the latter class. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 0364765X
- Volume :
- 12
- Issue :
- 4
- Database :
- Complementary Index
- Journal :
- Mathematics of Operations Research
- Publication Type :
- Academic Journal
- Accession number :
- 6982578
- Full Text :
- https://doi.org/10.1287/moor.12.4.626