The Plurality Strategy on Graphs

Dyuthi/Manakin Repository

The Plurality Strategy on Graphs

Show simple item record Kannan, Balakrishnan Manoj, Changat Henry, Martyn Mulder 2014-07-22T06:50:44Z 2014-07-22T06:50:44Z 2006-09-15
dc.description Report/Econometric Institute, Erasmus University Rotterdam en_US
dc.description.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 en_US
dc.description.sponsorship Cochin University of Science and Technology en_US
dc.language.iso en en_US
dc.publisher Econometric Institute Research Papers en_US
dc.subject Plurality Strategy en_US
dc.subject median en_US
dc.subject consensus function en_US
dc.subject median graph en_US
dc.subject majority rule en_US
dc.title The Plurality Strategy on Graphs en_US
dc.type Article en_US

Files in this item

Files Size Format View Description
The Plurality Strategy on Graphs.pdf 145.5Kb PDF View/Open pdf

This item appears in the following Collection(s)

Show simple item record

Search Dyuthi

Advanced Search


My Account