105 search results - page 7 / 21 » Linear Time Algorithm for Weak Parity Games |
SIGECOM
2005
ACM
14 years 1 months ago
2005
ACM
We study various computational aspects of solving games using dominance and iterated dominance. We first study both strict and weak dominance (not iterated), and show that checki...
SODA
2008
ACM
13 years 9 months ago
2008
ACM
We show how to find a normal form proper equilibrium in behavior strategies of a given two-player zero-sum extensive form game with imperfect information but perfect recall. Our a...
NIPS
1996
13 years 9 months ago
1996
To obtain classification systems with both good generalizat`ion performance and efficiency in space and time, we propose a learning method based on combinations of weak classifiers...
SODA
2000
ACM
13 years 9 months ago
2000
ACM
This paper shows that the minimum ratio canceling algorithm of Wallacher (1989) (and a faster relaxed version) can be generalized to an algorithm for general linear programs with ...
FOCS
2005
IEEE
14 years 1 months ago
2005
IEEE
We present a polynomial time algorithm based on semidefinite programming that, given a unique game of value 1 − O(1/ log n), satisfies a constant fraction of constraints, wher...