One area where decision trees are applied is Game Theory, which uses models to study interactions of formalized incentive structures. It is widely used in various fields: economics, politics, biology, sociology, psychology, philosophy and computer science among others.

In game theory, decision trees are used in the so-called extensive form, which models games that present some order. In them there is always an initial node from which several arrows point to other nodes and the methodology explained above is reproduced, each branch reaching a vector of numbers.

It is also possible that games extensively model simultaneous games, these are represented with a dashed line between the nodes that a player has to choose without knowing in advance the option chosen by the other, taking this an anticipated decision vector without knowing which of those nodes he will be in, the classic example would be that of the rock, paper or scissors game.

A type of variant of decision trees would be those that concern simultaneous games.

Simultaneous games are those games in which the players make the decision at the same time, and therefore neither of them knows what decision the other has made before choosing. An example of this type of game would be Rock, Paper, Scissors. In which the players have to choose one of those three options without knowing which of them the rest will choose.

In the decision trees this is represented by adding a variant to those previously described, as player number two does not know which node he is in, so he could be in any of them, these are joined by a dashed line, showing his inability to know which node he is in. So your decision will be totally independent of the one chosen by the other player.

In the design of computer applications, a decision tree indicates the actions to be performed based on the value of one or several variables.

It is a representation in the form of a tree whose branches branch depending on the values ​​taken by the variables and which end in a specific action. It is usually used when the number of conditions is not very large (in this case, it is better to use a decision table).

More specifically, referring to the business field, we can say that decision trees are diagrams of sequential decisions that show us their possible results. These help companies determine what their options are by showing them the different decisions and their results. The option that avoids a loss or produces an extra profit has value. The ability to create an option, therefore, has a value that can be bought or sold.

One area where decision trees are applied is Game Theory, which uses models to study interactions of formalized incentive structures. It is widely used in various fields: economics, politics, biology, sociology, psychology, philosophy and computer science among others.

In game theory, decision trees are used in the so-called extensive form, which models games that present some order. In them there is always an initial node from which several arrows point to other nodes and the methodology explained above is reproduced, each branch reaching a vector of numbers.

It is also possible that games extensively model simultaneous games, these are represented with a dashed line between the nodes that a player has to choose without knowing in advance the option chosen by the other, taking this an anticipated decision vector without knowing which of those nodes he will be in, the classic example would be that of the rock, paper or scissors game.

A type of variant of decision trees would be those that concern simultaneous games.

Simultaneous games are those games in which the players make the decision at the same time, and therefore neither of them knows what decision the other has made before choosing. An example of this type of game would be Rock, Paper, Scissors. In which the players have to choose one of those three options without knowing which of them the rest will choose.

In the decision trees this is represented by adding a variant to those previously described, as player number two does not know which node he is in, so he could be in any of them, these are joined by a dashed line, showing his inability to know which node he is in. So your decision will be totally independent of the one chosen by the other player.

In the design of computer applications, a decision tree indicates the actions to be performed based on the value of one or several variables.

It is a representation in the form of a tree whose branches branch depending on the values ​​taken by the variables and which end in a specific action. It is usually used when the number of conditions is not very large (in this case, it is better to use a decision table).

More specifically, referring to the business field, we can say that decision trees are diagrams of sequential decisions that show us their possible results. These help companies determine what their options are by showing them the different decisions and their results. The option that avoids a loss or produces an extra profit has value. The ability to create an option, therefore, has a value that can be bought or sold.