{'fraction_non_alphanumeric': 0.028, 'fraction_numerical': 0.0, 'mean_word_length': 5.109756097560975, '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}}
goal problems in gambling theory

A short introduction to goal problems in abstract gambling theory is given, along with statementes of some of the main theorems and a number of examples, open problems and references. Emphasis is on the finite-state, countably-additive setting with such classical objectives as reaching a goal, hitting a goal  infinitely often, staying in the goal, and maximizing the average time spent at a goal. keywords: gambling theory, stochastic processes, Markov strategies.