An optimal sequential information acquisition model subject to a heuristic assimilation constraint
Bibliographic record
Abstract
Purpose – The purpose of this paper is to study the optimal sequential information acquisition process of a rational decision maker (DM) when allowed to acquire n pieces of information from a set of bi-dimensional products whose characteristics vary in a continuum set. Design/methodology/approach – The authors incorporate a heuristic mechanism that makes the n-observation scenario faced by a DM tractable. This heuristic allows the DM to assimilate substantial amounts of information and define an acquisition strategy within a coherent analytical framework. Numerical simulations are introduced to illustrate the main results obtained. Findings – The information acquisition behavior modeled in this paper corresponds to that of a perfectly rational DM, i.e. endowed with complete and transitive preferences, whose objective is to choose optimally among the products available subject to a heuristic assimilation constraint. The current paper opens the way for additional research on heuristic information acquisition and choice processes when considered from a satisficing perspective that accounts for cognitive limits in the information processing capacities of DMs. Originality/value – The proposed information acquisition algorithm does not allow for the use of standard dynamic programming techniques. That is, after each observation is gathered, a rational DM must modify his information acquisition strategy and recalculate his or her expected payoffs in terms of the observations already acquired and the information still to be gathered.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.007 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.002 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.003 | 0.003 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.002 | 0.002 |
| Insufficient payload (model declined to judge) | 0.007 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".