Multi-Player Zero-Sum Markov Games with Networked Separable Interactions

arXiv:2307.09470v2 Announce Type: replace-cross
Abstract: We study a new class of Markov games, \emph(multi-player) zero-sum Markov Games} with \emph{Networked separable interactions} (zero-sum NMGs), to model the local interaction structure in non-cooperative multi-agent sequential decision-making. We define a zero-sum NMG as a model where {the payoffs of the auxiliary games associated with each state are zero-sum and} have some separable (i.e., polymatrix) structure across the neighbors over some interaction network. We first identify the necessary and sufficient conditions under which an …

abstract agent arxiv class cs.gt cs.lg decision games interactions making markov multi-agent study type