Characterizing coherence, correcting incoherence

DOI10.1016/j.ijar.2014.03.005zbMath1388.68273OpenAlexW2058075017MaRDI QIDQ473384

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

zbMATH Keywords

coherencedominancemulti-objective linear programmingavoiding sure lossincoherencepolytope theory

Mathematics Subject Classification ID

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

Related Items

The Extension of Imprecise Probabilities Based on Generalized Credal Sets ⋮ Approximation of incoherent probabilities ⋮ Compatibility, desirability, and the running intersection property ⋮ The contradiction between belief functions: its description, measurement, and correction based on generalized credal sets

Uses Software

• MPT
• Pycohconstraints
• mcohconstraints

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A dual variant of Benson's ``outer approximation algorithm for multiple objective linear programming
• Extreme lower probabilities
• An exact method for computing the nadir values in multiple objective linear programming
• A simplified MOLP algorithm: The MOLP-S procedure
• A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
• The set of all nondominated solutions in linear cases and a multicriteria simplex method
• An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
• 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
• A generalization of the fundamental theorem of de Finetti for imprecise conditional probability assessments
• Direct algorithms for checking consistency and making inferences from conditional probability assessments
• A survey of the theory of coherent lower previsions
• The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program
• Lectures on Polytopes
• A revised simplex method for linear multiple objective programs
• Multicriteria Optimization
• IMPRECISE PREVISIONS FOR RISK MEASUREMENT