23 search results - page 2 / 5 » A New Family of k-in-a-Row Games |
APPROX
2011
Springer
13 years 9 months ago
2011
Springer
How to color 3 colorable graphs with few colors is a problem of longstanding interest. The best polynomial-time algorithm uses n0.2072 colors. There are no indications that colori...
DIAGRAMS
2004
Springer
15 years 2 months ago
2004
Springer
TRACS: Tool for Research on Adaptive Cognitive Strategies, is a new family of card games played with a special deck. Each card in the deck is a double-sided diagram, where the back...
CORR
2002
Springer
14 years 9 months ago
2002
Springer
We introduce a new family of one-player games, involving the movement of coins from one configuration to another. Moves are restricted so that a coin can be placed only in a posit...
CDC
2008
IEEE
15 years 4 months ago
2008
IEEE
— We construct a family of iterative discretization algorithms for computing sequences of finitely-supported correlated equilibria of n-player games with polynomial utility func...
NMR
2004
Springer
15 years 2 months ago
2004
Springer
We propose in this paper a new family of belief merging operators, that is based on a game between sources : Until a coherent set of sources is reached, at each round a contest is...