How Hidden Actions Change What People Believe in Conflicts

In the paper's words

In the graph model for conflict resolution (GMCR), a decision maker (DM) either moves the conflict to another state or does nothing, and every action that leaves the state unchanged is silently classified as inaction. Yet announcements, exercises of rights, leaks, and selective disclosures leave the physical state unchanged while changing what other DMs believe about which moves are available (capability) and which moves others would want to make (intention). We formalize such state-preserving actions by augmenting each state with the DMs' epistemic states: a physical move changes the physical state, a state-preserving action changes only the epistemic state, and inaction is the absence of any transition.

The abstract, verbatim, and its opening sentence is the claim. Every line below is quoted from the text.

Numbers it reports

1. We prove three structural results: evidence for a move can only enable perceived moves and evidence against can only disable them; two of the four canonical reduction operators discard one kind of evidence entirely; and contradictory assessments are absorbing under monotone accumulation, with $37/64 = 0.578125$ of a three-move observer's epistemic space absorbing.

   from Abstract

2. The worked model of Section 4.6 is a stylized four-state, two-DM reduction of the 1995 DVD format negotiation, not a faithful reconstruction of that negotiation's option table; its purpose is to exhibit the GMR/SEQ separation mechanism, not to reproduce historical stability findings.

   from 6. Discussion

3. Three structural results organize the framework: polarity confinement (evidence for a move can only enable it in the observer's perceived model, evidence against can only disable it), the evidence-blindness of two of the four canonical reduction operators, and the absorption of contradiction under monotone accumulation, with $37/64 = 0.578125$ of a three-move observer's epistemic space absorbing.

   from 7. Conclusion

How it is done

1. We prove three structural results: evidence for a move can only enable perceived moves and evidence against can only disable them; two of the four canonical reduction operators discard one kind of evidence entirely; and contradictory assessments are absorbing under monotone accumulation, with $37/64 = 0.578125$ of a three-move observer's epistemic space absorbing.

   from Abstract

2. The G-CSEA algorithm [5] extracts conflict sets causing infeasibility in pseudo-Boolean workforce-scheduling models via constraint-interaction graphs; its discipline of isolating minimal conflicting subsets parallels our reduction operators, which isolate which evidence items actually bear on a perceived move, and suggests a future integration in which epistemic rather than physical infeasibility sources are diagnosed.

   from 2. Background and Related Work

3. A graph model [1] is a tuple $G = (S, \{A_i\}_{i \in N}, \{\succ_i\}_{i \in N})$ where $S$ is a finite state set, $N$ is the finite DM set, $A_i \subseteq S \times S$ is DM $i$'s move relation, and $\succ_i$ is DM $i$'s strict preference order on $S$.

   from 3.1 Base model

4. Sequential stability (SEQ) [1]: as GMR, but the sanctioning response must itself be credible — formally, it must terminate in a state that is stable for the opponent.

   from 3.4 Stability concepts

What would falsify it

1. For each opponent $j \neq o$ and each potential move $m$ of $j$, the observer maintains a four-valued assessment $$a_o(m) \in \{T, F, N, B\},$$ where $T$ means supported, $F$ refuted, $N$ undecided, and $B$ both (contradictory evidence).

   from 3.2 Epistemic augmentation

2. The structural claims are falsifiable within the formalism.

   from 6. Discussion

3. Empirically, the claim that state-preserving actions matter would be falsified by a real negotiation dataset in which re-annotating announcements and disclosures as inaction leaves all stability classifications unchanged.

   from 6. Discussion

Where the claim stops

1. The counting results of Sections 4.2 and 4.3 rest on an independence assumption: each of the $k = 3$ perceived candidate moves accumulates evidence from an independent stream.

   from 6. Discussion

2. First, contradiction flooding: since $37/64 = 0.578125$ of the three-move epistemic space is absorbing under $\rho_1$, a realistic evidence stream that occasionally supplies both a $T$-bit and an $F$-bit for the same move will drive the observer into $B$ and freeze the perceived model; a practitioner using $\rho_1$ needs a contradiction-repair mechanism, which this framework deliberately does not supply.

   from 6. Discussion

3. Proposition 1 fails if some reduction operator maps increased $p_m$ to a decrease in the $T$-component; Proposition 2 fails if accumulation is non-monotone (for example, evidence decay or retraction), in which case $B$ need not absorb.

   from 6. Discussion

Where to read

1. Abstract224 words · 1 min
2. 1. Introduction455 words · 2 min
3. 2. Background and Related Work586 words · 3 min
4. 3. Methods542 words · 2 min
5. 4. Analysis1,278 words · 6 min
6. 5. Results311 words · 1 min
7. 6. Discussion554 words · 2 min
8. 7. Conclusion230 words · 1 min