{'fraction_non_alphanumeric': 0.03890641430073607, 'fraction_numerical': 0.004206098843322818, 'mean_word_length': 5.52054794520548, '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}}
Probabilistic Preferences in the Graph Model for Conflict Resolution

We present a generalization of the graph model for conflict resolution, introducing the possibility of decision makers (DMs) expressing their preferences among the possible scenarios through probabilistic preferences. In this new scenario, four stability definitions (solution concepts) are proposed: 1) α-Nash stability; 2) (α, β)-metarationality; 3) (α, β)-symmetric metarationality; and 4) (α, β, γ)-sequential stability. We deal with conflicts that involve two or more DMs. Relationships between these definitions are demonstrated, as well as an analysis of how the values of the parameters α, β, and y influence the set of stable states is made. Applications of the proposed model to conflicts involving two and three DMs are presented. The analysis of these applications highlights the advantages gained by allowing individuals to express their preferences probabilistically.