Results 241 to 250 of about 596,890 (279)
Some of the next articles are maybe not open access.
Learning Generative Deception Strategies in Combinatorial Masking Games
Decision and Game Theory for Security, 2021Deception is a crucial tool in the cyberdefence repertoire, enabling defenders to leverage their informational advantage to reduce the likelihood of successful attacks.
Junlin Wu +3 more
semanticscholar +1 more source
Can Reinforcement Learning Solve Asymmetric Combinatorial-Continuous Zero-Sum Games?
International Conference on Learning RepresentationsThere have been extensive studies on learning in zero-sum games, focusing on the analysis of the existence and algorithmic convergence of Nash equilibrium (NE). Existing studies mainly focus on symmetric games where the strategy spaces of the players are
Yuheng Li, Panpan Wang, Haipeng Chen
semanticscholar +1 more source
Reconfiguration and combinatorial games. (Reconfiguration et jeux combinatoires)
, 2019Cette thèse explore des problématiques liées aux jeux. Les jeux qui nous intéressent sont ceux pour lesquels il n'y a pas d'information cachée: tout les joueurs ont accès à toute l'information relative au jeu; il n'y a pas non plus d'aléa.
Marc Heinrich
semanticscholar +1 more source
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
Quantum-Inspired Combinatorial Games: Algorithms and Complexity
Fun with Algorithms, 2022Kyle G. Burke, Matthew Ferland, S. Teng
semanticscholar +1 more source
CLR-DRNets: Curriculum Learning with Restarts to Solve Visual Combinatorial Games
International Conference on Principles and Practice of Constraint Programming, 2021Yiwei Bai, Di Chen, Carla P. Gomes
semanticscholar +1 more source
Games with combinatorial constraints
Cybernetics and Systems Analysis, 2008zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yemets, O. A., Ustian, N. Yu.
openaire +2 more sources
Preserving Liberty and Fairness in Combinatorial Double Auction Games Based on Blockchain
IEEE Systems Journal, 2021Jung-San Lee +3 more
semanticscholar +1 more source