Related papers: A Weak Solution of Inverse Treblecross

In this paper, we point out that the definition of weak tracial approximation can be improved and strengthened. An example of weak tracial approximation is also provided.

We propose and study a variation of the classical isomorphism problem for group rings in the context of projective representations. We formulate several weaker conditions following from our notion and give all logical connections between…

We analyze a zero-sum stochastic differential game between two competing players who can choose unbounded controls. The payoffs of the game are defined through backward stochastic differential equations. We prove that each player's priority…

We introduce the notion of invariant vectors of a game and develop the Invariance Reduction Process, which first uses reduction of positions via invariance and then zero and merge reductions of games to arrive at smaller, solved sub-games…

We introduce a way to compare actions in decision problems. One action is safer than another if the set of beliefs at which the decision-maker prefers the safer action expands as the decision-maker becomes more risk averse. We provide a…

We derive the weakly coupled systems of the infinity Laplace equations via a tug-of-war game introduced by Peres, Schramm, Sheffield, and Wilson (2009). We establish existence, uniqueness results of the solutions, and introduce a new notion…

This paper is concerned with a new type of differential game problems of forwardbackward stochastic systems. There are three distinguishing features: Firstly, our game systems are forward-backward doubly stochastic differential equations,…

In this paper, we provide explicit formulas for the exact inverses of the symmetric tridiagonal near-Toeplitz matrices characterized by weak diagonal dominance in the Toeplitz part. Furthermore, these findings extend to scenarios where the…

It is well known that in games with imperfect information, such as poker, bluffing with some probability can be a component of the optimal strategy. However, as far as we know, nobody has ever exhibited a Scrabble position in which the…

The legal positions of a strong placement game, such as Domineering, form a simplicial complex called the legal complex. In this paper, we use the legal complex to study the game values taken on by the class of strong placement games using…

This paper introduces a variant of the impartial combinatorial game nim, called tree nim, as well as a particular case of tree nim called tripod nim. A certain existence-uniqueness result and a periodicity result are proven about the…

We propose a general proximal algorithm for the inversion of ill-conditioned matrices. This algorithm is based on a variational characterization of pseudo-inverses. We show that a particular instance of it (with constant regularization…

We analyze two weak random operators, initially motivated from processes in random environment. Intuitively speaking these operators are ill-defined, but using bilinear forms one can deal with them in a rigorous way. This point of view can…

In an inverse game problem, one needs to infer the cost function of the players in a game such that a desired joint strategy is a Nash equilibrium. We study the inverse game problem for a class of multiplayer matrix games, where the cost…

Positional games are a branch of combinatorics, researching a variety of two-player games, ranging from popular recreational games such as Tic-Tac-Toe and Hex, to purely abstract games played on graphs and hypergraphs. It is closely…

In this paper, we considered impartial games on a simplicial complex. Each vertex of a given simplicial complex acts as a position of an impartial game. Each player in turn chooses a face of the simplicial complex and, for each position on…

We provide here an epistemic analysis of arbitrary strategic games based on the possibility correspondences. Such an analysis calls for the use of transfinite iterations of the corresponding operators. Our approach is based on Tarski's…

Weighted voting games are a family of cooperative games, typically used to model voting situations where a number of agents (players) vote against or for a proposal. In such games, a proposal is accepted if an appropriately weighted sum of…

We establish the equivalence between weak and viscosity solutions for non-homogeneous $p(x)$-Laplace equations with a right-hand side term depending on the spatial variable, the unknown, and its gradient. We employ inf- and sup-convolution…

This paper introduces a novel criterion, persuasiveness, to select equilibria in signaling games. In response to the Stiglitz critique, persuasiveness focuses on the comparison across equilibria. An equilibrium is more persuasive than an…