{'fraction_non_alphanumeric': 0.018683274021352312, 'fraction_numerical': 0.0, 'mean_word_length': 4.98404255319149, '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}}
Do Stable Outcomes Survive in Marriage Problems with Myopic and Farsighted Players?

We consider marriage problems where myopic and farsighted players interact. To study such problems, we use the pairwise myopic-farsighted stable set. Blocking occurs by coalitions of size one or two. We require that all blocking players should strictly improve. We pay particular attention to the question whether core elements survive in this environment. This is the case when all players are myopic as well as when all players are farsighted. It also holds for matching problems satisfying the top-coalition property. For general matching problems where all women are farsighted, there is only one core element that can belong to the pairwise myopic-farsighted stable set, the woman-optimal stable matching, so all other stable outcomes are excluded for sure. If the woman-optimal stable matching is dominated from the woman point of view by an individually rational matching, then the pairwise myopic farsighted stable set cannot contain a core element. We show that blocking by coalitions of arbitrary size leads to identical results.