Related papers: The tilted CHSH games: an operator algebraic class…
We present the complete set of $N=1$, $D=4$ quantum algebras associated to massive superparticles. We obtain the explicit solution of these algebras realized in terms of unconstrained operators acting on the Hilbert space of superfields.…
We introduce Contested Logistics Games, a variant of logistics problems that account for the presence of an adversary that can disrupt the movement of goods in selected areas. We model this as a large two-player zero-sum one-shot game…
In this work, we present an abstract theory for the approximation of operator-valued Riccati equations posed on Hilbert spaces. It is demonstrated here that the error of the approximate solution to the operator-valued Riccati equation is…
Using the representation introduced in \cite{frame}, an artificial game in quantum strategy space is proposed and studied. Although it has well-known classical correspondence, which has classical mixture strategy Nash Equilibrium states,…
We consider a class of optimization problems defined by a system of linear equations with min and max operators. This class of optimization problems has been studied under restrictive conditions, such as, (C1) the halting or stability…
Synthesis of finite-state controllers from high-level specifications in multi-agent systems can be reduced to solving multi-player concurrent games over finite graphs. The complexity of solving such games with qualitative objectives for…
In Zeng et al. [Fluct. Noise Lett. 7 (2007) L439--L447] the analysis of the lowest unique positive integer game is simplified by some reasonable assumptions that make the problem tractable for arbitrary numbers of players. However, here we…
Hereunder we continue the study of the representation theory of the algebra of permutation operators acting on the $n$-fold tensor product space, partially transposed on the last subsystem. We develop the concept of partially reduced…
We study operator spaces, operator algebras, and operator modules, from the point of view of the `noncommutative Shilov boundary'. In this attempt to utilize some `noncommutative Choquet theory', we find that Hilbert C$^*-$modules and their…
Nash equilibrium serves as a fundamental mathematical tool in economics and game theory. However, it classically assumes knowledge of player utilities, whereas economics generally regards preferences as more fundamental. To leverage…
In this paper, we study finite-agent linear-quadratic games on graphs. Specifically, we propose a comprehensive framework that extends the existing literature by incorporating heterogeneous and interpretable player interactions. Compared to…
Concurrent stochastic games (CSGs) are an ideal formalism for modelling probabilistic systems that feature multiple players or components with distinct objectives making concurrent, rational decisions. Examples include communication or…
We study the Active Simple Hypothesis Testing (ASHT) problem, a simpler variant of the Fixed Budget Best Arm Identification problem. In this work, we provide novel game theoretic formulation of the upper bounds of the ASHT problem. This…
We call an operator algebra A {\em reversible} if A with reversed multiplication is also an abstract operator algebra (in the modern operator space sense). This class of operator algebras is intimately related to the {\em symmetric operator…
The coalgebraic approach to modal logic provides a uniform framework that captures the semantics of a large class of structurally different modal logics, including e.g. graded and probabilistic modal logics and coalition logic. In this…
Communication games are one of the widely used tools that are designed to demonstrate quantum supremacy over classical resources. In that, two or more parties collaborate to perform an information processing task to achieve the highest…
In this work, we establish near-linear and strong convergence for a natural first-order iterative algorithm that simulates Von Neumann's Alternating Projections method in zero-sum games. First, we provide a precise analysis of Optimistic…
A general method is described for finding algebraic expressions for matrix elements of any one- and two-particle operator for an arbitrary number of subshells in an atomic configuration, requiring neither coefficients of fractional…
Dynamic games are powerful tools to model multi-agent decision-making, yet computing Nash (generalized Nash) equilibria remains a central challenge in such settings. Complexity arises from tightly coupled optimality conditions, nested…
We propose a type of non-cooperative game, termed multi-cluster aggregative game, which is composed of clusters as players, where each cluster consists of collaborative agents with cost functions depending on their own decisions and the…