2015
Regret bounds of a distributed saddle point algorithm
ICASSP 2015accepted
An algorithm to learn optimal actions in distributed convex repeated games is developed. Learning is repeated because cost functions are revealed sequentially and distributed because they are revealed to agents of a network that can exchange information with neighboring nodes only. Learning is measu…