Dynamic Min-Max problems

Abstract

In this paper we address min-max equations for periodic and non-periodic problems. In the non-periodic case a simple algorithm is presented to determine whether a graph has a potential satisfying the min-max equations. This method can also be used to solve a more general min-max problem on periodic graphs. Also some results regarding the uniqueness of solutions in the periodic case are given. Finally, we address amore general quasi periodic problem and provide an algorithm for its solution.