rancher/jettech-kube-webhook-certgen

To describe a state flow in situational theory of conflict we propose a model that combines the theory of Markov chains and game theory as a finite-state machine. To calculation of normalized payoff we used conjugate Markov chain whose states are the possible players winnings. As an example the rancher problem and the gardener problem as semideterministic automata of Bayes type are considered. Mathematics Subject Classification: 60J20, 90C40, 91-04, 93C85