{'fraction_non_alphanumeric': 0.015486725663716814, 'fraction_numerical': 0.0, 'mean_word_length': 5.380281690140845, '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}}
A Note on NTU convexity and Population Monotonic Allocation Schemes

For cooperative games with transferable utility, convexity has turned out to be an important and widely applicable concept, mainly because it implies some very nice and handy properties. One of these is that every extended marginal vector constitutes a population monotonic allocation scheme. In this note, this well-known result is generalised to games with nontransferable utility.