Results 11 to 20 of about 596,890 (279)

Universally Balanced Combinatorial Optimization Games [PDF]

open access: yesGames, 2010
This article surveys studies on universally balanced properties of cooperative games defined in a succinct form. In particular, we focus on combinatorial optimization games in which the values to coalitions are defined through linear optimization ...
Xiaotie Deng   +2 more
exaly   +6 more sources

Bidding Combinatorial Games [PDF]

open access: yesThe Electronic Journal of Combinatorics, 2022
Combinatorial Game Theory is a branch of mathematics and theoretical computer science that studies sequential 2-player games with perfect information. Normal play is the convention where a player who cannot move loses. Here, we generalize the classical alternating normal play to infinitely many game families, by means of discrete Richman auctions ...
Prem Kant   +3 more
openaire   +4 more sources

Decision Making in Team-Adversary Games with Combinatorial Action Space

open access: yesCAAI Artificial Intelligence Research, 2023
The team-adversary game simulates many real-world scenarios in which a team of agents competes cooperatively against an adversary. However, decision-making in this type of game is a big challenge since the joint action space of the team is combinatorial ...
Shuxin Li   +4 more
doaj   +2 more sources

Toward Quantum Combinatorial Games [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2018
In this paper, we propose a Quantum variation of combinatorial games, generalizing the Quantum Tic-Tac-Toe proposed by Allan Goff. A combinatorial game is a two-player game with no chance and no hidden information, such as Go or Chess.
Paul Dorbec, Mehdi Mhalla
doaj   +2 more sources

A General Upper Bound for the Runtime of a Coevolutionary Algorithm on Impartial Combinatorial Games. [PDF]

open access: yesAlgorithmica
Due to their complex dynamics, combinatorial games are a key test case and application for algorithms that train game playing agents. Among those algorithms that train using self-play are coevolutionary algorithms (CoEAs).
Benford A, Lehre PK.
europepmc   +2 more sources

Isomorphism theorems for impartial combinatorial games [PDF]

open access: yesDiscrete Mathematics Letters
We introduce the category of optiongraphs and option-preserving maps as a model to study impartial combinatorial games. Outcomes, remoteness, and extended nim-values are preserved under option-preserving maps.
Mikhail Baltushkin   +2 more
doaj   +2 more sources

A Theoretical Model of Sequential Combinatorial Games of Subsidies and Penalties: From Waste to Renewable Energy

open access: yesFrontiers in Energy Research, 2021
Subsidies and penalties are two main regulation methods adopted by authorities to promote the development of renewable energy. Due to the possibility of subsidy fraud, it is necessary to explore effective ways to combine these two policies.
Yijie Dou, Tong Zhang, Xin Meng
doaj   +2 more sources

The combinatorial game theory of well-tempered scoring games [PDF]

open access: yesInternational Journal of Game Theory, 2013
60 pages, 21 ...
Will Johnson
exaly   +3 more sources

The strategy dynamics of collective systems: Underlying hindrances beyond two-actor coordination. [PDF]

open access: yesPLoS ONE
Engineering systems, characterized by their high technical complexity and societal intricacies, require a strategic design approach to navigate multifaceted challenges.
Ambrosio Valencia-Romero, Paul T Grogan
doaj   +2 more sources

A method for eternally dominating strong grids [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2020
In the eternal domination game, an attacker attacks a vertex at each turn and a team of guards must move a guard to the attacked vertex to defend it. The guards may only move to adjacent vertices and no more than one guard may occupy a vertex.
Alizée Gagnon   +7 more
doaj   +1 more source

Home - About - Disclaimer - Privacy