31 research outputs found
The Complexity of Nash Equilibria in Stochastic Multiplayer Games
We analyse the computational complexity of finding Nash equilibria in
turn-based stochastic multiplayer games with omega-regular objectives. We show
that restricting the search space to equilibria whose payoffs fall into a
certain interval may lead to undecidability. In particular, we prove that the
following problem is undecidable: Given a game G, does there exist a Nash
equilibrium of G where Player 0 wins with probability 1? Moreover, this problem
remains undecidable when restricted to pure strategies or (pure) strategies
with finite memory. One way to obtain a decidable variant of the problem is to
restrict the strategies to be positional or stationary. For the complexity of
these two problems, we obtain a common lower bound of NP and upper bounds of NP
and PSPACE respectively. Finally, we single out a special case of the general
problem that, in many cases, admits an efficient solution. In particular, we
prove that deciding the existence of an equilibrium in which each player either
wins or loses with probability 1 can be done in polynomial time for games where
the objective of each player is given by a parity condition with a bounded
number of priorities
A Structured Model of Video Reproduces Primary Visual Cortical Organisation
The visual system must learn to infer the presence of objects and features in the world from the images it encounters, and as such it must, either implicitly or explicitly, model the way these elements interact to create the image. Do the response properties of cells in the mammalian visual system reflect this constraint? To address this question, we constructed a probabilistic model in which the identity and attributes of simple visual elements were represented explicitly and learnt the parameters of this model from unparsed, natural video sequences. After learning, the behaviour and grouping of variables in the probabilistic model corresponded closely to functional and anatomical properties of simple and complex cells in the primary visual cortex (V1). In particular, feature identity variables were activated in a way that resembled the activity of complex cells, while feature attribute variables responded much like simple cells. Furthermore, the grouping of the attributes within the model closely parallelled the reported anatomical grouping of simple cells in cat V1. Thus, this generative model makes explicit an interpretation of complex and simple cells as elements in the segmentation of a visual scene into basic independent features, along with a parametrisation of their moment-by-moment appearances. We speculate that such a segmentation may form the initial stage of a hierarchical system that progressively separates the identity and appearance of more articulated visual elements, culminating in view-invariant object recognition
The PASCAL Visual Object Classes (VOC) Challenge
The Pascal Visual Object Classes (VOC) challenge is a benchmark in visual object category recognition and detection, providing the vision and machine learning communities with a standard dataset of images and annotation, and standard evaluation procedures. Organised annually from 2005 to present, the challenge and its associated dataset has become accepted as the benchmark for object detection. This paper describes the dataset and evaluation procedure. We review the state-of-the-art in evaluated methods for both classification and detection, analyse whether the methods are statistically different, what they are learning from the images (e.g. the object or its context), and what the methods find easy or confuse. The paper concludes with lessons learnt in the three year history of the challenge, and proposes directions for future improvement and extension. © 2009 Springer Science+Business Media, LLC