The plurality strategy on graphs

zbMATH Open1196.05024MaRDI QIDQ3565869FDOQ3565869

Authors: Kannan Balakrishnan, Manoj Changat, Henry Martyn Mulder 

Publication date: 7 June 2010

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

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)

Cited In (6)

• The majority strategy on graphs
• Consensus strategies for signed profiles on graphs
• The median game
• Oblivious and adaptive strategies for the majority and plurality problems
• Axiomatic characterization of the median function of a block graph
• 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)