相关论文: Perfect Commuting-Operator Strategies for Linear S…

Entangled quantum systems can exhibit correlations that cannot be simulated classically. For historical reasons such correlations are called "Bell inequality violations." We give two new two-player games with Bell inequality violations that…

We study the global convergence of policy optimization for finding the Nash equilibria (NE) in zero-sum linear quadratic (LQ) games. To this end, we first investigate the landscape of LQ games, viewing it as a nonconvex-nonconcave…

The non-local game scenario provides a powerful framework to study the limitations of classical and quantum correlations, by studying the upper bounds of the winning probabilities those correlations offer in cooperation games where…

A binary constraint system game is a two-player one-round non-local game defined by a system of Boolean constraints. The game has a perfect quantum strategy if and only if the constraint system has a quantum satisfying assignment [R. Cleve…

This paper aims to solve the optimal strategy against a well-known adaptive algorithm, the Hedge algorithm, in a finitely repeated $2\times 2$ zero-sum game. In the literature, related theoretical results are very rare. To this end, we make…

The Li-Du-Massar quantum duopoly model is one of the generally accepted quantum game schemes. It has applications in a wide range of duopoly problems. Our purpose is to study Stackelberg's duopoly with incomplete information in the quantum…

In a recently introduced coset guessing game, Alice plays against Bob and Charlie, aiming to meet a joint winning condition. Bob and Charlie can only communicate before the game starts to devise a joint strategy. The game we consider begins…

Consider two agents, Alice and Bob, each of whom takes a quantum input, operates on a shared quantum system $K$, and produces a quantum output. Alice and Bob's operations may commute, in the sense that the joint input-output behaviour is…

Entropy games and matrix multiplication games have been recently introduced by Asarin et al. They model the situation in which one player (Despot) wishes to minimize the growth rate of a matrix product, whereas the other player (Tribune)…

The convex grabbing game is a game where two players, Alice and Bob, alternate taking extremal points from the convex hull of a point set on the plane. Rational weights are given to the points. The goal of each player is to maximize the…

Finite mixture models are an important tool in the statistical analysis of data, for example in data clustering. The optimal parameters of a mixture model are usually computed by maximizing the log-likelihood functional via the…

The class of exact transferable utility coalitional games, introduced in 1972 by Schmeidler, has been studied both in the context of game theory and in the context of imprecise probabilities. We characterize the cone of exact games by…

In this paper we study a linear pursuit differential game described by an infinite system of first-order differential equations in Hilbert space. The control functions of players are subject to geometric constraints. The pursuer attempts to…

We consider zero-sum stochastic games with finite state and action spaces, perfect information, mean payoff criteria, without any irreducibility assumption on the Markov chains associated to strategies (multichain games). The value of such…

This paper studies a class of network games with linear-quadratic payoffs and externalities exerted through a strictly concave interaction function. This class of game is motivated by the diminishing marginal effects with peer influences.…

This paper considers a game-theoretic formulation of the covert communications problem with finite blocklength, where the transmitter (Alice) can randomly vary her transmit power in different blocks, while the warden (Willie) can randomly…

A group of intelligent agents which fulfill a set of tasks in parallel is represented first by the tensor multiplication of corresponding processes in a linear logic game category. An optimal itinerary in the configuration space of the…

In 1993, Mermin (Rev. Mod. Phys. 65, 803--815) gave lucid and strikingly simple proofs of the Bell-Kochen-Specker (BKS) theorem in Hilbert spaces of dimensions four and eight by making use of what has since been referred to as the…

By results of Dantzig (1951) and Adler (2013), computing the optimal solutions of a linear program is equivalent to finding optimal strategies in zero-sum bimatrix games. Dantzig's original result was incomplete, in the sense that the…

Matching games is a one-to-one two sided market model introduced by Garrido-Lucero and Laraki, in which coupled agents' utilities are endogenously determined as the outcome of a strategic game. They refine the classical pairwise stability…