Difference between revisions of "Game Theory"
Line 20: | Line 20: | ||
Game Theory can also be used to describe many situations in our daily life and Machine Learning models. [http://towardsdatascience.com/game-theory-in-artificial-intelligence-57a7937e1b88 Game Theory in Artificial Intelligence | Pier Paolo Ippolito - Towards Data Science] | Game Theory can also be used to describe many situations in our daily life and Machine Learning models. [http://towardsdatascience.com/game-theory-in-artificial-intelligence-57a7937e1b88 Game Theory in Artificial Intelligence | Pier Paolo Ippolito - Towards Data Science] | ||
+ | |||
+ | == Nash Equilibrium == | ||
+ | The Nash Equilibrium is a condition in which all the players involved in the game agree that there is no best solution to the game than the actual situation they are in at this point. None of the players would have an advantage in changing their current strategy (based on the decisions made by the other players). Following our example of before, an example of Nash Equilibrium can be when the [[Support Vector Machine (SVM)]] classifier agrees on which hyper-plane to use classify our data. | ||
+ | |||
+ | == Prisoner’s Dilemma == | ||
+ | |||
+ | The prisoner's dilemma is a paradox in decision analysis in which two individuals acting in their own self-interests do not produce the optimal outcome. The typical prisoner's dilemma is set up in such a way that both parties choose to protect themselves at the expense of the other participant. As a result, both participants find themselves in a worse state than if they had cooperated with each other in the decision-making process. The prisoner's dilemma is one of the most well-known concepts in modern game theory. [http://www.investopedia.com/terms/p/prisoners-dilemma.asp Prisoner's Dilemma | Jim Chappelow - Investopedia] | ||
+ | |||
+ | http://miro.medium.com/max/568/1*N4LRMGzXdDSKUx--yeyfLQ.png | ||
+ | |||
+ | <youtube>GsBWQMDhshI</youtube> | ||
+ | <youtube>6w7DrbaVwTc</youtube> | ||
+ | |||
+ | == Classification Algorithm == | ||
+ | |||
+ | For example, a Classification algorithm such as [[Support Vector Machine (SVM)]] can be explained in terms of a two-player game in which one player is challenging the other to find the best hyper-plane giving him the most difficult points to classify. The game will then converge to a solution which will be a trade-off between the strategic abilities of the two players (eg. how well the fist player was challenging the second one to classify difficult data points and how good was the second player to identify the best decision boundary). | ||
<youtube>jwlteKFyiHU</youtube> | <youtube>jwlteKFyiHU</youtube> | ||
<youtube>4WGbCJQU6BU</youtube> | <youtube>4WGbCJQU6BU</youtube> |
Revision as of 20:28, 5 July 2020
Youtube search... ...Google search
- Reinforcement Learning (RL)
- Gaming
- Deep Distributed Q Network Partial Observability
- Markov Decision Process (MDP)
Game Theory is a branch of mathematics used to model the strategic interaction between different players in a context with predefined rules and outcomes. Game Theory can be applied in different ambit of Artificial Intelligence:
- Multi-agent AI systems.
- Imitation and Reinforcement Learning (RL).
- Adversary training in Generative Adversarial Network (GAN)s.
Game Theory can also be used to describe many situations in our daily life and Machine Learning models. Game Theory in Artificial Intelligence | Pier Paolo Ippolito - Towards Data Science
Nash Equilibrium
The Nash Equilibrium is a condition in which all the players involved in the game agree that there is no best solution to the game than the actual situation they are in at this point. None of the players would have an advantage in changing their current strategy (based on the decisions made by the other players). Following our example of before, an example of Nash Equilibrium can be when the Support Vector Machine (SVM) classifier agrees on which hyper-plane to use classify our data.
Prisoner’s Dilemma
The prisoner's dilemma is a paradox in decision analysis in which two individuals acting in their own self-interests do not produce the optimal outcome. The typical prisoner's dilemma is set up in such a way that both parties choose to protect themselves at the expense of the other participant. As a result, both participants find themselves in a worse state than if they had cooperated with each other in the decision-making process. The prisoner's dilemma is one of the most well-known concepts in modern game theory. Prisoner's Dilemma | Jim Chappelow - Investopedia
Classification Algorithm
For example, a Classification algorithm such as Support Vector Machine (SVM) can be explained in terms of a two-player game in which one player is challenging the other to find the best hyper-plane giving him the most difficult points to classify. The game will then converge to a solution which will be a trade-off between the strategic abilities of the two players (eg. how well the fist player was challenging the second one to classify difficult data points and how good was the second player to identify the best decision boundary).