I study dynamic random utility with finite choice sets and exogenous total menu variation, which I refer to as stochastic utility (SU). First, I characterize SU when each choice set has three elements. Next, I prove several mathematical identities for joint, marginal, and conditional Block--Marschak sums, which I use to obtain two characterizations of SU when each choice set but the last has three elements. As a corollary under the same cardinality restrictions, I sharpen an axiom to obtain a characterization of SU with full support over preference tuples. I conclude by characterizing SU without cardinality restrictions. All of my results hold over an arbitrary finite discrete time horizon.Comment: 26 page
We study stochastic choice as the outcome of deliberate randomization. We derive a general represent...
We propose a novel model of stochastic choice: the single-crossing random utility model (SCRUM). Thi...
We study stochastic choice as the outcome of deliberate randomization. We derive a general represent...
The (static) utility maximization model of Afriat (1967), which is the standard in analysing choice ...
We provide an axiomatic analysis of dynamic random utility, characterizing the stochastic choice beh...
We provide an axiomatic analysis of dynamic random utility, characterizing the stochastic choice beh...
Item does not contain fulltextTo explain inconsistency in choice experiments, where a subject on rep...
Chapter 1 introduces and axiomatizes a new class of representations for incomplete preferences calle...
Abstract: This paper discusses the problem of specifying probabilistic models for choices (strategi...
Abstract: This paper discusses the problem of specifying probabilistic models for choices (strategie...
To explain inconsistency in choice experiments, where a subject on repeated presentations of one par...
Under dynamic random utility, an agent (or population of agents) solves a dynamic decision problem s...
Under dynamic random utility, an agent (or population of agents) solves a dynamic decision problem s...
We study various axioms of discrete probabilistic choice, measuring how restrictive they are, both a...
Abstract: This paper discusses the problem of specifying probabilistic models for choices (strategi...
We study stochastic choice as the outcome of deliberate randomization. We derive a general represent...
We propose a novel model of stochastic choice: the single-crossing random utility model (SCRUM). Thi...
We study stochastic choice as the outcome of deliberate randomization. We derive a general represent...
The (static) utility maximization model of Afriat (1967), which is the standard in analysing choice ...
We provide an axiomatic analysis of dynamic random utility, characterizing the stochastic choice beh...
We provide an axiomatic analysis of dynamic random utility, characterizing the stochastic choice beh...
Item does not contain fulltextTo explain inconsistency in choice experiments, where a subject on rep...
Chapter 1 introduces and axiomatizes a new class of representations for incomplete preferences calle...
Abstract: This paper discusses the problem of specifying probabilistic models for choices (strategi...
Abstract: This paper discusses the problem of specifying probabilistic models for choices (strategie...
To explain inconsistency in choice experiments, where a subject on repeated presentations of one par...
Under dynamic random utility, an agent (or population of agents) solves a dynamic decision problem s...
Under dynamic random utility, an agent (or population of agents) solves a dynamic decision problem s...
We study various axioms of discrete probabilistic choice, measuring how restrictive they are, both a...
Abstract: This paper discusses the problem of specifying probabilistic models for choices (strategi...
We study stochastic choice as the outcome of deliberate randomization. We derive a general represent...
We propose a novel model of stochastic choice: the single-crossing random utility model (SCRUM). Thi...
We study stochastic choice as the outcome of deliberate randomization. We derive a general represent...