๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Computational Complexity, Speedable and Levelable Sets

โœ Scribed by Robert I. Soare

Book ID
124963550
Publisher
Association for Symbolic Logic
Year
1977
Tongue
English
Weight
408 KB
Volume
42
Category
Article
ISSN
0022-4812

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Degrees of Non ฮฑ-Speedable Sets
Degrees of Non ฮฑ-Speedable Sets
โœ Steven Homer; Barry E. Jacobs ๐Ÿ“‚ Article ๐Ÿ“… 1981 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 613 KB
The Computational Complexity of Choice S
The Computational Complexity of Choice Sets
โœ Felix Brandt; Felix Fischer; Paul Harrenstein ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 136 KB

## Abstract Social choice rules are often evaluated and compared by inquiring whether they satisfy certain desirable criteria such as the __Condorcet criterion__, which states that an alternative should always be chosen when more than half of the voters prefer it over any other alternative. Many of