Results 181 to 190 of about 279 (214)
Some of the next articles are maybe not open access.
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
Extensions of the combinatorial game (K,t)-Wythoff
Discrete Applied Mathematics, 2021Sanyang Liu
exaly
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
Min, a Combinatorial Game Having a Connection with Prime Numbers
Integers, 2010Nhan Bao Ho, Grant Cairns
exaly
Iterative Method for Solving Combinatorial Optimization Problems of the Game-type on Arrangements
Journal of Automation and Information Sciences, 2011Oleg Iemets
exaly