Module

DecisionTheory

Package
purescript-decision-theory
Repository
colehaus/purescript-decision-theory

#dominatesWeakly Source

dominatesWeakly :: forall cell. PartialOrd cell => Row cell -> Row cell -> Boolean

#dominatesStrongly Source

dominatesStrongly :: forall cell. PartialOrd cell => Row cell -> Row cell -> Boolean

#strengthen Source

strengthen :: forall cell. (Row cell -> Row cell -> Boolean) -> Row cell -> Row cell -> Boolean

#dominatesStrongly' Source

dominatesStrongly' :: forall cell. PartialOrd cell => Row cell -> Row cell -> Boolean

A functionally identical variant of dominatesStrongly which emphasizes that it is the asymmetric version of dominatesWeakly

#leximin Source

leximin :: forall cell. Ord cell => Row cell -> Row cell -> Boolean

#maximin Source

maximin :: forall cell. Ord cell => Row cell -> Row cell -> Boolean

#maximax Source

maximax :: forall cell. Ord cell => Row cell -> Row cell -> Boolean

#leximin' Source

leximin' :: forall cell. Ord cell => Row cell -> Row cell -> Boolean

Functionally identical variant of leximin in which the implementation emphasizes the relationship between leximin and maximin

#maximin' Source

maximin' :: forall cell. Ord cell => Row cell -> Row cell -> Boolean

Functionally identical variant of maximin in which the implementation emphasizes the relationship between leximin and maximin

#maximax' Source

maximax' :: forall cell. Ord cell => Row cell -> Row cell -> Boolean

Functionally identical variant of maximax in which the implementation emphasizes the relationship between leximin and maximax

#ximin Source

ximin :: forall cell. Ord cell => (forall a. NonEmptyList a -> NonEmptyList a) -> Row cell -> Row cell -> Boolean

Helper function which is used to implement both leximin' and maximin'

#optimismPessimism Source

optimismPessimism :: forall n. Ord n => Ring n => Proportion n -> Row n -> Row n -> Boolean

#maximax'' Source

maximax'' :: forall n. Ord n => Ring n => NonEmptyList n -> NonEmptyList n -> Boolean

#maximin'' Source

maximin'' :: forall n. Ord n => Ring n => NonEmptyList n -> NonEmptyList n -> Boolean