A search based analysis of decision making in simple allocation problems

Telli, Rabia (2016) A search based analysis of decision making in simple allocation problems. [Thesis]

[thumbnail of RabiaTelli_10119697.pdf] PDF

Download (303kB)


In this thesis, we focus on the analysis of rationality for simple allocation problems by interpreting solution rules as data on the choices of a policy maker. For an inventory of bankruptcy rules, we show that only constrained equal awards rule satis�es contraction independence. In addition, we weaken the rationality axiom and formulate the weak WARP (Weak Axiom of Revealed Preferences) property for simple allocation problems. We conclude that among a class of well-known solutions to simple allocation problems, the constrained equal awards rule uniquely satis�es contraction independence and weak WARP. In order to see the implications of existence of behavioral constraints in making choice, we next construct a search based model in which the decision maker has to engage in a dynamic search to adjudicate the con�icting claims and chose a division. Finally, we show that all allocation rules can be rationalized with this simple search model.
Item Type: Thesis
Additional Information: Yükseköğretim Kurulu Tez Merkezi Tez No: 435915.
Uncontrolled Keywords: Rationality. -- Contraction independence. -- Weak axiom of revealed preferences. -- Search. -- Consideration set. -- Rasyonellik. -- Daralmadan bağımsızlık. -- Açığa çıkan tercihlerin zayıf axiomu. -- Arama. -- Değerlendirme seti.
Subjects: H Social Sciences > HB Economic Theory
Divisions: Faculty of Arts and Social Sciences > Academic programs > Economics
Faculty of Arts and Social Sciences
Depositing User: IC-Cataloging
Date Deposited: 29 Apr 2018 14:52
Last Modified: 26 Apr 2022 10:19
URI: https://research.sabanciuniv.edu/id/eprint/34610

Actions (login required)

View Item
View Item