Sequential item selection: Optimal and heuristic policies

DOI10.1016/0022-2496(81)90054-7zbMath0474.92020OpenAlexW2040757547MaRDI QIDQ1159106

S. H. Smith

Publication date: 1981

Published in: Journal of Mathematical Psychology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-2496(81)90054-7

zbMATH Keywords

Markov decision processmastery testingestimates of abilityhierarchical relationshipsselection policies

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Dynamic programming (90C39) Mathematical psychology (91E99)

Related Items (2)

A note on the separability of items in knowledge structures delineated by skill multimaps ⋮ On the unidentifiability of a certain class of skill multi map based probabilistic knowledge structures

Cites Work

• The art and theory of dynamic programming
• Optimal stimulus presentation strategy for a stimulus sampling model of learning
• Unnamed Item
• Unnamed Item

This page was built for publication: Sequential item selection: Optimal and heuristic policies