Adaptive stochastic search
From MaRDI portal
Recommendations
Cites work
- (A,f): Choice with Frames1
- A representation theorem for finite random scale systems
- Cognitive constraints, contraction consistency, and the satisficing criterion
- scientific article; zbMATH DE number 3156726 (Why is no real title available?)
- Menu-dependent stochastic feasibility
- Monotone threshold representations
- Nonparametric Analysis of Random Utility Models
- On the maximization of menu-dependent interval orders
- Random categorization and bounded rationality
- Random Expected Utility
- Revealed stochastic preference: a synthesis
- Satisficing and stochastic choice
- Satisficing with a variable threshold
- Search, choice, and revealed preference
- Stochastic choice and consideration sets
- The Nonparametric Approach to Demand Analysis
- Utility Maximization, Choice and Preference
- When more is less: limited consideration
Cited in
(15)- Adaptation of stochastic search methods realized on a homogeneous computational array under uncertainty
- Greedy randomized adaptive search procedures
- Satisficing with a variable threshold
- Hazard rate, stochastic choice and consideration sets
- Adaptive search over sorted sets
- A random attention and utility model
- scientific article; zbMATH DE number 5932201 (Why is no real title available?)
- Search, choice, and revealed preference
- Satisficing and stochastic choice
- Adaptive random search for continuous simulation optimization
- scientific article; zbMATH DE number 1857677 (Why is no real title available?)
- Expected hitting times for Backtracking Adaptive Search
- Random utility models with status quo bias
- Explaining satisficing through risk aversion
- Reactive search and intelligent optimization
This page was built for publication: Adaptive stochastic search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2419506)