On the enumeration of resolute majority rules

DOI10.1007/S10878-026-01412-9MaRDI QIDQ7232804zbMATH OpenFDO

Authors Josep Freixas, Dani Samaniego

Publication date 23 April 2026

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S10878-026-01412-9

zbMATH Keywords

classification of subclasses of resolute rulesDedekind numbersenumerations of subclasses of resolute rulesmajority rulesresolute rules

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites work

• A characterization of simple majority rule for restricted domains
• A new characterization of the majority rule
• A Possibility Theorem on Majority Decisions
• A Set of Independent Necessary and Sufficient Conditions for Simple Majority Decision
• A simple characterization of majority rule
• Aggregation rules that satisfy anonymity and neutrality
• An extension and an alternative characterization of May's theorem
• Anonymity, monotonicity, and quota pair systems
• Anonymous and neutral majority rules
• Anonymous and positively responsive aggregation rules
• Anonymous yes-no voting with abstention and multiple levels of approval
• Another characterization of the majority rule.
• Breaking ties in collective decision-making
• Complete simple games
• Complete voting systems with two classes of voters: weightedness and counting
• Counting Quota Systems: A Combinatorial Question from Social Choice Theory
• Enumeration of simple games with two equivalence classes of players
• Enumeration of weighted games with minimum and an analysis of voting power for bipartite complete games with minimum
• Mathematics and Politics
• On anonymous and weighted voting systems
• On Dedekind's problem for complete simple games
• On the enumeration of bipartite simple games
• On the enumeration of Boolean functions with distinguished variables
• On the enumeration of some inequivalent monotone Boolean functions
• On the number of inequivalent monotone Boolean functions of 9 variables
• POSITIVELY RESPONSIVE COLLECTIVE CHOICE RULES AND MAJORITY RULE: A GENERALIZATION OF MAY'S THEOREM TO MANY ALTERNATIVES
• Resolute majority rules
• Resolute refinements of social choice correspondences
• Some characterizations of resolute majority rules
• Stability of decision systems under majority rule
• Symmetric majority rules
• Ternary voting games
• The forgotten decision rules: majority rules based on difference of votes
• The golden number and Fibonacci sequences in the design of voting structures
• The majority decision function for trees with 3 leaves
• Weighted voting, abstention, and multiple levels of approval

This page was built for publication: On the enumeration of resolute majority rules

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