A general technique for detecting equilibria in finite non cooperative games is proposed. Fundamental idea is that every equilibrium is characterized by a binary relation on the game strategies. This relation - called generative relation -- induces an appropriate domination concept. Game equilibrium is described as the set of non dominated strategies with… (More)
A generative relation for Aumann equilibrium is proposed. An evolutionary procedure based on nondomination with respect to the generative relation is used for detecting Aumann equilibrium.
In game theory, every equilibrium can be characterized by a binary relation on the game strategies. This relation - called generative relation - induces an appropriate solution concept. Game equilibrium is described as the set of non dominated strategies with respect to the generative relation. Evolutionary algorithms do not perform well for large games… (More)
Generative relations for different equilibria types in finite non cooperative games are proposed. These relations induce appropriate domination concepts. Using an evolutionary technique approximations for different equilibria are computed.The concept of game is extended in order to allow players to have different types of rationality. The new game allows us… (More)
Game theory models strategic and conflicting situations and offers several solution concepts that are known as game equilibria, among which the Nash equilibrium is probably the most popular one. A less known equilibrium, called the (k,t)-robust equilibrium, has recently been used in the context of distributed computing. The (k,t)-robust equilibrium combines… (More)