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

The computational complexity of ideal semantics

โœ Scribed by Paul E. Dunne

Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
530 KB
Volume
173
Category
Article
ISSN
0004-3702

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

The Computational Complexity of Antimatr
The Computational Complexity of Antimatroid Properties
โœ Jamas Enright ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 164 KB

Oracle complexity for antimatroids is defined. Several antimatroid oracles are compared and their relative strengths are examined. Characterizations of several classes of antimatroids are given, and the complexity of recognising membership of these classes is examined.