We establish a new sufficient condition for avoiding a generalized Anscombe’s paradox. In a situation where votes describe positions regarding finitely many yes-or-no issues, the Anscombe’s α-paradox holds if more than α% of the voters disagree on a majority of issues with the outcome of...

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>

The purpose of the model is to analyse the genesis and evolution of consumption oriented chat rooms in the Web space. We study an endogeneous consumption dynamics in which individuals make their buying decisions on the basis of a threefold information: their own consumption past experience...

Abstract We extend the Shapley-Scarf model of markets for indivisible goods without money to the case where couples of agents have joint preferences over the set of allocations. We show that the domain of (weakly) lexicographic preferences is maximal (for inclusion) for the existence of Core...