Choice Overload and Height Ranking of Menus in Partially-Ordered Sets

When agents face incomplete information and their knowledge about the objects of choice is vague and imprecise, they tend to consider fewer choices and to process a smaller portion of the available information regarding their choices. This phenomenon is well-known as choice overload and is strictly related to the existence of a considerable amount of option-pairs that are not easily comparable. Thus, we use a finite partially-ordered set (poset) to model the subset of easily-comparable pairs within a set of options/items. The height ranking, a new ranking rule for menus, namely subposets of a finite poset, is then introduced and characterized. The height ranking rule ranks subsets of options in terms of the size of the longest chain that they include and is therefore meant to assess menus of available options in terms of the maximum number of distinct and easily-comparable alternative options that they offer.