MFGs with a finite time horizon and uncountable state and action spaces are considered in [1]}. A fictitious play algorithm of sorts is proposed and analyzed, though the question of learning best-response is black-boxed.
