The number of preference orderings: a recursive approach

DOI10.1017/MAG.2014.3zbMATH Open1386.91060OpenAlexW2336357216MaRDI QIDQ5364971FDOQ5364971

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

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

zbMATH Keywords

voting systemspreference orders

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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

Cited In (2)

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

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)