We study existence of (subgame perfect) Nash equilibria (NE) in pure positional strategies in finite positional n-person games with perfect information and terminal payoffs. However, these games may have moves of chance and cycles. Yet, we assume that All Infinite Plays Form One Outcome a∞, in addition to the set of Terminal outcomes VT . This assumption will be called the AIPFOOT condition. Fo...

In this paper, we continue the study of the domination game in graphs introduced by Bre{v{s}}ar, Klav{v{z}}ar, and Rall. We study the paired-domination version of the domination game which adds a matching dimension to the game. This game is played on a graph $G$ by two players, named Dominator and Pairer. They alternately take turns choosing vertices of $G$ such that each vertex chosen by Domin...

Data-free quantization (DFQ) recovers the performance of quantized network (Q) without accessing real data, but generates fake sample via a generator (G) by learning from full-precision (P) instead. However, such generation process is totally independence Q, specialized as failing to consider adaptability generated samples, i.e., beneficial or adversarial, over resulting into non-ignorable loss...