Characterizing coherence, correcting incoherence

DOI10.1016/J.IJAR.2014.03.005zbMATH Open1388.68273OpenAlexW2058075017MaRDI QIDQ473384FDOQ473384

Authors: Erik Quaeghebeur 

Publication date: 24 November 2014

Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ijar.2014.03.005

Recommendations

• Errors bounds for finite approximations of coherent lower previsions on finite probability spaces
• Weakly consistent extensions of lower previsions
• Extreme lower previsions
• A survey of the theory of coherent lower previsions
• scientific article; zbMATH DE number 1844468

zbMATH Keywords

coherencedominancemulti-objective linear programmingavoiding sure lossincoherencepolytope theory

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Reasoning under uncertainty in the context of artificial intelligence (68T37) Axioms; other general questions in probability (60A05)

Cites Work

• Title not available (Why is that?)
• Lectures on Polytopes
• Computation of ideal and Nadir values and implications for their use in MCDM methods.
• The theory of interval-probability as a unifying concept for uncertainty
• Multicriteria Optimization
• A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
• A revised simplex method for linear multiple objective programs
• Title not available (Why is that?)
• A survey of the theory of coherent lower previsions
• Extreme lower probabilities
• A dual variant of Benson's ``outer approximation algorithm for multiple objective linear programming
• An exact method for computing the nadir values in multiple objective linear programming
• The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program
• IMPRECISE PREVISIONS FOR RISK MEASUREMENT
• The set of all nondominated solutions in linear cases and a multicriteria simplex method
• Direct algorithms for checking consistency and making inferences from conditional probability assessments
• An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
• Elementary fundamentals of a more general probability theory. I: Interval probability as comprehensive conception. In cooperation with T. Augustin and A. Wallner
• A generalization of the fundamental theorem of de Finetti for imprecise conditional probability assessments
• A simplified MOLP algorithm: The MOLP-S procedure

Cited In (9)

• Compatibility, desirability, and the running intersection property
• A gambler's gain prospects with coherent imprecise previsions
• The contradiction between belief functions: its description, measurement, and correction based on generalized credal sets
• Extreme lower previsions
• The Extension of Imprecise Probabilities Based on Generalized Credal Sets
• Approximation of incoherent probabilities
• Extreme lower previsions and Minkowski indecomposability
• Title not available (Why is that?)
• The CONEstrip algorithm

Uses Software

• MPT
• Pycohconstraints
• mcohconstraints

This page was built for publication: Characterizing coherence, correcting incoherence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q473384)