We investigate the complexities of the McKean-Vlasov optimal control problem, exploring its various formulations such as the strong and weak formulations, as well as both Markovian and non-Markovian setups within financial markets. Furthermore, we examine scenarios where the law governing the control process impacts the dynamics of options. By conceptualizing controls as probability measures on a fitting canonical space with filtrations, we unlock the potential to devise classical measurable selection methods, conditioning strategies, and concatenation arguments within this innovative framework. These tools enable us to establish the dynamic programming principle under a wide range of conditions.