The plurality strategy on graphs

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.

MoreLess

Year of publication:	2006-09-15
Authors:	Balakrishnan, Balakrishnan, K. ; Changat, Changat, M. ; Mulder, Mulder, H.M.
Institutions:	Faculteit der Economische Wetenschappen, Erasmus Universiteit Rotterdam
Subject:	consensus function \| majority rule \| median \| median graph \| plurality strategy

freely available

Full text |

More access options

Check Google Scholar

In German libraries (KVK)

I need help

More details

Extent:	application/pdf
Series:	Econometric Institute Research Papers. - ISSN 1566-7294.
Type of publication:	Book / Working Paper
Notes:	The text is part of a series RePEc:ems:eureir Number EI 2006-35
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10010731685