Sciweavers

1683 search results - page 26 / 337
» Game Theory Basics
Sort
View
CSL
2007
Springer
14 years 1 months ago
MSO on the Infinite Binary Tree: Choice and Order
We give a new proof showing that it is not possible to define in monadic second-order logic (MSO) a choice function on the infinite binary tree. This result was first obtained by G...
Arnaud Carayol, Christof Löding
AAAI
2010
13 years 11 months ago
A General Game Description Language for Incomplete Information Games
A General Game Player is a system that can play previously unknown games given nothing but their rules. The Game Description Language (GDL) has been developed as a highlevel knowl...
Michael Thielscher
CADE
2005
Springer
14 years 10 months ago
Connecting Many-Sorted Theories
Abstract. Basically, the connection of two many-sorted theories is obtained by taking their disjoint union, and then connecting the two parts through connection functions that must...
Franz Baader, Silvio Ghilardi
ICGA
2006
312views Optimization» more  ICGA 2006»
15 years 9 months ago
New Approximate Strategies for Playing Sum Games based on Subgame Types
In this work we investigate the potential of combining AI tree-search algorithms with the algorithms of combinatorial game theory to provide more efficient strategies for playing s...
Manal Zaky, Cherif Salama, Salma Ghoneim
HICSS
2007
IEEE
122views Biometrics» more  HICSS 2007»
14 years 4 months ago
Learning Conversations in World of Warcraft
We examine learning culture in a popular online game, World of Warcraft. We analyze the way players learn this complex game through chat conversation with peers. We describe three...
Bonnie A. Nardi, Stella Ly, Justin Harris