Related papers: A Weak Solution of Inverse Treblecross
This paper focuses on a kind of linear quadratic non-zero sum differential game driven by backward stochastic differential equation with asymmetric information, which is a natural continuation of Wang and Yu [IEEE TAC (2010) 55: 1742-1747,…
We study constrained bi-matrix games, with a particular focus on low-rank games. Our main contribution is a framework that reduces low-rank games to smaller, equivalent constrained games, along with a necessary and sufficient condition for…
We show that solving delay games with winning conditions given by deterministic and nondeterministic weak Muller automata is 2EXPTIME-complete respectively 3EXPTIME-complete. Furthermore, doubly and triply exponential lookahead is necessary…
We present a position in infinite chess exhibiting an ordinal game value of $\omega^4$, thereby improving on the previously largest-known values of $\omega^3$ and $\omega^3\cdot 4$.
The area of inverse problems in mathematics is highly interdisciplinary. In various fields of science, engineering, medicine, and industry, there arises a need to reconstruct information about unknown entities that cannot be directly…
Systems of fuzzy relation equations and inequalities in which an unknown fuzzy relation is on the one side of the equation or inequality are linear systems. They are the most studied ones, and a vast literature on linear systems focuses on…
Following the solution to the One-Round Voronoi Game in arXiv:2011.13275, we naturally may want to consider similar games based upon the competitive locating of points and subsequent dividing of territories. In order to appease the tears of…
In this paper, we study nonzero-sum separable games, which are continuous games whose payoffs take a sum-of-products form. Included in this subclass are all finite games and polynomial games. We investigate the structure of equilibria in…
This paper provides a complexity analysis for the game of dark Chinese chess (a.k.a. "JieQi"), a variation of Chinese chess. Dark Chinese chess combines some of the most complicated aspects of board and card games, such as long-term…
This paper provides an overview of current approaches for solving inverse problems in imaging using variational methods and machine learning. A special focus lies on point estimators and their robustness against adversarial perturbations.…
Iterative regularization exploits the implicit bias of an optimization algorithm to regularize ill-posed problems. Constructing algorithms with such built-in regularization mechanisms is a classic challenge in inverse problems but also in…
We provide new results on the existence of nonzero positive weak solutions for a class of second order elliptic systems. Our approach relies on a combined use of iterative techniques and classical fixed point index. Some examples are…
Chocolate bar games are variants of the game of Nim in which the goal is to leave your opponent with the single bitter part of the chocolate bar. The rectangular chocolate bar game is a thinly disguised form of classical multi-heap Nim. In…
A cumbersome operation in numerical analysis and linear algebra, optimization, machine learning and engineering algorithms; is inverting large full-rank matrices which appears in various processes and applications. This has both numerical…
We study a general class of nonlinear second-order variational inequalities with interconnected bilateral obstacles, related to a multiple modes switching game. Under rather weak assumptions, using systems of penalized unilateral backward…
Making decisions in the presence of a strategic opponent requires one to take into account the opponent's ability to actively mask its intended objective. To describe such strategic situations, we introduce the non-cooperative inverse…
We introduce a new impartial game, named Multiple Hook Removing Game (MHRG for short). We also determine the $\mathcal{G}$-values of some game positions (including the starting positions) in MHRG$(m,n)$, the MHRG whose starting position is…
We introduce an evolutionary game with feedback between perception and reality, which we call the reality game. It is a game of chance in which the probabilities for different objective outcomes (e.g., heads or tails in a coin toss) depend…
We study a robust optimal stopping problem with respect to a set $\cP$ of mutually singular probabilities. This can be interpreted as a zero-sum controller-stopper game in which the stopper is trying to maximize its pay-off while an adverse…
We investigate the equilibrium stability and robustness in a class of moving target defense problems, in which players have both incomplete information and asymmetric cognition. We first establish a Bayesian Stackelberg game model for…