deletions | additions       diff --git a/untitled.tex b/untitled.tex  index 45bd8de..c0ba597 100644  --- a/untitled.tex  +++ b/untitled.tex 
...
\subsection{Binary aggregation}  \begin{definition}[\emph{BA} structure] \label{BAstructure} \begin{definition}\label{BAstructure}  A binary aggregation structure (BA structure) is a tuple $\mathcal S = \tuple{\N,\I}$ where:  \begin{itemize}  \item $\N=\{1,\dots,n\}$ is a finite set individuals s.t. $|\N|$ is odd\footnote{The assumption guarantees that the majority rule we are going to introduce below is unbiased between accepting or rejecting issues (cf. \cite[Ch. 2]{GrossiPigozzi2014}). It could be dropped at the expense of adding some further technicalities to the framework.} and $\geq 3$;