Local majorities, coalitions and monopolies in graphs: a review

David Peleg
2002 Theoretical Computer Science  
This paper provides an overview of recent developments concerning the process of local majority voting in graphs, and its basic properties, from graph theoretic and algorithmic standpoints.
doi:10.1016/s0304-3975(01)00055-x fatcat:iddd6arxgva7bj7rwr4mwjah5a