| dc.contributor.author |
Kannan, Balakrishnan |
|
| dc.contributor.author |
Manoj, Changat |
|
| dc.contributor.author |
Henry, Martyn Mulder |
|
| dc.date.accessioned |
2014-07-22T06:50:44Z |
|
| dc.date.available |
2014-07-22T06:50:44Z |
|
| dc.date.issued |
2006-09-15 |
|
| dc.identifier.uri |
http://dyuthi.cusat.ac.in/purl/4208 |
|
| 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 |