Distributed Online Planning for Min-Max Problems in Networked Markov Games
Distributed Online Planning for Min-Max Problems in Networked Markov Games
Min-max problems are important in multi-agent sequential decision-making because they improve the performance of the worst-performing agent in the network. However, solving the multi-agent min-max problem is challenging. We propose a modular, distributed, online planning-based algorithm that is able to approximate the solution of the min-max objective in networked Markov …