57 search results - page 3 / 12 » The Nakamura numbers for computable simple games |
FOCS
2005
IEEE
14 years 3 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...
ATAL
2008
Springer
13 years 11 months ago
2008
Springer
Many multiagent domains where cooperation among agents is crucial to achieving a common goal can be modeled as coalitional games. However, in many of these domains, agents are une...
AAAI
2000
13 years 11 months ago
2000
The game of Hex is a two-player game with simple rules, a deep underlying mathematical beauty, and a strategic complexity comparable to that of Chess and Go. The massive game-tree...
P2P
2005
IEEE
14 years 3 months ago
2005
IEEE
Our research proposes a simple buyer/seller game that captures the incentives dictating the interaction between peers in resource trading peer-to-peer networks. We prove that for ...
CG
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. There are two complementary approaches to playing sums of combinatorial games. They can be characterized as local analysis and global search. Algorithms from combinatoria...