The plurality strategy on graphs

MaRDI QIDQ3565869zbMATHFDO

Authors Kannan Balakrishnan, Manoj Changat, Henry Martyn Mulder

Publication date 7 June 2010

zbMATH Keywords

medianmajority rulesum of distancesmajority strategyplurality strategyhill climbing strategysteepest ascent hill climbing strategy

Mathematics Subject Classification ID

Applications of graph theory (05C90) Distance in graphs (05C12)

Recommendations

• The majority strategy on graphs
• Consensus strategies for signed profiles on graphs
• scientific article; zbMATH DE number 3854827
• The median function on graphs with bounded profiles
• A tight axiomatization of the median procedure on median graphs

Cited in

(6)

• Axiomatic characterization of the median function of a block graph
• Oblivious and adaptive strategies for the majority and plurality problems
• Consensus strategies for signed profiles on graphs
• The majority strategy on graphs
• The median game
• The median function of a block graph: axiomatic characterizations

This page was built for publication: The plurality strategy on graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3565869)