Template-Type: ReDIF-Paper 1.0
Author-Name: Balakrishnan, K.
Author-Name-Last: Balakrishnan
Author-Name-First: Kannan
Author-Name: Changat, M.
Author-Name-Last: Changat
Author-Name-First: Manoj
Author-Name: Mulder, H.M.
Author-Name-Last: Mulder
Author-Name-First: Martyn
Title: The plurality strategy on graphs
Abstract: The Majority Strategy for finding medians of a set of clients on a graph can be relaxed in the following way: if we are at v, then we move to a neighbor w if there are at least as many clients closer to w than to v (thus ignoring the clients at equal distance from v and w). The graphs on which this Plurality Strategy always finds the set of all medians are precisely those for which the set of medians induces always a connected subgraph.
Creation-Date: 2006-09-15
File-URL: https://repub.eur.nl/pub/7976/ei2006-35.pdf
File-Format: application/pdf
Series: RePEc:ems:eureir
Number: EI 2006-35
Keywords: consensus function, majority rule, median, median graph, plurality strategy
Handle: RePEc:ems:eureir:7976