scientific article; zbMATH DE number 2080927

MaRDI QIDQ4473996zbMATH OpenFDO

Authors Rastislav Královič

Publication date 4 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2234/22340282.htm

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Games involving graphs (91A43)

Recommendations

• The majority vote process and other consensus processes on trees
• scientific article; zbMATH DE number 3900780
• Tree projections: Game characterization and computational aspects
• On the core of voting games
• The competition-independence game in trees
• Majority dynamics on trees and the dynamic cavity method
• A note on the core of voting games
• On non-atomic weighted majority games
• On some combinatorial problems arising in the theory of voting games
• Allocation rules for multi-choice games with a permission tree structure

Cited in

(14)

• The r-majority vote action on 0-1 sequences
• Tree-connected peer group situations and peer group games
• Triggering cascades on undirected connected graphs
• Fixed points and 2-cycles of synchronous dynamic coloring processes on trees
• Majority rule cellular automata
• The majority vote process and other consensus processes on trees
• Gibbard-Satterthwaite games for k-approval voting rules
• Evolutionary graph colouring
• Bounding the number of tolerable faults in majority-based systems
• scientific article; zbMATH DE number 1405692 (Why is no real title available?)
• Irreversible conversion of graphs
• Counting fixed points and pure 2-cycles of tree cellular automata
• Reversible iterative graph processes
• Local event boundary detection with unreliable sensors: analysis of the majority vote scheme

This page was built for publication:

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