{'fraction_non_alphanumeric': 0.009977827050997782, 'fraction_numerical': 0.0, 'mean_word_length': 4.608695652173913, '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}}
On the Core and Dual Set of Linear Programming Games

We study the relation between the core of a given LP-game and the set of payoff vectors generated by optimal dual solutions to the corresponding linear program. It is well known that the set of dual payoffs is contained in the core, and that cores of games in which players are replicated converge to the set of dual payoffs when the number of replications tends to infinity. We give a necessary and sufficient condition for finite convergence. As corollaries we strengthen a sufficient condition due to Owen and obtain new conditions as well. We also study conditions in which the core and the set of dual payoffs coincide even without replication. We give a necessary and sufficient condition for this phenomenon and present two classes of LP-games with this property which properly subsumes all examples of this type discussed in the literature.