A note on the approximation of mean-payoff games
Information Processing Letters（2014）
摘要
We consider the problem of designing approximation schemes for the values of mean-payoff games. It was recently shown that (1) mean-payoff with rational weights scaled on [-1,1] admit additive fully-polynomial approximation schemes, and (2) mean-payoff games with positive weights admit relative fully-polynomial approximation schemes. We show that the problem of designing additive/relative approximation schemes for general mean-payoff games (i.e. with no constraint on their edge-weights) is P-time equivalent to determining their exact solution.
更多查看译文
关键词
general mean-payoff game,mean-payoff game,positive weight,exact solution,additive fully-polynomial approximation scheme,approximation scheme,relative fully-polynomial approximation scheme,p-time equivalent,relative approximation scheme,rational weight,approximation algorithms
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要