Feasibility/Desirability Games for Normal Form Games, Choice Models and Evolutionary Games

An abstraction of normal form games is proposed, called Feasibility/Desirability Games (or FD Games in short). FD Games can be seen from three points of view: as a new presentation of games in which Nash equilibria can be found, as choice models in microeconomics or as a model of evolution in games. In this article, we show that if one considers such a game as a unique decision maker and if the relation of the game called feasible and more desirable choice is acyclic (i.e., with no path from a node to itself), then the function that yields the abstract Nash equilibria is a choice correspondence. We show how an actual decision maker can be made, namely it can be implemented as a game and the choices he makes are abstract Nash equilibria. Hence we say that a decision maker can be constituted of many agents, which is not a surprise. Think of a