Topological Price of Anarchy Bounds for Clustering Games on Networks.
Pieter KleerGuido SchäferPublished in: WINE (2019)
Keyphrases
- game theory
- game theoretic
- nash equilibrium
- clustering algorithm
- clustering method
- k means
- categorical data
- hierarchical clustering
- cluster analysis
- upper and lower bounds
- lower bound
- model selection
- topological features
- upper bound
- spectral clustering
- video games
- complex networks
- computer networks
- data clustering
- network structure
- semi supervised
- network analysis
- social networks
- data points
- lower and upper bounds
- imperfect information
- unsupervised learning