A choice function is a symmetric revealed core if there exists a symmetric irreflexive ‘dominance’ digraph such that choice sets consist precisely of the locally undominated outcomes of the latter. Symmetric revealed pseudocores are similarly defined by omitting the irreflexivity requirement...

A parameterized characterization of height-based total extensions of principal filtral opportunity rankings is provided and shown to include, as a special case, a version of the well-known Pattanaik-Xu characterization of the cardinality-based ranking. ***** <p>Se presenta una caracterización...</p>

It is shown that the median voter theorem for committee-decisions holds over a full unimodal preference domain whenever (i) the underlying median interval space satisfi?es interval antiexchange and (ii) unimodality is defi?ned with respect to the incidence-geometry of the relevant outcome space...

It is argued that if a finite partially ordered population is given, and incomparability is taken as the relevant type of dissimilarity, then diversity comparisons between subpopulations may be conveniently based on widths namely on the maximum number of pairwise incomparable units they include....

Two distinct specifications of single peakedness as currently met in the relevant literature are singled out and discussed. Then, it is shown that, under both of those specifications, a voting rule as defined on a bounded distributive lattice is strategy-proof on the set of all profiles of...

A clutter on a set X is a simple hypergraph with pairwise not-comparable hyperedges, hence in particular any set of Von Neumann-Morgenstern (VNM) -stable sets of an irreflexive simple digraph is a clutter. A clutter (X,E) is representable by VNM-stable sets or VNM if there exists an irreflexive...

Characterizations of the choice functions that select the cores or the externally stable cores induced by an underlying revealed dominance digraph are provided. Relying on such characterizations, the basic order-theoretic structure of the corresponding sets of revealed cores is also analyzed

The choice functions that are consistent with selections of VNM-stable sets of an underlying revealed dominance digraph are characterized both under VNM-perfection of the latter and in the general case.