The number of preference orderings: a recursive approach

DOI10.1017/MAG.2014.3MaRDI QIDQ5364971zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Recursiveness and preference orderings
• The recursive structure of some ordering problems
• Permutations of separable preference orders
• Orderings and Probability Functionals Consistent with Preferences
• Representations of preference orderings
• Conditional preference orders and their numerical representations
• On the representation of preference orders on sequence spaces
• scientific article; zbMATH DE number 176473
• Numerical representations of imperfectly ordered preferences (A unified geometric exposition)
• On the number of orderings of \(n\) items

Cites work

• scientific article; zbMATH DE number 3127542 (Why is no real title available?)
• scientific article; zbMATH DE number 3697169 (Why is no real title available?)
• scientific article; zbMATH DE number 3443655 (Why is no real title available?)
• A Problem in Combinations
• An asymptotic equivalent for the number of total preorders on a finite set
• The number of weak orderings of a finite set

Cited in

(2)

• Counting Quota Systems: A Combinatorial Question from Social Choice Theory
• A relation between sequences generated by Golomb's preference algorithm

Describes a project that uses

Uses Software

• OEIS

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

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