Browsing by Subject "Path independence"

Now showing 1 - 4 of 4

Open Access
Explorations to refine Aizerman Malishevski's representation for path independent choice rules
(2020-09) Doğan, Serhat
This dissertation consists of four main parts in which we explore Aizerman Malishevski's representation result for path independent choice rules. Each path independent choice rule is known to have a maximizer-collecting (MC) representation: There exists a set of priority orderings such that the choice from each choice set is the union of the priority orderings' maximizers (Aizerman and Malishevski, 1981). In the first part, we introduce the maximal and prime sets to characterize all possible MC representations and show that the size of the largest anti-chain of primes determines its smallest size MC representation. In the second part, we focus on q-acceptant and path independent choice rules. We introduce prime atoms and prove that the number of prime atoms determines the smallest size MC representation. We show that q-responsive choice rules require the maximal number of priority orderings in their smallest size MC representations among all q-acceptant and path independent choice rules. In the third part, we aim to generalize q-responsive choice rules and introduce responsiveness as a choice axiom. In order to provide a new representation for responsive and path independent choice rules we introduce weighted responsive choice rules. Then, we show that all responsive and path independent choice rules are weighted responsive choice rules with an additional regularity condition. In the final part we focus on assignment problem. In this problem Probabilistic Serial assignment is always sd-efficient and sd-envy-free. We provide a sufficient and almost necessary condition for uniqueness of sd-efficient and sd-envy-free assignment via a connectedness condition over preference profile.
Open Access
List-rationalizable choice
(Economic Society, 2016) Yıldız, K.
A choice function is list rational(izable) if there is a fixed list such that for each choice set, successive comparison of the alternatives by following the list retrieves the chosen alternative. We extend the formulation of list rationality to stochastic choice setup. We say two alternatives are related if the stochastic path independence condition is violated between these alternatives. We show that a random choice function is list rational if and only if this relation is acyclic. Our characterization for deterministic choice functions follows as a corollary. By using this characterization, we relate list rationality to two-stage choice procedures. © 2016 The Econometric Society.
Open Access
On capacity-filling and substitutable choice rules
(Institute for Operations Research and the Management Sciences (INFORMS), 2021-08) Doğan, Battal; Doğan, Serhat; Yıldız, Kemal
Each capacity-filling and substitutable choice rule is known to have a maximizer-collecting representation: There exists a list of priority orderings such that from each choice set that includes more alternatives than the capacity, the choice is the union of the priority orderings’ maximizers. We introduce the notion of a critical set and constructively prove that the number of critical sets for a choice rule determines its smallest-size maximizer-collecting representation. We show that responsive choice rules require the maximal number of priority orderings in their smallest-size maximizer-collecting representations among all capacity-filling and substitutable choice rules. We also analyze maximizer-collecting choice rules in which the number of priority orderings equals the capacity. We show that if the capacity is greater than three and the number of alternatives exceeds the capacity by at least two, then no capacity-filling and substitutable choice rule has a maximizer-collecting representation of the size equal to the capacity.
Open Access
Two essays in choice theory
(2021-07) Hoxha, Klajdi
The thesis is divided into two chapters. The first chapter studies the responsive random choice procedure. There, we show that a weakened version of Luce’s IIA is sufficient to characterize the General Luce Rule (GLR) considered in Echenique and Saito (2019) and Ahumada and Ülkü (2018), with the restriction that all elements from menus of size three are chosen with positive probability. We analyze a special form of the GLR called Responsive Luce Rule (RLR). We characterize Responsive Luce Rules by using stochastic counterparts of the axioms in Chambers and Yenmez (2018) and Eliaz et al. (2011). In the second chapter, we analyze path independent choice rules by looking at choice sets that block an alternative from being chosen. We show that these blocking set collections carry the minimal information needed to represent the choices and are in one-to-one relation with path independent choice rules. In addition, we show that the notion of blocking is a useful tool to minimally represent and characterize certain classes of path independent choice rules.