A Game-Theoretic Approach to Graph Clustering
From MaRDI portal
Publication:2940545
DOI10.1287/ijoc.2013.0588zbMath1304.91051OpenAlexW2103550381MaRDI QIDQ2940545
Kalyan Chatterjee, Supreet Reddy Mandala, Soundar R. T. Kumara
Publication date: 27 January 2015
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2013.0588
Programming involving graphs or networks (90C35) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Social networks; opinion dynamics (91D30) Noncooperative games (91A10) Games involving graphs (91A43) Applications of game theory (91A80) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- A generalization of the Motzkin-Straus theorem to hypergraphs
- Classifying molecular sequences using a linkage graph with their pairwise similarities
- Potential games
- The logit-response dynamics
- A class of games possessing pure-strategy Nash equilibria
- Community structure in social and biological networks
- Decentralized learning of Nash equilibria in multi-person stochastic games with incomplete information
This page was built for publication: A Game-Theoretic Approach to Graph Clustering