Related papers: Regularity and stability for a convex feasibility …
An instance of the super-stable matching problem with incomplete lists and ties is an undirected bipartite graph $G = (A \cup B, E)$, with an adjacency list being a linearly ordered list of ties. Ties are subsets of vertices equally good…
While numerous extensions of Banach's fixed point theorem typically offer only sufficient conditions for the existence and uniqueness of a fixed point and the convergence of iterative sequences, this study introduces a generalization…
New approaches to the study of stability of solutions of Set Differential Equations (SDEs) based on convex geometry and the theory of mixed volumes were proposed. The stability of the forms of program solutions of linear SDEs with a stable…
The stable marriage problem with ties is a well-studied and interesting problem in game theory. We are given a set of men and a set of women. Each individual has a preference ordering on the opposite group, which can possibly contain ties.…
It is well known that every stable matching instance $I$ has a rotation poset $R(I)$ that can be computed efficiently and the downsets of $R(I)$ are in one-to-one correspondence with the stable matchings of $I$. Furthermore, for every poset…
Let $(A, B)$ be a nonempty bounded closed convex proximal parallel pair in a nearly uniformly convex Banach space and $T: A\cup B \rightarrow A\cup B$ be a continuous and asymptotically relatively nonexpansive map. We prove that there…
Given two planar, conformal, smooth open sets $\Omega$ and $\omega$, we prove the existence of a sequence of smooth sets $\Omega_n$ which geometrically converges to $\Omega$ and such that the (perimeter normalized) Steklov eigenvalues of…
We study the existence of fixed points for continuous maps $f$ from an $n$-ball $X$ in $\mathbb R^n$ to $\mathbb R^n$ with $n\geq 1$. We show that $f$ has a fixed point if, for some absolute retract $Y\subset\partial X$, $f(Y)\subset X$ and…
In the stable marriage problem N men and N women have to be matched by pairs under the constraint that the resulting matching is stable. We study the statistical properties of stable matchings in the large N limit using both numerical and…
In this paper, for the first time in the literature, we study the stability of solutions of two classes of feasibility (i.e., split equality and split feasibility) problems by set-valued and variational analysis techniques. Our idea is to…
We show that if the rotation set of a homeomorphism of the torus is stable under small perturbations of the dynamics, then it is a convex polygon with rational vertices. We also show that such homeomorphisms are $C^0$-generic and have…
Robust Stable Marriage (RSM) is a variant of the classical Stable Marriage problem, where the robustness of a given stable matching is measured by the number of modifications required for repairing it in case an unforeseen event occurs. We…
We consider a transmission problem where a structurally damped plate equation is coupled with a damped or undamped wave equation by transmission conditions. We show that exponential stability holds in the damped-damped situation and…
We study the stability of fixed points in the two-loop renormalization group for the random field O($N$) spin model in $4+\epsilon$ dimensions. We solve the fixed-point equation in the 1/N expansion and $\epsilon$ expansion. In the large-N…
We study the usage of regularity properties of collections of sets in convergence analysis of alternating projection methods for solving feasibility problems. Several equivalent characterizations of these properties are provided. Two…
A population protocol stably computes a relation R(x,y) if its output always stabilizes and R(x,y) holds if and only if y is a possible output for input x. Alternatively, a population protocol computes a predicate R(<x,y>) on pairs <x,y> if…
We study the spaces of locally-finite stability conditions on the derived categories of coherent sheaves on the minimal resolutions of $A_n$-singularities supported at the exceptional sets. Our main theorem is that they are connected and…
We study the long-time behavior an extended Navier-Stokes system in $\R^2$ where the incompressibility constraint is relaxed. This is one of several "reduced models" of Grubb and Solonnikov '89 and was revisited recently (Liu, Liu, Pego…
Let $A \subset \mathbb{Z}^d$ be a finite set. It is known that the sumset $NA$ has predictable size ($\vert NA\vert = P_A(N)$ for some $P_A(X) \in \mathbb{Q}[X]$) and structure (all of the lattice points in some finite cone other than all…
In this paper, we consider one-to-one matchings between two disjoint groups of agents. Each agent has a preference over a subset of the agents in the other group, and these preferences may contain ties. Strong stability is one of the…