A Markov Chain Procedure

Jean-Claude Falmagne () and Jean-Paul Doignon ()
Additional contact information
Jean-Claude Falmagne: University of California, Irvine, Department of Cognitive Sciences, Institute of Mathematical Behavioral Sciences
Jean-Paul Doignon: Université Libre de Bruxelles, Département de Mathématique

Chapter 14 in Learning Spaces, 2011, pp 273-296 from Springer

Abstract: Abstract This chapter discusses an assessment procedure that is similar in spirit to those described in Chapter 13, but different in a key aspect: it is based on a finite Markov chain rather than on a Markov process with an uncountable set of Markov states. As a consequence, the procedure requires less storage and computation. It can thus be implemented on a small machine. A multi-step application of the procedure described in this chapter can be set up exactly as we did for the procedure of the previous chapter.

Keywords: Markov Chain; True State; Knowledge Structure; Incidence Matrix; Knowledge State (search for similar items in EconPapers)
Date: 2011
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-01039-2_14

Ordering information: This item can be ordered from
http://www.springer.com/9783642010392

DOI: 10.1007/978-3-642-01039-2_14

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().