{'fraction_non_alphanumeric': 0.015580736543909348, 'fraction_numerical': 0.0, 'mean_word_length': 5.256637168141593, '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}}
Dynamic Ic and Dynamic Programming

This paper develops a dynamic programming method when the one-stage deviation principle in the sense of mechanism design literature doesn’t hold. The commonly used dynamic programming method is valid only if the one-stage deviation principle in the sense of mechanism design literature is satisfied; it doesn't hold in every model, and the one-stage deviation principle in the sense of repeated games does hold but requires the equilibrium strategy of every player off the equilibrium path and is impractical. The dynamic programming method developed in this paper requires transfinite induction, and therefore one needs to specify the stopping times for two dimensions.