Related papers: A Linear Programming Approach to the Super-Stable …
A probabilistic approach to the stable matching problem has been identified as an important research area with several important open problems. When considering random matchings, ex-post stability is a fundamental stability concept. A…
The paper establishes necessary and sufficient conditions for stability of different join-the-shortest-queue models including load-balanced networks with general input and output processes. It is shown, that the necessary and sufficient…
In this paper, we identify sufficient conditions under which static teams and a class of sequential dynamic teams admit team-optimal solutions. We first investigate the existence of optimal solutions in static teams where the observations…
In this paper, a new information theoretic framework for graph matching is introduced. Using this framework, the graph isomorphism and seeded graph matching problems are studied. The maximum degree algorithm for graph isomorphism is…
We apply Lattice-Linear Predicate Detection Technique to derive parallel and distributed algorithms for various variants of the stable matching problem. These problems are: (a) the constrained stable marriage problem (b) the super stable…
We consider the problem of exact and inexact matching of weighted undirected graphs, in which a bijective correspondence is sought to minimize a quadratic weight disagreement. This computationally challenging problem is often relaxed as a…
In this document, we prove the convergence of the model proposed in [1], which aims at estimating the LoRaWAN network performance in a single-gateway scenario. First, we provide an analytical proof of the existence of a fixed point solution…
Synchronous linear constraint system games are nonlocal games that verify whether or not two players share a solution to a given system of equations. Two algebraic objects associated to these games encode information about the existence of…
Graph pattern matching is often defined in terms of subgraph isomorphism, an NP-complete problem. To lower its complexity, various extensions of graph simulation have been considered instead. These extensions allow pattern matching to be…
In this paper, we investigate asymptotic stability of linear time-varying systems with (sub-) stochastic system matrices. Motivated by distributed dynamic fusion over networks of mobile agents, we impose some mild regularity conditions on…
We develop a new numerical method for approximating the infinite time reachable set of strictly stable linear control systems. By solving a linear program with a constraint that incorporates the system dynamics, we compute a polytope with…
Extending the thoroughly studied theory of group stability, we study Ulam stability type problems for associative and Lie algebras; namely, we investigate obstacles to rank-approximation of almost solutions by exact solutions for systems of…
Adaptivity to changing environments and constraints is key to success in modern society. We address this by proposing "incrementalized versions" of Stable Marriage and Stable Roommates. That is, we try to answer the following question: for…
The aim of this work is to establish a linear instability criterium of stationary solutions for the Korteweg-de Vries model on a star graph with a structure represented by a finite collections of semi-infinite edges. By considering a…
It is generally known that in order to solve the split equality fixed-point problem (SEFPP), it is necessary to compute the norm of bounded and linear operators, which is a challenging task in real life, to address this issue, we studied…
The stability analysis of a class of discontinuous discrete-time systems is studied in this paper. The system under study is modeled as a feedback interconnection of a linear system and a set-valued nonlinearity. An equivalent…
The maximal matching problem has received considerable attention in the self-stabilizing community. Previous work has given different self-stabilizing algorithms that solves the problem for both the adversarial and fair distributed daemon,…
I introduce a stability notion, dynamic stability, for two-sided dynamic matching markets where (i) matching opportunities arrive over time, (ii) matching is one-to-one, and (iii) matching is irreversible. The definition addresses two…
We study the existence of stable matchings when agents have choice correspondences instead of preference relations. We extend the framework of \cite{chambers2017choice} by weakening the path independence assumption. For many-to-many…
Stable matching is a fundamental area with many practical applications, such as centralised clearinghouses for school choice or job markets. Recent work has introduced the paradigm of near-feasibility in capacitated matching settings, where…