Stefanutti, Luca and Brancaccio, Andrea (2025) The assessment of global optimization skills in procedural knowledge space theory. Journal of Mathematical Psychology, 125. ISSN 0022-2496
|
PDF (Stefanutti_Brancaccio_The_assesment_of_global_optimization_skills_in_procedural_knowledge_space_theory_2025_JoMP_Final)
- Published Version
Available under License Creative Commons Attribution Non-commercial No Derivatives. Download (4MB) |
Abstract
Procedural knowledge space theory aims to evaluate problem-solving skills using a formal representation of a problem space. Stefanutti et al. (2021) introduced the concept of the “shortest path space” to characterize optimal problem spaces when a task requires reaching a solution in the minimum number of moves. This paper takes that idea further. It expands the shortest-path space concept to include a wider range of optimization problems, where each move can be weighted by a real number representing its “value”. Depending on the application, the “value” could be a cost, waiting time, route length, etc. This new model, named the optimizing path space, comprises all the globally best solutions. Additionally, it sets the stage for evaluating human problem-solving skills in various areas, like cognitive and neuropsychological tests, experimental studies, and puzzles, where globally optimal solutions are required.
| Item Type: | Article |
|---|---|
| Additional Information: | Publisher Copyright: © 2025 The Authors |
| Uncontrolled Keywords: | local optimization,human problem-solving,knowledge space,problem space,traveling salesman problem,psychology(all),applied mathematics ,/dk/atira/pure/subjectarea/asjc/3200 |
| Faculty \ School: | Faculty of Social Sciences > School of Psychology |
| Related URLs: | |
| Depositing User: | LivePure Connector |
| Date Deposited: | 16 Dec 2025 13:30 |
| Last Modified: | 16 Dec 2025 13:30 |
| URI: | https://ueaeprints.uea.ac.uk/id/eprint/101414 |
| DOI: | 10.1016/j.jmp.2025.102907 |
Downloads
Downloads per month over past year
Actions (login required)
![]() |
View Item |
Tools
Tools