General Mathematics


The Majority Rule and Combinatorial Geometry (Via the Symmetric Group)

Authors: Thinh Nguyen

The Marquis du Condorcet recognized 200 years ago that majority rule can produce intransitive group preferences if the domain of possible (transitive) individual preference orders is unrestricted. We present results on the cardinality and structure of those maximal sets of permutations for which majority rule produces transitive results (consistent sets). Consistent sets that contain a maximal chain in the Weak Bruhat Order inherit from it an upper semimodular sublattice structure. They are intrinsically related to a special class of hamiltonian graphs called persistent graphs. These graphs in turn have a clean geometric interpretation: they are precisely visibility graphs of staircase polygons. We highlight the main tools used to prove these connections and indicate possible social choice and computational research directions.

Comments: 0 Pages.

Download: PDF

Submission history

[v1] 2018-06-29 03:16:29

Unique-IP document downloads: 17 times is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus