# Hypergraphical Clustering Games of Mis-Coordination

## TL;DR

This paper studies hypergraphical clustering games of mis-coordination, proving the existence of pure Nash equilibria and analyzing the efficiency loss through price of anarchy bounds based on hypergraph parameters.

## Contribution

It introduces hypergraphical clustering games of mis-coordination and provides theoretical results on equilibrium existence and efficiency bounds.

## Key findings

- Existence of pure Nash equilibria for specific game variants
- Bounds on the price of anarchy related to hypergraph parameters
- Theoretical insights into mis-coordination in hypergraph clustering

## Abstract

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.