A non-cooperative game is a form of game under the topic of game theory. Non-cooperative games are used in situations where there are competition between the players of the game. In this model, there are no external rules that enforces the cooperation of the players therefore it is typically used to model a competitive environment. This is stated in various accounts most prominent being John Nash's paper.
That being said, there are many arguments to be made regarding this point as with decades of research, it is shown that non-cooperative game models can be used to show cooperation as well and vice versa for cooperative game model being used to show competition.
Some examples of this would be the usage of non-cooperative model in determining the stability and sustainability of cartels and coalitions.
Non zero-sum games and zero-sum games are both types of non-cooperative games.
Referring to the above mentioned John Nash's 1951 article in the journal Annals of Mathematics. Nash Equilibrium, non-cooperative game theory in fact, are often referred to as "non-cooperative equilibrium".
According to Tamer Başar in Lecture Notes on Non-Cooperative Game Theory, a non-cooperative game requires specifying:
the number of players;
the possible actions available to each player, and any constraints that may be imposed on them;
the objective function of each player which he or she attempts to optimise;
any time ordering of the execution of the actions if the players are allowed to act more than once;
any information acquisition that takes place and how the information available to a player at each point in time depends on the past actions of other players, and;
whether there is a player (nature) whose action is the outcome of a probabilistic event with a fixed (known) distribution.
The utility of each player for all action profile.
Perfect recall: each player remembers their decisions and known information.
Self-interest: each player does not consider the effect of actions on the others but only on their own.
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
Software agents are widely used to control physical, economic and financial processes. The course presents practical methods for implementing software agents and multi-agent systems, supported by prog
Game theory deals with multiperson strategic decision making. Major fields of Economics, such as Microeconomics, Corporate Finance, Market Microstructure, Monetary Economics, Industrial Organization,
Students will be able to formulate a multi-agent decision-making problem as a game and apply relevant mathematical theories and algorithms to analyze the interaction of the agents and predict the outc
Tit for tat is an English saying meaning "equivalent retaliation". It developed from "tip for tap", first recorded in 1558. It is also a highly effective strategy in game theory. An agent using this strategy will first cooperate, then subsequently replicate an opponent's previous action. If the opponent previously was cooperative, the agent is cooperative. If not, the agent is not. Tit-for-tat has been very successfully used as a strategy for the iterated prisoner's dilemma.
A coordination game is a type of simultaneous game found in game theory. It describes the situation where a player will earn a higher payoff when they select the same course of action as another player. The game is not one of pure conflict, which results in multiple pure strategy Nash equilibria in which players choose matching strategies. Figure 1 shows a 2-player example.
In game theory, the Nash equilibrium, named after the mathematician John Nash, is the most common way to define the solution of a non-cooperative game involving two or more players. In a Nash equilibrium, each player is assumed to know the equilibrium strategies of the other players, and no one has anything to gain by changing only one's own strategy. The principle of Nash equilibrium dates back to the time of Cournot, who in 1838 applied it to competing firms choosing outputs.
The RIde-hail VEhicle Routing (RIVER) problem describes how drivers in a ride-hail market form a dynamic routing strategy according to the expected reward in each zone of the market. We model this decision-making problem as a Markov decision process (MDP), ...
One prominent approach toward resolving the adversarial vulnerability of deep neural networks is the two-player zero-sum paradigm of adversarial training, in which predictors are trained against adversarially-chosen perturbations of data. Despite the promi ...
2023
, ,
Can artificial agents benefit from human conventions? Human societies manage to successfully self-organize and resolve the tragedy of the commons in common-pool resources, in spite of the bleak prediction of non-cooperative game theory. On top of that, rea ...
International Foundation for Autonomous Agents and Multiagent Systems2022