Geodesic
Consensus strategies for signed profiles on graphs
Ars Mathematica Contemporanea, Tome 6 (2013) no. 1, pp. 127-145.

Voir la notice de l'article provenant de la source Ars Mathematica Contemporanea website

The median problem is a classical problem in Location Theory: one searches for a location that minimizes the average distance to the sites of the clients. This is for desired facilities as a distribution center for a set of warehouses. More recently, for obnoxious facilities, the antimedian was studied. Here one maximizes the average distance to the clients. In this paper the mixed case is studied. Clients are represented by a profile, which is a sequence of vertices with repetitions allowed. In a signed profile each element is provided with a sign from {+, −}. Thus one can take into account whether the client prefers the facility (with a + sign) or rejects it (with a − sign). The graphs for which all median sets, or all antimedian sets, are connected are characterized. Various consensus strategies for signed profiles are studied, amongst which Majority, Plurality and Scarcity. Hypercubes are the only graphs on which Majority produces the median set for all signed profiles. Finally, the antimedian sets are found by the Scarcity Strategy on e.g. Hamming graphs, Johnson graphs and halfcubes.
DOI : 10.26493/1855-3974.244.120
Keywords: Plurality strategy, median, majority rule, Hamming graph, Johnson graph, halfcube. 
@article{10_26493_1855_3974_244_120,
     author = {Kannan Balakrishnan and Manoj Changat and Henry Martyn Mulder and Ajitha R. Subhamathi},
     title = {Consensus strategies for signed profiles on graphs},
     journal = {Ars Mathematica Contemporanea},
     pages = {127--145},
     publisher = {mathdoc},
     volume = {6},
     number = {1},
     year = {2013},
     doi = {10.26493/1855-3974.244.120},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.26493/1855-3974.244.120/}
}
TY  - JOUR
AU  - Kannan Balakrishnan
AU  - Manoj Changat
AU  - Henry Martyn Mulder
AU  - Ajitha R. Subhamathi
TI  - Consensus strategies for signed profiles on graphs
JO  - Ars Mathematica Contemporanea
PY  - 2013
SP  - 127
EP  - 145
VL  - 6
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.26493/1855-3974.244.120/
DO  - 10.26493/1855-3974.244.120
LA  - en
ID  - 10_26493_1855_3974_244_120
ER  - 
%0 Journal Article
%A Kannan Balakrishnan
%A Manoj Changat
%A Henry Martyn Mulder
%A Ajitha R. Subhamathi
%T Consensus strategies for signed profiles on graphs
%J Ars Mathematica Contemporanea
%D 2013
%P 127-145
%V 6
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.26493/1855-3974.244.120/
%R 10.26493/1855-3974.244.120
%G en
%F 10_26493_1855_3974_244_120
Kannan Balakrishnan; Manoj Changat; Henry Martyn Mulder; Ajitha R. Subhamathi. Consensus strategies for signed profiles on graphs. Ars Mathematica Contemporanea, Tome 6 (2013) no. 1, pp. 127-145. doi : 10.26493/1855-3974.244.120. http://geodesic.mathdoc.fr/articles/10.26493/1855-3974.244.120/

Cité par Sources :