{'fraction_non_alphanumeric': 0.016778523489932886, 'fraction_numerical': 0.0, 'mean_word_length': 4.740384615384615, '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}}
Games with Costly Winnings

We introduce a new sequential game, where each player has a limited resource that he needs to spend on increasing the probability of winning each stage, but also on maintaining the assets that he has won in the previous stages. Thus, the players’ strategies must take into account that winning at any given stage negatively affects the chances of winning in later stages. Whenever the initial resources of the players are not too small, we present explicit strategies for the players, and show that they are a Nash equilibrium, which is unique in an appropriate sense.