Counting condorcet

DOI10.54550/ECA2022V2S3R22MaRDI QIDQ6098023zbMATH OpenOpenAlexFDO

Authors Doron Zeilberger

Publication date 9 June 2023

Published in Enumerative Combinatorics and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.54550/eca2022v2s3r22

zbMATH Keywords

bijective proofscompositionsCondorcet paradoxlinear recurrences

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Symbolic computation of special functions (Gosper and Zeilberger algorithms, etc.) (33F10) Measurement theory in the social and behavioral sciences (91C05)

Recommendations

• scientific article; zbMATH DE number 992411
• On the likelihood of Condorcet's profiles
• Condorcet’s Paradox
• How many voters are needed for paradoxes?
• The Borda method is most likely to respect the Condorcet principle

Cites work

• A one-shot proof of Arrow's impossibility theorem
• scientific article; zbMATH DE number 872231 (Why is no real title available?)
• Insights into Game Theory
• Multi-variable Zeilberger and Almkvist-Zeilberger algorithms and the sharpening of Wilf-Zeilberger theory
• Social choice and individual values
• The probability of the paradox of voting: A computable solution

Cited in

(3)

• How many voters are needed for paradoxes?
• Two new bijections on lattice paths
• The (symbolic and numeric) computational challenges of counting 0-1 balanced matrices

This page was built for publication: Counting condorcet

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