How to identify experts in a community? (Q1742142)

This paper focuses on expert selection in social networks. Properties of the selection algorithms for expert selection are established in terms of satisfying given axioms. A stability axiom is proposed and plays a key role in the analysis. It is shown that the solutions derived from requiring these properties, stable sets and cores, fundamentally differ from tournament solutions. A case study using citation data is developed to demonstrate the effectiveness of the approach. The performance of the algorithm applied is compared to the result of application of classical centrality measures and the group derived by the algorithm consists of the same individuals who are deemed the most influential by the classical centrality measures.