We present a polynomial-time reduction from max-average constraints to the feasibility problem for semidefinite programs. This shows that Condon's simple stochastic games, stochastic mean payoff games, and in particular mean payoff games and parity games can all be reduced to semidefinite programming.

翻译：我们提出了一种将最大平均约束归约为半定规划可行性问题的多项式时间归约方法。这表明Condon的简单随机博弈、随机平均收益博弈，特别是平均收益博弈与奇偶博弈，均可归约为半定规划问题。