{'fraction_non_alphanumeric': 0.018095238095238095, 'fraction_numerical': 0.0, 'mean_word_length': 5.005714285714285, '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}}
Activity selection games and the minimum-cut problem

The connection between the minimum-cut problem in a capacitated network and certain combinatorial problems is well-known. This article presents and analyzes a selection problem in the context of a cooperative game, with emphasis on the key role of associated minimum-cut problems. Each coalition selects economic activities from private activities available to its members and public activities available to all coalitions. For each coalition, a minimum-cut problem finds an optimal selection and the value of the characteristic function. The game is a convex game. Applying the Greedy Algorithm involves solving n minimum-cut problems, where n is the number of players. The solution of n minimum-cut problem determines whether a proposed payoff vector is in the core. An optimal selection of activities varies monotonically with the coalition membership and with the value of each activity. The Shapley value and each extreme point of the core vary monotonically with the value of each activity.