Additive stabilizers for unstable graphs
نویسندگان
چکیده
منابع مشابه
Additive Stabilizers for Unstable Graphs
Stabilization of graphs has received substantial attention in recent years due to its connection to game theory. Stable graphs are exactly the graphs inducing a matching game with non-empty core. They are also the graphs that induce a network bargaining game with a balanced solution. A graph with weighted edges is called stable if the maximum weight of an integral matching equals the cost of a ...
متن کاملFinding Small Stabilizers for Unstable Graphs
An undirected graph G = (V,E) is stable if its inessential vertices (those that are exposed by at least one maximum matching) form a stable set. We call a set of edges F ⊆ E a stabilizer if its removal from G yields a stable graph. In this paper we study the following natural edgedeletion question: given a graph G = (V,E), can we find a minimumcardinality stabilizer? Stable graphs play an impor...
متن کاملFinding small stabilizers for unstable graphs
In an instance of the classical, cooperative matching game introduced by Shapley and Shubik [Int. J. Game Theory ’71] we are given an undirected graph G = (V,E), and we define the value ν(S) of each subset S ⊆ V as the cardinality of a maximum matching in the subgraph G[S] induced by S. The core of such a game contains all fair allocations of ν(V ) among the players of V , and is well-known to ...
متن کاملNon-Smooth Stabilizers for Nonlinear Systems with Uncontrollable Unstable Linearization
We prove that every chain of odd power integrators perturbed by a C triangular vector eld can be stabilized in the large via continuous state feedback, although it is not stabilizable, even locally, by any smooth state feedback. The proof is constructive and accomplished by developing a machinery|a continuous type of adding a power integrator|that enables one to explicitly design a C globally s...
متن کاملAdditive Automata On Graphs
A bstract. We study cellular automata. with addi tive rules on finite undi rected graphs. The addition is carried out in some finite abelian mono id. We investigate the prob lem of deciding wheth er a given configuration has a predecessor . Depending on th e underlying monoid this prob lem is solvable in polynomial time or NP-complete. Furt hermo re, we st udy the global reversibility of cellul...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Optimization
سال: 2019
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2018.08.003