Abstract

This paper formulates in economic terms the decision problem for teaching a list of paired associate items. The analysis assumes that learning behavior for each item is described by the one-element model with parameters that can depend on both the student and the item. A dynamic programming formulation for the decision problem is developed that accounts for the cost of instruction as well as the cost of terminating the instruction in the unconditioned state. This formulation considers three alternatives at each decision: simply present the item with no elicited response, present the item and observe the students' response, and terminate instruction for the item. The paper proves that the optimum policy for a multi-item list can be calculated by considering each item individually and then aggregating the individual results into a total policy. Secondly, an algorithm for calculating the optimum policy for each item is derived. The algorithm is simple enough so that the optimum policy can be calculated by hand. Two examples illustrate the application of the algorithm.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.