Premium
Choice via grouping procedures
Author(s) -
Matsuki Jun,
Tadenuma Koichi
Publication year - 2018
Publication title -
international journal of economic theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.351
H-Index - 11
eISSN - 1742-7363
pISSN - 1742-7355
DOI - 10.1111/ijet.12144
Subject(s) - axiom , transitive relation , mathematical economics , revealed preference , preference relation , preference , choice function , independence (probability theory) , set (abstract data type) , axiom independence , path (computing) , independence of irrelevant alternatives , mathematics , decision maker , choice set , function (biology) , bounded function , social choice theory , computer science , combinatorics , econometrics , operations research , statistics , mathematical analysis , geometry , evolutionary biology , biology , programming language
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 [Manzini, P., 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 [Manzini, P., 2007]). Third, grouping choice methods are also characterized by a weak version of path independence.