相关论文: Tracially embeddable strategies: Lifting MIP* tric…

The modular operator approach of Tomita-Takesaki to von Neumann algebras is elucidated in the algebraic structure of certain supersymmetric quantum mechanical systems. A von Neumann algebra is constructed from the operators of the system.…

Nonlinear model predictive control~(NMPC) generally requires the solution of a non-convex optimization problem at each sampling instant under strict timing constraints, based on a set of differential equations that can often be stiff and/or…

We review the correspondence between synchronous games and their associated $*$-algebra. Building upon the work of (Helton et al., New York J. Math. 2017), we propose results on algebraic and locally commuting graph identities. Based on the…

We revisit the problem of learning in two-player zero-sum Markov games, focusing on developing an algorithm that is uncoupled, convergent, and rational, with non-asymptotic convergence rates. We start from the case of stateless matrix game…

Mixed-motive multi-agent settings are rife with persistent free-riding because individual effort benefits all members equally, yet each member bears the full cost of their own contribution. Classical work by Holmstr\"om established that…

In this paper, we discuss coding theorems on a $(2, 2)$--threshold scheme in the presence of an opponent who impersonates one of the two shareholders in an asymptotic setup. We consider a situation where $n$ secrets $S^n$ from a memoryless…

Multi-time-scale stochastic approximation is an iterative algorithm for finding the fixed point of a set of $N$ coupled operators given their noisy samples. It has been observed that due to the coupling between the decision variables and…

Except for special classes of games, there is no systematic framework for analyzing the dynamical properties of multi-agent strategic interactions. Potential games are one such special but restrictive class of games that allow for tractable…

We study second order perturbation theory for embedded eigenvalues of an abstract class of self-adjoint operators. Using an extension of the Mourre theory, under assumptions on the regularity of bound states with respect to a conjugate…

Motivated by applications in wireless communications, this paper develops semidefinite programming (SDP) relaxation techniques for some mixed binary quadratically constrained quadratic programs (MBQCQP) and analyzes their approximation…

We study the so-called two-time-scale stochastic approximation, a simulation-based approach for finding the roots of two coupled nonlinear operators. Our focus is to characterize its finite-time performance in a Markov setting, which often…

This work presents a unified framework that combines global approximations with locally built models to handle challenging nonconvex and nonsmooth composite optimization problems, including cases involving extended real-valued functions. We…

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…

We investigate generalized measurements, based on positive-operator-valued measures, and von Neumann measurements for the unambiguous discrimination of two mixed quantum states that occur with given prior probabilities. In particular, we…

This article uses data from two experimental studies of two-person Prisoner's Dilemma games [1, 2] and compares the data with the theoretic predictions calculated with the use of a quantum game theoretical method. The experimental findings…

A unital $C^*$-algebra is called $N$-subhomogeneous if its irreducible representations are finite dimensional with dimension at most $N$. We extend this notion to operator systems, replacing irreducible representations by boundary…

We explore links between the thin concurrent games of Castellan, Clairambault and Winskel, and the weighted relational models of linear logic studied by Laird, Manzonetto, McCusker and Pagani. More precisely, we show that there is an…

Unsupervised graph alignment finds the node correspondence between a pair of attributed graphs by only exploiting graph structure and node features. One category of recent studies first computes the node representation and then matches…

We introduce a new class of operator algebras -- tracially complete C*-algebras -- as a vehicle for transferring ideas and results between C*-algebras and their tracial von Neumann algebra completions. We obtain structure and classification…

We show that a partition of the unity (or POVM) on a Hilbert space that is almost orthogonal is close to an orthogonal POVM in the same von Neumann algebra. This generalizes to infinite dimension previous results in matrix algebras by…