Abstract
For binary action games we present three properties which have in common that they are defined by conditions on marginal payoffs. The first two properties guarantee the existence of a special type of Nash equilibrium called semi-strict Nash equilibrium, for which we also show an algorithm to locate. The third one guarantees the existence of an exact potential, and can realize the aforementioned two properties in a class of exact potential games. The first one guarantees the existence of a generalized ordinal potential. Each symmetric binary action game possesses all the three properties. The results are illustrated by three applications.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
