Related papers: Non-uniformly Stable Common Independent Sets
We study computational questions related with the stability of discrete-time linear switching systems with switching sequences constrained by an automaton. We first present a decidable sufficient condition for their boundedness when the…
We consider the problem of asymptotic convergence to invariant sets in interconnected nonlinear dynamic systems. Standard approaches often require that the invariant sets be uniformly attracting. e.g. stable in the Lyapunov sense. This,…
The stability analysis of synchronization patterns on generalized network structures is of immense importance nowadays. In this article, we scrutinize the stability of intralayer synchronous state in temporal multilayer hypernetworks, where…
The aim of this paper is to present a symbolic computational algorithm that will allow us to deal with the feedback stabilization problem for continuous nonlinear polynomial systems. The overall approach is based on a methodology that…
Many important stable matching problems are known to be NP-hard, even when strong restrictions are placed on the input. In this paper we seek to identify structural properties of instances of stable matching problems which will allow us to…
This paper considers robust stability analysis of a large network of interconnected uncertain systems. To avoid analyzing the entire network as a single large, lumped system, we model the network interconnections with integral quadratic…
We introduce a new and broader formulation of the stable marriage problem (SMP), called the stable polygamy problem (SPP), where multiple individuals from a larger group $L$ of $|L|$ individuals can be matched with a single individual from…
We generalize several schedule matching theorems of Baiou-Balinski (Math. Oper. Res., 27 (2002), 485) and Alkan-Gale (J. Econ. Th. 112 (2003), 289) by applying a fixed point method of Fleiner (Math. Oper. Res., 28 (2003), 103). Thanks to a…
In this paper we aim to present two general results regarding, on one hand, the openness stability of set-valued maps and, on the other hand, the metric regularity behavior of the implicit multifunction related to a generalized variational…
We study stable matchings that are robust to preference changes in the two-sided stable matching setting of Gale and Shapley [GS62]. Given two instances $A$ and $B$ on the same set of agents, a matching is said to be robust if it is stable…
We define a natural notion of higher order stability and show that subsets of $\mathbb{F}_p^n$ that are tame in this sense can be approximately described by a union of low-complexity quadratic varieties, up to linear error. This generalizes…
The stability of classical semi-implicit scheme, and some more advanced iterative schemes recently proposed for Numerical Weather Prediction (NWP) purpose is examined. In all these schemes, the solution of the centred-implicit non-linear…
We consider the question of determining whether or not a given system of fractional-order differential equations is (asymptotically) stable. In particular, we admit systems where each constituent equation may have its own order, independent…
The popular matching problem is of matching a set of applicants to a set of posts, where each applicant has a preference list, ranking a non-empty subset of posts in the order of preference, possibly with ties. A matching M is popular if…
Stationarity is a very general, qualitative assumption, that can be assessed on the basis of application specifics. It is thus a rather attractive assumption to base statistical analysis on, especially for problems for which less general…
This paper is concerned with the study of the stability of dynamical systems evolving on time scales. We first {formalize the notion of matrix measures on time scales, prove some of their key properties and make use of this notion to study…
Assessment of the degree of boundedness/stability of multidimensional nonlinear systems with time-dependent and nonperiodic coefficients is an important problem in various applied areas which has no adequate resolution yet. Most of the…
Clustering with most objective functions is NP-Hard, even to approximate well in the worst case. Recently, there has been work on exploring different notions of stability which lend structure to the problem. The notion of stability,…
When computing stable matchings, it is usually assumed that the preferences of the agents in the matching market are fixed. However, in many realistic scenarios, preferences change over time. Consequently, an initially stable matching may…
The theory of optimal choice sets offers a well-established solution framework in social choice and game theory. In social choice theory, decision-making is typically modeled as a maximization problem. However, when preferences are cyclic…