Topological Price of Anarchy Bounds for Clustering Games on Networks.
Pieter KleerGuido SchäferPublished in: CoRR (2020)
Keyphrases
- lower and upper bounds
- upper bound
- lower bound
- upper and lower bounds
- clustering method
- clustering algorithm
- k means
- social networks
- unsupervised learning
- video games
- self organizing maps
- outlier detection
- network structure
- graph theoretic
- network analysis
- topological features
- social network analysis
- biological networks
- categorical data
- topological properties
- heterogeneous information networks
- game playing
- nash equilibrium
- computer networks
- data clustering
- model selection
- data points
- feature space