Entropy Bounds for Local Coordination and Graph Amenability

Ron Peretz, Dean Kraizberg

We study local pure coordination games on finite graphs. In these games, each vertex must choose one of two symmetric actions using only local information, and the cost is the aver…