Minimality of consistent solutions for strategic games, in particular for potential games
AbstractSolutions 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.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by Tilburg University in its series Open Access publications from Tilburg University with number urn:nbn:nl:ui:12-72912.
Date of creation: 1996
Date of revision:
Publication status: Published in Economic Theory (1996) v.7, p.81-93
Contact details of provider:
Web page: http://www.tilburguniversity.edu/
Other versions of this item:
- Peleg, Bezalel & Potters, Jos A M & Tijs, Stef H, 1996. "Minimality of Consistent Solutions for Strategic Games, in Particular for Potential Games," Economic Theory, Springer, vol. 7(1), pages 81-93, January.
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
This item has more than 25 citations. To prevent cluttering this page, these citations are listed on a separate page. reading list or among the top items on IDEAS.Access and download statistics
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Economists Online Support).
If references are entirely missing, you can add them using this form.