A new proof of Monjardet's median theorem
classification
🧮 math.CO
keywords
gamesmedianmonjardetsimplestrongtheoremcomparisondistributive
read the original abstract
New proofs are given for Monjardet's theorem that all strong simple games (i.e., ipsodual elements of the free distributive lattice) can be generated by the median operation. Tighter limits are placed on the number of iterations necessary. Comparison is drawn with the $\chi$ function which also generates all strong simple games.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.