Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
1,086
A subexponential lower bound for the Random Facet algorithm for Parity Games
"... Parity Games form an intriguing family of infinite duration games whose solution is equivalent to the solution of important problems in automatic verification and automata theory. They also form a very natural subclass of Deterministic Mean Payoff Games, which in turn is a very natural subclass of t ..."
Abstract
-
Cited by 6 (5 self)
- Add to MetaCart
of turn-based Stochastic Mean Payoff Games. It is a major open problem whether these game families can be solved in polynomial time. The currently fastest algorithms for the solution of all these games are adaptations of the randomized generalizationof linear programming. We refer to the algorithm of
The Nonstochastic Multiarmed Bandit Problem
- SIAM JOURNAL OF COMPUTING
, 2002
"... In the multiarmed bandit problem, a gambler must decide which arm of K non-identical slot machines to play in a sequence of trials so as to maximize his reward. This classical problem has received much attention because of the simple model it provides of the trade-off between exploration (trying out ..."
Abstract
-
Cited by 491 (34 self)
- Add to MetaCart
of the process generating the payoffs of the slot machines. We give a solution to the bandit problem in which an adversary, rather than a well-behaved stochastic process, has complete control over the payoffs. In a sequence of T plays, we prove that the per-round payoff of our algorithm approaches
The Complexity of Mean Payoff Games on Graphs
- THEORETICAL COMPUTER SCIENCE
, 1996
"... We study the complexity of finding the values and optimal strategies of mean payoff games on graphs, a family of perfect information games introduced by Ehrenfeucht and Mycielski and considered by Gurvich, Karzanov and Khachiyan. We describe a pseudo-polynomial time algorithm for the solution of suc ..."
Abstract
-
Cited by 143 (4 self)
- Add to MetaCart
of such games, the decision problem for which is in NP " co-NP. Finally, we describe a polynomial reduction from mean payoff games to the simple stochastic games studied by Condon. These games are also known to be in NP " co-NP, but no polynomial or pseudo-polynomial time algorithm is known for them.
The complexity of mean payoff games
- THEORETICAL COMPUTER SCIENCE
"... We study the complexity of nding the values and optimal strategies of mean payoff games, a family of perfect information games introduced by Ehrenfeucht and Mycielski. We describe a pseudo-polynomial time algorithm for the solution of such games, the decision problem for which is in NP ∩ co-NP. Fi ..."
Abstract
-
Cited by 6 (0 self)
- Add to MetaCart
-NP. Finally, we describe a polynomial reduction from mean payoff games to the simple stochastic games studied by Condon. These games are also known to be in NP ∩ co-NP, but no polynomial or pseudo-polynomial time algorithm is known for them.
Perfect-Information Stochastic Mean-Payoff Parity Games ⋆,⋆⋆
"... Abstract The theory of graph games is the foundation for modeling and synthesizing reactive processes. In the synthesis of stochastic processes, we use 2 1 2-player games where some transitions of the game graph are controlled by two adversarial players, the System and the Environment, and the other ..."
Abstract
- Add to MetaCart
2-player mean-payoff games. Our results are useful in the synthesis of stochastic reactive systems with both functional requirement (given as a qualitative objective) and performance requirement (given as a quantitative objective). 1
Stochastic Games with Parity Mean-payoff Objective
"... In this paper, we compute value of two-player games with perfect information equipped with the Par ∧ Avg>0 objectives. Moreover we show that even though the optimal strategies may require infinite memory, there exists an NP algorithm that computes the almost-sure region. hal-00766251, version 1- ..."
Abstract
- Add to MetaCart
In this paper, we compute value of two-player games with perfect information equipped with the Par ∧ Avg>0 objectives. Moreover we show that even though the optimal strategies may require infinite memory, there exists an NP algorithm that computes the almost-sure region. hal-00766251, version 1
Simple Stochastic Games, Parity Games, Mean Payoff Games and Discounted Payoff Games Are All Lp-type Problems
, 2007
"... We show that a Simple Stochastic Game (SSG) can be formulated as an LP-type problem. Using this formulation, and the known algorithm of Sharir and Welzl [SW] for LP-type problems, we obtain the first strongly subexponential solution for SSGs (a strongly subexponential algorithm has only been known ..."
Abstract
-
Cited by 23 (0 self)
- Add to MetaCart
for binary SSGs [L]). Using known reductions between various games, we achieve the first strongly subexponential solutions for Discounted and Mean Payoff Games. We also give alternative simple proofs for the best known upper bounds for Parity Games and binary SSGs. To the best of our knowledge, the LP
PRACTICAL AND THEORETICAL ISSUES OF EVOLVING BEHAVIOUR TREES FOR A TURN-BASED GAME
, 2013
"... The concept of evolving components of an artificial intelligence (AI) has seen increased interest in recent years as the power and complexity of AI has grown. In entertainment software, this AI can impact the player’s experiences and enjoyment through elements such as the level of difficulty of the ..."
Abstract
- Add to MetaCart
of the player’s competition. There-fore AI development is an important research topic, especially as development is considered difficult by the video game industry. This work applies the evolutionary computing paradigm to a turn-based domain by evolving team strategies. These strategies are represented
Results 1 - 10
of
1,086
