Optimal expansion of competence sets and decision support

When the competence set is discrete and finite, its elements can be represented by nodes of a graph. An expansion process of the competence set from the existent skill set to the desired true competence set can be represented by a tree construction. Minimal spanning tree becomes an effective tool for studying the optimal expansion process. The following are addressed in this paper: (i) costs of expansion and reachable domains, (ii) minimal spanning tree, lexicographical optimality, next-best method, and optimal expansion processes, (iii) decision support for expanding competence set.