The network of weighted majority rules and its geometric realizations

Drora Karotkin, Mary Schaps

Research output: Contribution to journalReview articlepeer-review

2 Scopus citations


In a previous work the first author considered the network G(n, p) of weighted majority rules (WMR) for n decision makers whose competencies are given by their probabilities p = (p1,..., pn) of making a correct decision. On this paper we consider chains of decision profiles, which must occur in G(n, p) in a fixed order, and show that they can be mapped onto straight lines in a low-dimensional geometric realization. The minimal number of directions which must used to separate all edges is given as the chromatic number of a certain incidence graph. We also define degenerate networks in which several nodes coalesce.

Original languageEnglish
Pages (from-to)75-90
Number of pages16
JournalGames and Economic Behavior
Issue number1
StatePublished - Jan 2003


Dive into the research topics of 'The network of weighted majority rules and its geometric realizations'. Together they form a unique fingerprint.

Cite this