Hypergraphical Clustering Games of Mis-Coordination

Rann Smorodinsky, Shakhar Smorodinsky

Research output: Working paper/PreprintPreprint


We introduce and motivate the study of hypergraphical clustering games of mis-coordination. For two specific variants we prove the existence of a pure Nash equilibrium and provide bounds on the price of anarchy as a function of the cardinality of the action set and the size of the hyperedges
Original languageEnglish GB
PublisherarXiv:1706.05297 [math.CO]
StatePublished - 2 Dec 2017


  • Mathematics - Combinatorics
  • Computer Science - Distributed, Parallel, and Cluster Computing
  • Computer Science - Discrete Mathematics
  • Computer Science - Computer Science and Game Theory
  • Computer Science - Social and Information Networks


Dive into the research topics of 'Hypergraphical Clustering Games of Mis-Coordination'. Together they form a unique fingerprint.

Cite this