Minimality of Consistent Solutions for Strategic Games, in Particular for Potential Games
Solutions defined on classes of strategic games, satisfying One-Person Rationality (OPR), Non-emptiness (NEM) and Consistency (CONS) are considered. The main question to be answered is whether these conditions characterize the Nash Equilibrium solution NE for the given class of games. Depending on the structure of the class of games positive as well as negative answers are obtained. A graph-theoretical framework will be developed to express sufficient conditions for a positive or a negative answer. For the class of (finite) strategic games with at least one Nash equilibrium the answer is positive. For several classes of potential games the answer is negative.
To our knowledge, this item is not available for
download. To find whether it is available, there are three
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
Volume (Year): 7 (1996)
Issue (Month): 1 (January)
|Contact details of provider:|| Web page: http://link.springer.de/link/service/journals/00199/index.htm|
|Order Information:||Web: http://link.springer.de/orders.htm|
When requesting a correction, please mention this item's handle: RePEc:spr:joecth:v:7:y:1996:i:1:p:81-93. 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: (Guenther Eichhorn)or (Christopher F Baum)
If references are entirely missing, you can add them using this form.