Sciweavers

140 search results - page 3 / 28
» A relation-algebraic approach to simple games
Sort
View
CG
1998
Springer
13 years 9 months ago
From Simple Features to Sophisticated Evaluation Functions
This paper discusses a practical framework for the semi automatic construction of evaluation functions for games. Based on a structured evaluation function representation, a proced...
Michael Buro
CORR
2010
Springer
79views Education» more  CORR 2010»
13 years 5 months ago
Quantitative Games on Probabilistic Timed Automata
Abstract. Two-player zero-sum games are a well-established model for synthesising controllers that optimise some performance criterion. In such games one player represents the cont...
Marta Z. Kwiatkowska, Gethin Norman, Ashutosh Triv...
CDC
2009
IEEE
107views Control Systems» more  CDC 2009»
13 years 10 months ago
Learning approaches to the Witsenhausen counterexample from a view of potential games
— Since Witsenhausen put forward his remarkable counterexample in 1968, there have been many attempts to develop efficient methods for solving this non-convex functional optimiz...
Na Li, Jason R. Marden, Jeff S. Shamma
AAI
2010
195views more  AAI 2010»
13 years 2 months ago
Automatic Extraction of Go Game Positions from Images: a Multi-Strategical Approach to Constrained Multi-Object Recognition
Here, we present a constrained object recognition task that has been robustly solved largely with simple machine learning methods, using a small corpus of about 100 images taken u...
Alexander K. Seewald
IPL
2006
92views more  IPL 2006»
13 years 5 months ago
A constructive approach to sequential Nash equilibria
We present a Coq-formalised proof that all non-cooperative, sequential games have a Nash equilibrium point. Our proof methodology follows the style advocated by LCFstyle theorem p...
René Vestergaard