Winning Strong Games through Fast Strategies for Weak Games
نویسندگان
چکیده
We prove that, for sufficiently large n, the first player can win the strong perfect matching and Hamilton cycle games. For both games, explicit winning strategies of the first player are given. In devising these strategies we make use of the fact that explicit fast winning strategies are known for the corresponding weak games.
منابع مشابه
Languages and strategies: a study of regular infinite games
The theory of two-player infinite games provides a framework for studying the controller synthesis problem in reactive system. This problem was solved for regular winning conditions for the first time by the fundamental BüchiLandweber Theorem. The present work extends this result by investigating possibilities to measure the complexity of strategies in infinite games. In the first part of this ...
متن کاملWeak Determinacy and Decidability of Reachability Games with Partial Observation
We consider two-players stochastic reachability games with partial observation on both sides and finitely many states, signals and actions. We prove that in such games, either player 1 has a strategy for winning with probability 1, or player 2 has a strategy for winning with probability 1, or both players have strategies that guarantee winning with strictly positive probability (positively winn...
متن کاملNash Equilibrium Strategy for Bi-matrix Games with L-R Fuzzy Payoffs
In this paper, bi-matrix games are investigated based on L-R fuzzy variables. Also, based on the fuzzy max order several models in non-symmetrical L-R fuzzy environment is constructed and the existence condition of Nash equilibrium strategies of the fuzzy bi-matrix games is proposed. At last, based on the Nash equilibrium of crisp parametric bi-matrix games, we obtain the Pareto and weak Pareto...
متن کاملGames Programs Play: Analyzing Multiplayer Programs
In this paper we present the first automatic technique for symbolically proving alternation-free μ-calculus properties of infinitestate, higher-order programs. In particular, we show how weak-recurrence solvability can be lifted from finite-state programs to higher-order recursive programs. Our strategy reduces the search for a proof of a winning strategy to nontermination of higher-order progr...
متن کاملEvolving Winning Strategies for Nim-like Games
An evolutionary approach for computing the winning strategy for Nim-like games is proposed in this paper. The winning strategy is computed by using the Multi Expression Programming (MEP) technique a fast and efficient variant of the Genetic Programming (GP). Each play strategy is represented by a mathematical expression that contains mathematical operators (such as +, -, *, mod, div, and , or, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 18 شماره
صفحات -
تاریخ انتشار 2011