Sciweavers

355 search results - page 1 / 71
» On Ramsey-type positional games
Sort
View
COMBINATORICS
2004
130views more  COMBINATORICS 2004»
13 years 4 months ago
On-line Ramsey Theory
The Ramsey game we consider in this paper is played on an unbounded set of vertices by two players, called Builder and Painter. In one move Builder introduces a new edge and Paint...
Jaroslaw Grytczuk, Mariusz Haluszczak, Henry A. Ki...
AAI
2010
195views more  AAI 2010»
13 years 1 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
MFCS
2004
Springer
13 years 10 months ago
When Can You Play Positionally?
We consider infinite antagonistic games over finite graphs. We present conditions that, whenever satisfied by the payoff mapping, assure for both players positional (memoryless...
Hugo Gimbert, Wieslaw Zielonka
AAAI
2012
11 years 7 months ago
Computing the Nucleolus of Matching, Cover and Clique Games
In cooperative games, a key question is to find a division of payoffs to coalition members in a fair manner. Nucleolus is one of such solution concepts that provides a stable sol...
Ning Chen, Pinyan Lu, Hongyang Zhang
HUC
2004
Springer
13 years 10 months ago
The Error of Our Ways: The Experience of Self-Reported Position in a Location-Based Game
We present a study of people’s use of positional information as part of a collaborative location-based game. The game exploits self-reported positioning in which mobile players m...
Steve Benford, Will Seager, Martin Flintham, Rob A...