Dynamic competition networks: Detecting alliances and leaders

1Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We consider social networks of competing agents that evolve dynamically over time. Such dynamic competition networks are directed, where a directed edge from nodes u to v corresponds a negative social interaction. We present a novel hypothesis that serves as a predictive tool to uncover alliances and leaders within dynamic competition networks. Our focus is in the present study is to validate it on competitive networks arising from social game shows such as Survivor and Big Brother.

Cite

CITATION STYLE

APA

Bonato, A., Eikmeier, N., Gleich, D. F., & Malik, R. (2018). Dynamic competition networks: Detecting alliances and leaders. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10836 LNCS, pp. 115–144). Springer Verlag. https://doi.org/10.1007/978-3-319-92871-5_9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free