| Sign In to gain access to subscriptions and/or personal tools. |
SimulationAnalytic and Algorithmic Analyses of Condorcet's Paradox—Variations on a Classical ThemeState University of New York at Stony Brook
State University of New York at Stony Brook This article compares and contrasts traditional mathematical models with computer simulations. The strengths and flexibility of algorithmic computational simulations are shown by "walking through" a program designed to investigate and extend understanding in one of the most enduring questions in social choice research—concerns over the frequency of cycling collective decisions even when individuals hold clear transitive preferences. After discussing solutions to this problem from each approach—analytic and algorithmic—the authors modify the simulation to investigate questions dealing with weak preference orderings, even-numbered electorates, and the probabilistic uncertainty inherent in iterated approximations more generally. Although traditional formal solutions have a clear advantage for estimating the limiting values of the probability of cycles (i.e., as the electorate or number of alternatives goes to infinity), computer models are far more tractable for finite values and extensions.
Key Words: formal modeling • computational modeling • mathematical modeling • computer simulation • Condorcet's paradox • social choice
Social Science Computer Review, Vol. 16, No. 1,
72-95 (1998) This article has been cited by other articles:
|
|||||||||||||||||||||||||||||||||||||||
 |
|
|
 |
|
Sign In to gain access to subscriptions and/or personal tools.
