Date of Award
1990
Document Type
Thesis
Publication Status
Version of Record
Submission Date
October 2026
Thesis/Dissertation Advisor [Chair]
Niederhausen, Heinrich
Abstract
The classical ballot problem (two candidate ballot problem) was first introduced and solved by Whitworth. Andre attacked this problem with his famous tool, the reflection principle, and explained that the (classical) ballot problem was an application of lattice path enumeration. Kreweras formulated and solved the three candidate ballot problem in 1965. But the proof was more complicated. In 1983, Niederhausen provided a simple proof. The three candidate ballot problem was also solved by Gessel in 1986 using completely different approach, namely, the probabilistic method. We study those methods carefully and make some additional observations in this thesis.
Extent
82 p.
Recommended Citation
Muhundan, Arumugam, "Ballot problem with two and three candidates" (1990). Electronic Theses and Dissertations 1990 - 1999. 10.
https://digitalcommons.fau.edu/etd_general_4/10
Identifier
FADT14636
Comments
Thesis (M.S.)--Florida Atlantic University, 1990.|Thesis (M.S.)--Florida Atlantic University, 1990.