We define generalized (preference) domains <InlineEquation ID="IEq1"> <EquationSource Format="TEX">$\mathcal{D}$</EquationSource> </InlineEquation> as subsets of the hypercube {−1,1}<Superscript> D </Superscript>, where each of the D coordinates relates to a yes-no issue. Given a finite set of n individuals, a profile assigns each individual to an element of <InlineEquation ID="IEq2"> <EquationSource Format="TEX">$\mathcal{D}$</EquationSource> </InlineEquation>. We prove that, for any domain <InlineEquation ID="IEq3"> <EquationSource...</equationsource></inlineequation></equationsource></inlineequation></superscript></equationsource></inlineequation>

We define generalized (preference) domains D as subsets of the hypercube {− 1, 1 } D , where each of the D coordinates relates to a yes-no issue. Given a finite set of n individuals, a profile assigns each individual to an element of D . We prove that the outcome of issue-wise majority...

In many real-world group decision making problems, the set of alternatives is a Cartesian product of finite value domains for each of a given set of variables (or issues). Dealing with such domains leads to the following well-known dilemma: either ask the voters to vote separately on each issue,...