On time versus size for monotone dynamic monopolies in regular topologies
نویسندگان
چکیده
منابع مشابه
On time versus size for monotone dynamic monopolies in regular topologies
We consider a well known distributed coloring game played on a simple connected graph: initially, each vertex is colored black or white; at each round, each vertex simultaneously recolors itself by the color of the simple (strong) majority of its neighbours. A set of vertices is said to be a dynamo, if starting the game with only the vertices of colored black, the computation eventually reaches...
متن کاملDynamic Monopolies of Constant Size
This paper deals with a polling game on a graph. Initially, each vertex is colored white or black. At each round, each vertex is colored by the color shared by the majority of vertices in its neighborhood. (All recolorings are done simultaneously). We say that a set W0 of vertices is a dynamic monopoly or dynamo if starting the game with the vertices ofW0 colored white, the entire system is whi...
متن کاملOn irreversible dynamic monopolies in general graphs
Consider the following coloring process in a simple directed graph G(V, E) with positive indegrees. Initially, a set S of vertices are white, whereas all the others are black. Thereafter, a black vertex is colored white whenever more than half of its in-neighbors are white. The coloring process ends when no additional vertices can be colored white. If all vertices end up white, we call S an irr...
متن کاملTime-Differentiated Monopolies
We consider sequential competition among sellers, with different consumers desiring the good at different times. Each consumer has the option of buying from a later seller. Each seller recognizes that future sellers are potential competitors. We find that if sellers do not know the previous history of sales, then an equilibrium price is necessarily the same as that which would be set by a simpl...
متن کاملPositive Neural Networks in Discrete Time Implement Monotone-Regular Behaviors
We study the expressive power of positive neural networks. The model uses positive connection weights and multiple input neurons. Different behaviors can be expressed by varying the connection weights. We show that in discrete time and in the absence of noise, the class of positive neural networks captures the so-called monotone-regular behaviors, which are based on regular languages. A finer p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Discrete Algorithms
سال: 2003
ISSN: 1570-8667
DOI: 10.1016/s1570-8667(03)00022-4