Abstract
Boolean functions are used to represent individuals' decisions, which are functions of other individuals' decisions. Thus, a set of Boolean functions can be used to represent a n-player strategic form game. To find the equilibria of the game is thus to find the fixed points of the Boolean functions. This paper derives an algorithm to find such fixed points. The algorithm is useful when, in a game, the actions of the players are {0,1} decisions, the players are asymmetric, there are many players, and we know the players' decisions but not their payoffs. An example, together with a Matlab program, demonstrates how to use the algorithm to solve a complex decision problem.
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.
