Related papers: A QUBO Formulation for the Generalized Takuzu/Link…
This paper defines a general class of cooperative games for which the nucleolus is efficiently computable. This class includes new members for which the complexity of computing their nucleolus was not previously known. We show that when the…
Ising machines are next-generation computers expected to efficiently sample near-optimal solutions of combinatorial optimization problems. Combinatorial optimization problems are modeled as quadratic unconstrained binary optimization (QUBO)…
This paper introduces a novel method for finding integer sets that satisfy the Pythagorean theorem by leveraging the Higher-Order Binary Optimization (HOBO) formulation. Unlike the Quadratic Unconstrained Binary Optimization (QUBO)…
A number of recent studies have focused on novel features in game theory when the games are played using quantum mechanical toolbox (entanglement, unitary operators, measurement). Researchers have concentrated in two-player-two strategy,…
Theory of quantum games is relatively new to the literature and its applications to various areas of research are being explored. It is a novel interpretation of strategies and decisions in quantum domain. In the earlier work on quantum…
As consequences of disruptions in railway traffic affect passenger experience/satisfaction, appropriate rerouting and/or rescheduling is necessary. These problems are known to be NP-hard, given the numerous restrictions of traffic nature.…
We study bargaining games between suppliers and manufacturers in a network context. Agents wish to enter into contracts in order to generate surplus which then must be divided among the participants. Potential contracts and their surplus…
Quantum annealing is a promising approach for solving combinatorial optimization problems. However, its performance is often limited by the overhead of additional qubits required for embedding logical QUBO models onto quantum annealers.…
Sudoku is a popular combinatorial puzzle. A new method of solving Sudoku is presented, which involves formulating a puzzle as a special type of transportation problem. This model allows one to solve puzzles with more than one solution,…
Modern board games are a rich source of interesting and new challenges for combinatorial problems. The game Nmbr9 is a solitaire style puzzle game using polyominoes. The rules of the game are simple to explain, but modelling the game…
An algorithm based on backward induction is devised in order to compute the optimal sequence of games to be played in Parrondo games. The algorithm can be used to find the optimal sequence for any finite number of turns or in the steady…
The bin packing is a well-known NP-Hard problem in the domain of artificial intelligence, posing significant challenges in finding efficient solutions. Conversely, recent advancements in quantum technologies have shown promising potential…
Japanese tatami mats are often arranged so that no four mats meet. This local restriction imposes a rich combinatorial structure when applied to monomino-domino coverings of rectilinear grids. We describe a modular, mechanical game board,…
The computation of quantum entanglement can be formulated as a high-dimensional nonconvex optimization problem with orthogonality constraints. In this work, we propose structure-preserving consensus-based optimization (CBO) methods for…
From the standpoint of game theory, dominoes is a game that has not received much attention (specially the variety known as draw). It is usually thought that this game is already solved, given general results in game theory. However, the…
We give a strict mathematical description for a refinement of the Marinatto-Weber quantum game scheme. The model allows the players to choose projector operators that determine the state on which they perform their local operators. The game…
Gaussian Processes are used in many applications to model spatial phenomena. Within this context, a key issue is to decide the set of locations where to take measurements so as to obtain a better approximation of the underlying function.…
We present a proposal for optically implementing the quantum game of the two-player quantum prisoner's dilemma involving nonmaximally entangled states by using beam splitters, phase shifters, cross-Kerr medium, photon detector and the…
We use Quantum Imaginary Time Evolution (QITE) to solve polynomial unconstrained binary optimization (PUBO) problems. We show that a linear Ansatz yields good results for a wide range of PUBO problems, often outperforming standard classical…
In recent years, there is a growing interest in using quantum computers for solving combinatorial optimization problems. In this work, we developed a generic, machine learning-based framework for mapping continuous-space inverse design…