Module

DecisionTheory.Ignorance

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

#zipActions Source

zipActions :: forall cell state. Hashable state => Hashable cell => HashMap state cell -> HashMap state cell -> MultiSet (Tuple cell cell)

#dominatesWeakly Source

dominatesWeakly :: forall cell. PartialOrd cell => NonEmpty MultiSet (Tuple cell cell) -> Boolean

#dominatesStrongly Source

dominatesStrongly :: forall cell. PartialOrd cell => NonEmpty MultiSet (Tuple cell cell) -> Boolean

#strengthen Source

strengthen :: forall cell. Hashable cell => (NonEmpty MultiSet (Tuple cell cell) -> Boolean) -> NonEmpty MultiSet (Tuple cell cell) -> Boolean

#dominatesStrongly' Source

dominatesStrongly' :: forall cell. Hashable cell => PartialOrd cell => NonEmpty MultiSet (Tuple cell cell) -> Boolean

A functionally identical variant of dominatesStrongly in which the implementation

#leximin Source

leximin :: forall cell. Ord cell => NonEmpty MultiSet (Tuple cell cell) -> Boolean

#maximin Source

maximin :: forall cell. Ord cell => NonEmpty MultiSet (Tuple cell cell) -> Boolean

#maximax Source

maximax :: forall cell. Ord cell => NonEmpty MultiSet (Tuple cell cell) -> Boolean

#leximin' Source

leximin' :: forall cell. Ord cell => NonEmpty MultiSet (Tuple cell cell) -> Boolean

Functionally identical variant of leximin in which the implementation emphasizes the

#maximin' Source

maximin' :: forall cell. Ord cell => NonEmpty MultiSet (Tuple cell cell) -> Boolean

Functionally identical variant of maximin in which the implementation emphasizes the

#maximax' Source

maximax' :: forall cell. Ord cell => NonEmpty MultiSet (Tuple cell cell) -> Boolean

Functionally identical variant of maximax in which the implementation emphasizes the

#ximin Source

ximin :: forall cell. Ord cell => (forall a. NonEmptyList a -> NonEmptyList a) -> NonEmpty MultiSet (Tuple cell cell) -> Boolean

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

#optimismPessimism Source

optimismPessimism :: forall cell n. Ord cell => Semiring cell => Ring n => (n -> cell) -> Proportion n -> NonEmpty MultiSet (Tuple cell cell) -> Boolean

#maximax'' Source

maximax'' :: forall cell. Ord cell => Semiring cell => (Number -> cell) -> NonEmpty MultiSet (Tuple cell cell) -> Boolean

#maximin'' Source

maximin'' :: forall cell. Ord cell => Semiring cell => (Number -> cell) -> NonEmpty MultiSet (Tuple cell cell) -> Boolean

#weakRelationToOrdering Source

weakRelationToOrdering :: forall cell. Hashable cell => (NonEmpty MultiSet (Tuple cell cell) -> Boolean) -> NonEmpty MultiSet (Tuple cell cell) -> Maybe Ordering

Like turning >= into compare

#extremal Source

extremal :: forall cell columnId rowId. Hashable cell => Hashable columnId => Hashable rowId => (NonEmpty MultiSet (Tuple cell cell) -> Boolean) -> Table rowId columnId cell -> HashSet rowId

Find all rows which return true when compared to every other other row by the given

#minimaxRegret Source

minimaxRegret :: forall cell columnId rowId. Hashable cell => Hashable columnId => Hashable rowId => Ord cell => Ring cell => Table rowId columnId cell -> NonEmpty HashSet rowId

#indifference Source

indifference :: forall cell. Ord cell => Hashable cell => Semiring cell => (Proportion Number -> cell) -> NonEmpty MultiSet (Tuple cell cell) -> Boolean

Modules: DecisionTheory.Ignorance; DecisionTheory.Properties; DecisionTheory.Risk; DecisionTheory.Utility