Dynamic consistency and monopoly
β Scribed by Gregory E. Goering; Michael K. Pippenger
- Publisher
- Springer US
- Year
- 2003
- Tongue
- English
- Weight
- 567 KB
- Volume
- 31
- Category
- Article
- ISSN
- 0197-4254
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Let G be a simple connected graph where every node is colored either black or white. Consider now the following repetitive process on G: each node recolors itself, at each local time step, with the color held by the majority of its neighbors. Depending on the initial assignment of colors to the node
The 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, at the previous round. (All recolorings are done simultaneously.) We say that a set W 0 of vert