Related papers: A QUBO Formulation for the Generalized Takuzu/Link…
The Nakamura number of a simple game plays a critical role in preference aggregation (or multi-criterion ranking): the number of alternatives that the players can always deal with rationally is less than this number. We comprehensively…
Current hardware limitations restrict the potential when solving quadratic unconstrained binary optimization (QUBO) problems via the quantum approximate optimization algorithm (QAOA) or quantum annealing (QA). Thus, we consider training…
We introduce a new board game based on the ancient Chinese game of Go (Weiqi, Igo, Baduk). The key difference from the original game is that players no longer alternatively play single stones on the board but instead they take turns placing…
In this work, we study a triangular variant of the Lights Out game, proposed in the 2025 Capixaba Mathematics Olympiad. We present a combinatorial description of the game, formally characterize its operations, and introduce the notion of a…
Problems related to wavelength assignment (WA) in optical communications networks involve allocating transmission wavelengths for known transmission paths between nodes that minimize a certain objective function, for example, the total…
We extend variational quantum optimization algorithms for Quadratic Unconstrained Binary Optimization problems to the class of Mixed Binary Optimization problems. This allows us to combine binary decision variables with continuous decision…
Based on a previous generalization by the author of Latin squares to Latin boards, this paper generalizes partial Latin squares and related objects like partial Latin squares, completable partial Latin squares and Latin square puzzles. The…
In machine learning, fewer features reduce model complexity. Carefully assessing the influence of each input feature on the model quality is therefore a crucial preprocessing step. We propose a novel feature selection algorithm based on a…
The Sato-Crutchfield equations are studied analytically and numerically. The Sato-Crutchfield formulation is corresponding to losing memory. Then Sato-Crutchfield formulation is applied for some different types of games including hawk-dove,…
In an investigation of the applications of Combinatorial Game Theory to chess, we construct novel mutual Zugzwang positions, explain an otherwise mysterious pawn endgame from "A Guide to Chess Endings" (Euwe and Hooper), show positions…
We consider a coalitional game with the same payoff for all players. To maximize the payoff, the players need to use one collective strategy, if all players are in certain states, and the other strategy otherwise. The current state of each…
Quantum games have proposed a new point of view for the solution of the classical problems and dilemmas in game theory. Certain quantization relationships can be proposed with the objective that a game can be generalized into a quantum…
Simulation relations are an important tool in automata theory because they provide efficiently computable approximations to language inclusion. In recent years, extensions of ordinary simulations have been studied, for instance multi-pebble…
We construct a symmetric, simultaneous, deterministic evolution game $SGo$, which is in a certain mathematical sense a symmetrization of the classical board game Go. $SGo$ is in some ways a simpler game than Go, as Komi, Ko and suicide…
Quadratic unconstrained binary optimization (QUBO) is the standard interface to quantum annealers, yet a single constrained task admits many QUBO encodings whose penalty choices reshape the energy landscape experienced by hardware. We study…
We pursue the possible connections between classical games and quantum computation. The Parrondo game is one in which a random combination of two losing games produces a winning game. We introduce novel realizations of this Parrondo effect…
Bennett's pebble game was introduced to obtain better time/space tradeoffs in the simulation of standard Turing machines by reversible ones. So far only upper bounds for the tradeoff based on the pebble game have been published. Here we…
We study the extension of classical games to the quantum domain, generated by the addition of one unitary strategy to two classical strategies of each player. The conditions that need to be met by unitary operations to ensure that the…
Quantum Random Access Optimizer (QRAO) is a quantum-relaxation based optimization algorithm proposed by Fuller et al. that utilizes Quantum Random Access Code (QRAC) to encode multiple variables of binary optimization in a single qubit.…
Dialogue games are a two-player semantics for a variety of logics, including intuitionistic and classical logic. Dialogues can be viewed as a kind of analytic calculus not unlike tableaux. Can dialogue games be an effective foundation for…