Choice via Grouping Procedures
In this paper, we consider a natural procedure of decision-making, called a “Grouping Choice Method”, which leads to a kind of bounded rational choices. In this procedure a decision-maker (DM) 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.
|Date of creation:||Sep 2013|
|Date of revision:|
|Contact details of provider:|| Phone: +81-42-580-8000|
Web page: http://www.econ.hit-u.ac.jp/
More information through EDIRC
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Koichi Tadenuma, 2005.
"Egalitarian-equivalence and the Pareto principle for social preferences,"
Social Choice and Welfare,
Springer, vol. 24(3), pages 455-473, 06.
- Tadenuma, Koichi, 2002. "Egalitarian-Equivalence and the Pareto Principle for Social Preferences," Discussion Paper 128, Center for Intergenerational Studies, Institute of Economic Research, Hitotsubashi University.
- Tadenuma, Koichi, 2002. "Egalitarian-Equivalence and the Pareto Principle for Social Preferences," Discussion Papers 2002-08, Graduate School of Economics, Hitotsubashi University.
- Rohan Dutta & Sean Horan, 2013.
"Inferring Rationales from Choice : Identification for Rational Shortlist Methods,"
Cahiers de recherche
09-2013, Centre interuniversitaire de recherche en économie quantitative, CIREQ.
- Rohan Dutta & Sean Horan, 2015. "Inferring Rationales from Choice: Identification for Rational Shortlist Methods," American Economic Journal: Microeconomics, American Economic Association, vol. 7(4), pages 179-201, November.
- Houy, Nicolas & Tadenuma, Koichi, 2007.
"Lexicographic Compositions of Multiple Criteria for Decision Making,"
2007-13, Graduate School of Economics, Hitotsubashi University.
- Houy, Nicolas & Tadenuma, Koichi, 2009. "Lexicographic compositions of multiple criteria for decision making," Journal of Economic Theory, Elsevier, vol. 144(4), pages 1770-1782, July.
- Houy Nicolas, 2007. "Rationality and Order-Dependent Sequential Rationality," Theory and Decision, Springer, vol. 62(2), pages 119-134, March.
When requesting a correction, please mention this item's handle: RePEc:hit:econdp:2013-08. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Digital Resources Section, Hitotsubashi University Library)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.