A new proof of Monjardet's median theorem

DOI10.1006/JCTA.1996.0007MaRDI QIDQ1906124zbMATH OpenOpenAlexFDO

Authors Daniel E. Loeb

Publication date 13 May 1996

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/9502223

zbMATH Keywords

strong simple games

Mathematics Subject Classification ID

Cooperative games (91A12)

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.

Recommendations

• Regular simple games
• The fundamental theorem of voting schemes
• Directed and weighted majority games
• scientific article; zbMATH DE number 3847165
• On the Enumeration of Majority Games

This page was built for publication: A new proof of Monjardet's median theorem

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