{'fraction_non_alphanumeric': 0.023172905525846704, 'fraction_numerical': 0.0, 'mean_word_length': 4.854166666666667, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Probabilistic equilibrium solution of soft games

In this paper, we give a probabilistic equilibrium solution method of two-person soft games (tps-games). This method can overcome the problem that could not be solved by soft saddle points, soft lower and soft upper values, soft dominated strategies and soft Nash equilibrium. We also prove that every finite tps-game with probabilistic strategies has at least one solution for at least one player. Finally, we give a numerical example which shows that the method can be successfully applied to the game theory.