The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Nash equilibrium is an important solving concept in Game Theory. Playing in Nash sense means that no player (agent) wants to deviate from the equilibrium strategy in order to increase the payoff. Some games can have more Nash equilibria. Several refinements have been developed. Strong Berge Pareto equilibrium is an important refinement of the Nash equilibrium. An evolutionary technique based on non-domination...
Aumann equilibrium is a game situation from which no coalition of players has a joint deviation that improve the payoff of each member of the coalition. Congestion games has a large field of applications. An evolutionary technique for detecting Aumann equilibrium in this class of games is presented. The experiments prove the effectiveness of the proposed technique.
Two important network system problems, the job scheduling, and the bin packing problem are presented from a game theoretical perspective. Solution concepts are related to Nash and Aumann equilibria. The concept of Aumann equilibrium is viewed from a different perspective. A generative relation of the Aumann equilibrium is considered. A generative relation is used for the evolutionary detection of...
We describe the design and construction of a testbed used in class to illustrate different strategies for decision making. In this model, we implement two classical game-theoretical approaches, which depend on a payoff matrix. Each of these matrices is calculated based on the multiattribute utility theory. The methods that we describe are: non-cooperative game theory and an evolutionary game-theoretical...
The paper presents the game description of multi-objective optimization design problem and takes the design objectives as different players. By calculating the affecting factors of the design variables to objective functions and fuzzy clustering, the design variables are divided into different strategic spaces owned by each player. Then it uses Nash equilibrium game model, coalition cooperative game...
Achieving the Nash equilibria for single objective games is known to be a computationally difficult problem. However there is a special class of equilibria called evolutionary robust equilibria which can be obtained through a special type of evolutionary dynamics called the replicator dynamics. This dynamics has special properties over the simplex, which has been studied in optimization theory to...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.