2025/03/18 by Simon, Hans U., Telle, Jan Arne
#68R05 #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #G.2.1
paper · doi:10.48550/arxiv.2503.14061
In this paper, we study three matching problems all of which came up quite recently in the field of machine teaching. The cost of a matching is defined in such a way that, for some formal model of teaching, it equals (or bounds) the number of labeled examples needed to solve a given teaching task. We show how the cost parameters associated with these problems depend on each other and how they are related to other well known combinatorial parameters (like, for instance, the VC-dimension).