deletions | additions       diff --git a/section_Binary_aggregation_and_DeGroot__.tex b/section_Binary_aggregation_and_DeGroot__.tex  index e63cbcc..34a28ca 100644  --- a/section_Binary_aggregation_and_DeGroot__.tex  +++ b/section_Binary_aggregation_and_DeGroot__.tex 
...
The formalism of choice for this paper is binary aggregation \cite{grandi13lifting}.  A binary aggregation structure (\emph{BA structure}) is a tuple $\S = \tuple{\N,\Atoms}$ where:  \begin{itemize}[noitemsep] \begin{itemize}%[noitemsep]  \item $\N = \set{1,\dots,n}$ is a finite set individuals s.t. $|\N|= n \in \mathbb{N}$;  \item $\Atoms = \set{p_1,\dots,p_m}$ is a finite set of issues ($|\Atoms|= m \in \mathbb{N}$), each represented by a propositional atom.  \end{itemize}