{'fraction_non_alphanumeric': 0.02389937106918239, 'fraction_numerical': 0.005031446540880503, 'mean_word_length': 5.03030303030303, '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 Compromise Stable Extension of Bankruptcy Games: Multipurpose Resource Allocation

This paper considers situations characterized by a common-pool resource, which needs to be divided among agents. Each of the agents has some claim on this pool and an individual reward function for assigned resources. This paper analyzes not only the problem of max- imizing the total joint reward, but also the allocation of these rewards among the agents. Analyzing these situations a new class of transferable utility games is introduced, called multipurpose resource games. These games are based on the bankruptcy model, as intro- duced by O'Neill (1982). It is shown that every multipurpose resource game is compromise stable. Moreover, an explicit expression for the nucleolus of these games is provided.