Browsing by Subject "Random choice"

Now showing 1 - 3 of 3

Open Access
Every choice function is pro-con rationalizable
(Institute for Operations Research and the Management Sciences (INFORMS), 2022-06-22) Doğan, Serhat; Yıldız, Kemal
We consider an agent who is endowed with two sets of orderings: pro- and con-orderings. For each choice set, if an alternative is the top-ranked by a pro-ordering (con-ordering), then this is a pro (con) for choosing that alternative. The alternative with more pros than cons is chosen from each choice set. Each ordering may have a weight reflecting its salience. In this case, the probability that an alternative is chosen equals the difference between the total weights of its pros and cons. We show that every nuance of the rich human choice behavior can be captured via this structured model. Our technique requires a generalization of the Ford-Fulkerson theorem, which may be of independent interest. As an application of our results, we show that every choice rule is plurality-rationalizable.
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
Odds supermodularity and the Luce rule
(Academic Press, 2021-03) Doğan, Serhat; Yıldız, Kemal
We present a characterization of the Luce rule in terms of positivity and a new choice axiom called odds supermodularity that strengthens the regularity axiom. This new characterization illuminates a connection that goes unnoticed, and sheds light on the behavioral underpinnings of the Luce rule and its extensions from a different perspective. We show that odds supermodularity per se characterizes a structured extension of the Luce rule that accommodates zero probability choices. We identify the random choice model characterized via a stochastic counterpart of Plott (1973)'s path independence axiom, which strengthens odds supermodularity.