We reduce 2D-GD-FixedPoint to finding a Nash equilibrium in the class of polytensor identical-interest games, i.e. games that satisfy both desiderata.
Our primary motivation for studying this class of games is as an intermediary problem for our reductions, but it may also be of independent game-theoretic interest (e.g. it is a natural generalization of the popular class of polymatrix identical-interest games [1]}, [2]}, [3]}, [4]}, [5]}, [6]}). See Section REF  for details.
