Cyclical games with prohibitions
From MaRDI portal
Publication:689132
DOI10.1007/BF01580616zbMath0781.90109MaRDI QIDQ689132
Alexander V. Karzanov, Vasilij N. Lebedev
Publication date: 6 December 1993
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Related Items
The complexity of mean payoff games on graphs, Exponential examples of solving parity games, A pseudo-polynomial algorithm for mean payoff stochastic games with perfect information and few random positions, A convex programming-based algorithm for mean payoff stochastic games with perfect information, The complexity of mean payoff games, Lexicographic solution of two-objective project planning problem under constrained reliability index, On the Existence of Stationary Nash Equilibria for Mean Payoff Games on Graphs, New algorithms for solving tropical linear systems, On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles., Nash-solvable two-person symmetric cycle game forms, On Nash-solvability in pure stationary strategies of the deterministic \(n\)-person games with perfect information and mean or total effective cost, Optimization of schedules with precedence logical conditions, A note on the approximation of mean-payoff games, Effective algorithms for games with prohibitions and their applications, On short paths interdiction problems: Total and node-wise limited interdiction, Cyclic games and linear programming, Stochastic Mean Payoff Games: Smoothed Analysis and Approximation Schemes, A nested family of \(k\)-total effective rewards for positional games, Approximation schemes for stochastic mean payoff games with perfect information and few random positions, Faster algorithms for mean-payoff games, Stationary equilibria in cyclic games: search and structure, Looking at mean-payoff and total-payoff through windows
Cites Work
