Results 221 to 230 of about 1,252 (255)
Some of the next articles are maybe not open access.
Provably Difficult Combinatorial Games
SIAM Journal on Computing, 1979For a number of two-person combinatorial games, the problem of determining the outcome of optimal play from a given starting position (that is, of determining which player, if either, has a forced win) is shown to be complete in exponential time with respect to logspace-reducibility.
Larry J Stockmeyer, Ashok K Chandra
exaly +3 more sources
2008
Traditional game theory has been successful at developing strategy in games of incomplete information: when one player knows something that the other does not. But it has little to say about games of complete information, for example, tic-tac-toe, solitaire and hex. The main challenge of combinatorial game theory is to handle combinatorial chaos, where
openaire +1 more source
Traditional game theory has been successful at developing strategy in games of incomplete information: when one player knows something that the other does not. But it has little to say about games of complete information, for example, tic-tac-toe, solitaire and hex. The main challenge of combinatorial game theory is to handle combinatorial chaos, where
openaire +1 more source
On the Impact of Combinatorial Structure on Congestion Games
2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06), 2006We study the impact of combinatorial structure in congestion games on the complexity of computing pure Nash equilibria and the convergence time of best response sequences. In particular, we investigate which properties of the strategy spaces of individual players ensure a polynomial convergence time.
Heiner Ackermann +2 more
openaire +2 more sources
Covert Channels in Combinatorial Games
Proceedings of the Fifth International Conference on Simulation Tools and Techniques, 2012Philip C. Ritchey, Vernon Rego
openaire +1 more source
Special Issue on Combinatorial Games
ICGA Journal, 2019Jos Uiterwijk, Richard J. Nowakowski
openaire +1 more source
Totally balanced combinatorial optimization games
Mathematical Programming, 2000Xiaotie Deng +2 more
exaly
New techniques for cost sharing in combinatorial optimization games
Mathematical Programming, 2010Adam N Letchford +2 more
exaly