Description Usage Arguments Value Examples
The 'quota' algorithm uses a composite sort key to order the items: * The primary key is the progress of each constraint on the item, relative to its lower/upper bound * The secondary key is the information value of each item
1 | cbm.quota.sort(eligibleModuleIndices, simuleeOut, simulation)
|
eligibleModuleIndices |
A vector of itempool indices eligible for selection. |
simuleeOut |
A tibble containing the in-progress simulee test output. |
simulation |
An object defining the test that is being run. |
The eligibleModuleIndices, sorted by their value to the simulee.
1 2 3 4 5 | simulation = initSimulation(readRDS(system.file("example/passage-adaptive-wpm.rds", package = "CATSimulator")))
simulation$control$contentBalancing = "quota"
simuleeOut = initSimulee(generateSimuleesByTrueTheta(-2, 10001), simulation)
eligibleModuleIndices = 1:nrow(simulation$modules)
balancedModuleIndices = cbm.quota.sort(eligibleModuleIndices, simuleeOut, simulation)
|
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.