5 citations · 11 across the 10 of their papers we have counts for
Showing cs.GTShow all
3 papers · 1 filter
cs.GT2012
The Complexity of Infinitely Repeated Alternating Move Games
Yaron Velner
We consider infinite duration alternating move games. These games were previously studied by Roth, Balcan, Kalai and Mansour. They presented an FPTAS for computing an approximated…
cs.GT2012★ 1 cited
Hyperplane Separation Technique for Multidimensional Mean-Payoff Games
Krishnendu Chatterjee, Yaron Velner
We consider both finite-state game graphs and recursive game graphs (or pushdown game graphs), that can model the control flow of sequential programs with recursion, with multi-dim…
cs.GT2012★ 5 cited
The Complexity of Multi-Mean-Payoff and Multi-Energy Games
Yaron Velner, Krishnendu Chatterjee, Laurent Doyen +3
In mean-payoff games, the objective of the protagonist is to ensure that the limit average of an infinite sequence of numeric weights is nonnegative. In energy games, the objective…