An approximation algorithm for random generation of capacities

DOI10.1007/S11083-023-09630-0MaRDI QIDQ6615234zbMATH OpenFDO

Authors Michel Grabisch, Christophe Labreuche, Peiqi Sun

Publication date 8 October 2024

Published in Order (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S11083-023-09630-0

zbMATH Keywords

Markov chaincapacitylinear extensionrandom generation

Mathematics Subject Classification ID

Order, lattices, ordered algebraic structures (06-XX)

Cites work

• Applying Young diagrams to 2-symmetric fuzzy measures with an application to general fuzzy measures
• Bottom-up: a new algorithm to generate random linear extensions of a poset
• Counting linear extensions
• Faster random generation of linear extensions
• Minimals Plus: an improved algorithm for the random generation of linear extensions of partially ordered sets
• On random generation of fuzzy measures
• On the conductance of order Markov chains
• Set functions, games and capacities in decision making
• The number of linear extensions of the Boolean lattice
• Theory of capacities
• Two poset polytopes

Cited in

(5)

• Efficient random walks for generating random fuzzy measures in Möbius representation in large universe
• Efficient methods for verifying monotonicity of 2-additive fuzzy measures
• Uniform random fuzzy measures
• An improvement of random node generator for the uniform generation of capacities
• Structure of polytopes associated to non-additive measures via toric ideals and Gröbner bases

This page was built for publication: An approximation algorithm for random generation of capacities

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