CIS 6200 Learning in Games and Games in Learning Lecture 12
>> YOUR LINK HERE: ___ http://youtube.com/watch?v=sg9J6SwLXOk
http://mlgametheory.com • In this lecture we define a very general online multiobjective optimization problem (The Adversary Moves First Framework ) and give an algorithm that reduces it to a 1-dimensional regret problem. This is a generalization of Blackwell Approachability .
#############################
