A discrete time model for detection of randomly presented stimuli
From MaRDI portal
Publication:1249149
DOI10.1016/0022-2496(78)90026-3zbMath0384.92018OpenAlexW2023873729MaRDI QIDQ1249149
Amnon Rapoport, William E. Stein
Publication date: 1978
Published in: Journal of Mathematical Psychology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-2496(78)90026-3
Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Mathematical psychology (91E99)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Presolution performance functions for Markov models
- Optimal strategies for seeking information. Models for statistics, choice reaction times, and human information processing
- Derivation of learning process statistics for a general Markov model
- Derivations of learning statistics from absorbing Markov chains
- Models for deferred decision making
- Finite Continuous Time Markov Chains
- On a Quickest Detection Problem
- On Optimum Methods in Quickest Detection Problems
This page was built for publication: A discrete time model for detection of randomly presented stimuli