𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Computational complexity of stable partitions with B-preferences

✍ Scribed by Katarı´na Cechlárová; Jana Hajduková

Book ID
105856575
Publisher
Springer-Verlag
Year
2003
Tongue
English
Weight
195 KB
Volume
31
Category
Article
ISSN
0020-7276

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Stable partitions with W-preferences
Stable partitions with W-preferences
✍ Katarı́na Cechlárová; Jana Hajduková 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 265 KB

Suppose that in a coalition formation game each participant has a preference list of the other participants and she prefers a set S to a set T if and only if she prefers the worst participant of S to the worst participant of T . We consider three deÿnitions of stability. In the case of no indi erenc

Computational complexity of relating tim
Computational complexity of relating time points with intervals
✍ Peter Jonsson; Thomas Drakengren; Christer Bäckström 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 190 KB

Several algebras have been proposed for reasoning about qualitative constraints over the time line. One of these algebras is Vilain's point-interval algebra, which can relate time points with time intervals. Apart from being a stand-alone qualitative algebra, it is also used as a subalgebra in Meiri