𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The free triple assumption

✍ Scribed by Jerry S. Kelly

Publisher
Springer
Year
1994
Tongue
English
Weight
212 KB
Volume
11
Category
Article
ISSN
0176-1714

No coin nor oath required. For personal study only.

✦ Synopsis

Many impossibility results, like Arrow's Theorem, can be strengthened by using a domain constraint that is substantially weaker than the usual domain condition.

Theorems that show the inconsistency of a list of social choice criteria or that axiomatically characterize specific social choice rules all employ assumptions that the rule has a sufficiently large domain Of profiles of individual preferences. Arrow's original version of his impossibility result [1, p 34] assumed that the

πŸ“œ SIMILAR VOLUMES

Coequalizers and free triples
Coequalizers and free triples
✍ Michael Barr πŸ“‚ Article πŸ“… 1970 πŸ› Springer-Verlag 🌐 French βš– 921 KB
cover
The Assumption Code
✍ Melodee Elliott πŸ“‚ Fiction πŸ“… 2017 πŸ› My Chair Publishing 🌐 English βš– 141 KB πŸ‘ 2 views
Approximating the Bandwidth for Asteroid
Approximating the Bandwidth for Asteroidal Triple-Free Graphs
✍ Ton Kloks; Dieter Kratsch; Haiko MΓΌller πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 110 KB

We show that there is an O nm algorithm to approximate the bandwidth of an AT-free graph with worst case performance ratio 2. Alternatively, at the cost of the Ε½ . approximation factor, we can also obtain an O m q n log n algorithm to approximate the bandwidth of an AT-free graph within a factor 4.