this is for holding javascript data
ZoƩ Christoff edited section_Colorability_and_unanimity_In__.tex
about 8 years ago
Commit id: 4df3282ff0dca10cc2110e83fd35c4facaf1c874
deletions | additions
diff --git a/section_Colorability_and_unanimity_In__.tex b/section_Colorability_and_unanimity_In__.tex
index fe89b8d..a101047 100644
--- a/section_Colorability_and_unanimity_In__.tex
+++ b/section_Colorability_and_unanimity_In__.tex
...
Fix an opinion profile $\O$ and a (non-necessarily functional) influence profile $\G$. Consider the stream $\O^0, \O^1, \ldots, \O^n, \ldots$ of opinion profiles recursively defined as follows:
\begin{itemize}
\item Base: $\O_0 := \O$
\item %\item Step: for all $i \in \N$, $j\in \{1,...,m\}$, $\O_i^{n+1}(p_j)$ is given by:
\begin{itemize}
\item %\begin{itemize}
%\item $\O_i^{n+1}(p_j)=\O_i^{n}(p_j)$ if for some $j,k\in R_j(i)$,$\O_j^{n}(p_j)\neq \O_k^{n}(p_j)$, and
\item %\item $\O_i^{n+1}(p_j)\neq \O_i^{n}(p_j)$ otherwise.
\end{itemize} %\end{itemize}
I AM NOT CONVINCED BY THE ABOVE STEP. MAYBE THIS (I ALSO SIMPLIFY NOTATION):
\item for all $i \in \N$, $p \in \Atoms$:
\begin{itemize}
\item
\begin{align}