Related papers: $\Psi$-Spaces and Semi-Proximality
We propose a subgradient-based method for finding the maximum feasible subsystem in a collection of closed sets with respect to a given closed set $C$ (MFS$_C$). In this method, we reformulate the MFS$_C$ problem as an $\ell_0$ optimization…
There is evidence that the numbers in probabilistic inference don't really matter. This paper considers the idea that we can make a probabilistic model simpler by making fewer distinctions. Unfortunately, the level of a Bayesian network…
Congestion games constitute an important class of games in which computing an exact or even approximate pure Nash equilibrium is in general {\sf PLS}-complete. We present a surprisingly simple polynomial-time algorithm that computes…
We study the approximability of predicates on $k$ variables from a domain $[q]$, and give a new sufficient condition for such predicates to be approximation resistant under the Unique Games Conjecture. Specifically, we show that a predicate…
We develop a pseudo-metric analogue of bisimulation for generalized semi-Markov processes. The kernel of this pseudo-metric corresponds to bisimulation; thus we have extended bisimulation for continuous-time probabilistic processes to a…
We introduce a formal notion of masking fault-tolerance between probabilistic transition systems using stochastic games. These games are inspired in bisimulation games, but they also take into account the possible faulty behavior of…
Molodstov[10] introduced soft set theory as a new mathematical approach for solving problems having uncertainties. Many researchers worked on the findings of structures of soft set theory and applied to many problems having uncertainties.…
We show that the existence of a Suslin tree does not necessarily imply that there are uncountable minimal linear orders other than $\omega_1$ and $-\omega_1$, answering a question of J. Baumgartner. This is done by a Jensen-type iteration,…
Ladder networks are a notable new concept in the field of semi-supervised learning by showing state-of-the-art results in image recognition tasks while being compatible with many existing neural architectures. We present the recurrent…
The given study uses the methods to identify compactifications of semigroups $S\subset L(X),$ which reside in the space $L(X).$ This method generalizes in some sense the deLeeuw-Glicksberg-Theory to a greater class of functions. The…
A constraint satisfaction problem (CSP) is said to be \emph{approximation resistant} if it is hard to approximate better than the trivial algorithm which picks a uniformly random assignment. Assuming the Unique Games Conjecture, we give a…
This paper presents new families of algorithms for the repeated play of two-agent (near) zero-sum games and two-agent zero-sum stochastic games. For example, the family includes fictitious play and its variants as members. Commonly, the…
Recent work by Atserias and Dawar (J. Log. Comp 2019) and Tucker-Foltz (LMCS 2024) has established undefinability results in fixed-point logic with counting (FPC) corresponding to many classical complexity results from the hardness of…
The article is devoted to a structure of topological spaces related with topological quasigroups. Regular and complete spaces over topological quasigroups are studied. Separations and embeddings are also investigated for them. Their…
We introduce a semi-implicit Euler-Maruyama approximation which preservers the non-colliding property for some class of non-colliding particle systems such as Dyson Brownian motions, Dyson-Ornstein-Uhlenbeck processes and Brownian particles…
In this paper, we derive a tight upper bound for the size of an intersecting $k$-Sperner family of subspaces of the $n$-dimensional vector space $\mathbb{F}_{q}^{n}$ over finite field $\mathbb{F}_{q}$ which gives a $q$-analogue of the…
Non-autonomous self-similar sets are a family of compact sets which are, in some sense, highly homogeneous in space but highly inhomogeneous in scale. The main purpose of this note is to clarify various regularity properties and separation…
Lipschitz games, in which there is a limit $\lambda$ (the Lipschitz value of the game) on how much a player's payoffs may change when some other player deviates, were introduced about 10 years ago by Azrieli and Shmaya. They showed via the…
We investigate the connection between pseudo-Hermitian and Hermitian descriptions for a lattice, which consists of a set of isomorphic pseudo-Hermitian clusters. We show that such non-Hermitian systems can act as Hermitian systems. This is…
In this paper, we prove that any analytic quasi-periodic cocycle close to constant is the Poincar\'{e} map of an analytic quasi-periodic linear system close to constant. With this local embedding theorem, we get fruitful new results. We…