Choice via grouping procedures

In this paper, we consider a natural procedure of decision‐making, the grouping choice methods, which leads to a kind of bounded rational choice. In this procedure a decision‐maker first divides the set of available alternatives into some groups and in each group she chooses the best element (winner) for her preference relation. Then, among the winners in the first round, she selects the best one as her final choice. We characterize grouping choice methods in three different ways. First, we show that a choice function is a grouping choice method if and only if it is a rational shortlist method (Manzini and Mariotti 2007 ) in which the first rationale is transitive. Second, grouping choice methods are axiomatically characterized by means of a new axiom called elimination, in addition to two well‐known axioms, expansion and weak WARP (Manzini and Mariotti 2007 ). Third, grouping choice methods are also characterized by a weak version of path independence.