Categorize and randomize: a permissive model of stochastic choice
We model stochastic choices with categorization. The agent preliminarly groups alternatives in homogenous disjoint classes, then randomly chooses one class and randomly picks an item within the selected class. We give a formal definition of a choice generated by this procedure, and provide an axiomatic characterization. The characterizing properties allow an external analyst to elicit that categorization is applied. In a broader interpretation, the model allows to describe the observed choice as the composition of independent subchoices. This composition preserves rationalizability by Random Utility Maximization. A generalization of the model subsumes Luce model and Nested Logit.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
MixtureVitae: Open Web-Scale Pretraining Dataset With High Quality Instruction and Reasoning Data Built from Permissive-First Text Sources
We present MixtureVitae, an open-access pretraining corpus built to minimize legal risk while providing strong downstream performance. MixtureVitae follows a permissive-first, risk-mitigated sourcing strategy that combin…
Winning Strategy Templates for Stochastic Parity Games towards Permissive and Resilient Control
Stochastic games play an important role for many purposes such as the control of cyber-physical systems (CPS), where the controller and the environment are modeled as players. Conventional algorithms typically solve the …
Stochastic Configuration Machines: FPGA Implementation
Neural networks for industrial applications generally have additional constraints such as response speed, memory size and power usage. Randomized learners can address some of these issues. However, hardware solutions can…
Linear Discriminant Analysis with the Randomized Kaczmarz Method
We present a randomized Kaczmarz method for linear discriminant analysis (rkLDA), an iterative randomized approach to binary-class Gaussian model linear discriminant analysis (LDA) for very large data. We harness a least…
Randomized Stochastic Gradient Descent Ascent
An increasing number of machine learning problems, such as robust or adversarial variants of existing algorithms, require minimizing a loss function that is itself defined as a maximum. Carrying a loop of stochastic grad…