This thesis is centered around the study of parameters for covering vertices in a graph. The most classical covering parameter is the domination number. We study variants of this problem with new dynamic or game constraints, giving the problems of power domination and the Maker-Breaker domination game. Other types of covering parameters are also studied, such as the strong geodetic number and the identification of points in the plane.