The number of preference orderings: a recursive approach

DOI10.1017/mag.2014.3zbMath1386.91060OpenAlexW2336357216MaRDI QIDQ5364971

Ben Eggleston

Publication date: 29 September 2017

Published in: The Mathematical Gazette (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/mag.2014.3

zbMATH Keywords

voting systemspreference orders

Mathematics Subject Classification ID

Partial orders, general (06A06) Voting theory (91B12) Individual preferences (91B08)

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An asymptotic equivalent for the number of total preorders on a finite set
• The number of weak orderings of a finite set
• A Problem in Combinations

This page was built for publication: The number of preference orderings: a recursive approach