Heights of representative systems: A proof of Fishburn's conjecture (Q1057766): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / reviewed by | |||
Property / reviewed by: Yasuhiro Sakai / rank | |||
Property / reviewed by | |||
Property / reviewed by: Yasuhiro Sakai / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5668657 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Three-valued representative systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Heights of representative systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Heights of simple games / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Formal Structure of Majority Decision / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/bf00452886 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1994986589 / rank | |||
Normal rank |
Latest revision as of 12:06, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Heights of representative systems: A proof of Fishburn's conjecture |
scientific article |
Statements
Heights of representative systems: A proof of Fishburn's conjecture (English)
0 references
1984
0 references
This paper is concerned with the height of representative systems. A representative system, which was first introduced by Murakami (1966), is a map \(F: \{-1,0,1\}^ n\{-1,0,1\}\) that is constructed by a hierarchy of weighted majority voting. The height of F, \(\mu\) (F), is then defined as the minimal number of hierarchies necessary in this construction. Moreover, \(\mu\) (n) is defined as the maximal height of any n-voter representative system. In this conection, there is a famous conjecture made by Fishburn (1975, 1979) that \(\mu\) (n)/n\(\to 0\) as \(n\to \infty\). By transforming the problem to a similar one concerning proper simple games, the author attempts to give a complete yet rather lengthy proof to this conjecture.
0 references
height of representative systems
0 references
hierarchy of weighted majority voting
0 references
proper simple games
0 references