A Random Voting Graph Almost Surely has a Hamiltonian Cycle when the Number of Alternatives is Large

DOI10.2307/1911423zbMath0469.90005OpenAlexW1987065717MaRDI QIDQ3923884

Colin E. Bell

Publication date: 1981

Published in: Econometrica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/1911423

zbMATH Keywords

Hamiltonian cycletournamentinfinite number of votersinfinitely many alternativesintransitivities in majority rulerandom voting graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Social choice (91B14)

Related Items (11)

Cooperative phenomena in crystals and the probability of tied Borda count elections ⋮ Gaussian bounds for noise correlation of functions ⋮ Probabilistic view of voting, paradoxes, and manipulation ⋮ The likelihood of a Condorcet winner in the logrolling setting ⋮ The minimal covering set in large tournaments ⋮ Robust bounds on choosing from large tournaments ⋮ Choosing from a large tournament ⋮ The Banks Set and the Uncovered Set in Budget Allocation Problems ⋮ Condorcet's paradox ⋮ Robust bounds on choosing from large tournaments ⋮ A Fourier-theoretic perspective on the Condorcet paradox and Arrow's theorem.

This page was built for publication: A Random Voting Graph Almost Surely has a Hamiltonian Cycle when the Number of Alternatives is Large