Markov Stochastic Choice
We examine the effect of item arrangement on choices using a novel decision-making model based on the Markovian exploration of choice sets. This model is inspired by experimental evidence suggesting that the decision-making process involves sequential search through rapid stochastic pairwise comparisons. Our findings show that decision-makers following a reversible process are unaffected by item rearrangements, and further demonstrate that this property can be inferred from their choice behavior. Additionally, we provide a characterization of the class of Markovian models in which the agent makes all possible pairwise comparisons with positive probability. The intersection of reversible models and those allowing all pairwise comparisons is observationally equivalent to the well-known Luce model. Finally, we characterize the class of Markovian models for which the initial fixation does not impact the final choice and show that choice data reveals the existence and composition of consideration sets.
Code (0)
등록된 구현이 없습니다.
Tasks
Decision MakingSimilar Papers 제목 키워드 기반
Pairwise Choice Markov Chains
As datasets capturing human choices grow in richness and scale -- particularly in online domains -- there is an increasing need for choice models that escape traditional choice-theoretic axioms such as regularity, stocha…
Reconstructing cryptocurrency processes via Markov chains
The growing attention on cryptocurrencies has led to increasing research on digital stock markets. Approaches and tools usually applied to characterize standard stocks have been applied to the digital ones. Among these t…
Langevin algorithms for Markovian Neural Networks and Deep Stochastic control
Stochastic Gradient Descent Langevin Dynamics (SGLD) algorithms, which add noise to the classic gradient descent, are known to improve the training of neural networks in some cases where the neural network is very deep. …
ManagementRobust Approximate Sampling via Stochastic Gradient Barker Dynamics
Stochastic Gradient (SG) Markov Chain Monte Carlo algorithms (MCMC) are popular algorithms for Bayesian sampling in the presence of large datasets. However, they come with little theoretical guarantees and assessing thei…
A Unified Approach to Analysis and Design of Denoising Markov Models
Probabilistic generative models based on measure transport, such as diffusion and flow-based models, are often formulated in the language of Markovian stochastic dynamics, where the choice of the underlying process impac…
Denoising