Finding the set of k-additive dominating measures viewed as a flow problem
From MaRDI portal
Publication:5115724
Recommendations
Cites work
- scientific article; zbMATH DE number 3560492 (Why is no real title available?)
- scientific article; zbMATH DE number 1929535 (Why is no real title available?)
- scientific article; zbMATH DE number 3185418 (Why is no real title available?)
- A Simplified Bargaining Model for the n-Person Cooperative Game
- Axiomatic structure of \(k\)-additive capacities
- Cores of convex games
- Dominance of capacities by \(k\)-additive belief functions
- Exact bounds of the Möbius inverse of monotone set functions
- Identification of fuzzy measures from sample data with genetic algorithms
- Identification of non-additive measures from sample data
- OPTIMIZATION ISSUES FOR FUZZY MEASURES
- On the foundations of combinatorial theory I. Theory of M�bius Functions
- On the vertices of the \(k\)-additive core
- Some characterizations of lower probabilities and other monotone capacities through the use of Möbius inversion
- Super-modularity: Applications to convex games and to the greedy algorithm for LP
- Theory of capacities
- Towards a frequentist theory of upper and lower probability
- Upper and Lower Probabilities Induced by a Multivalued Mapping
- k-balanced games and capacities
- k-order additive discrete fuzzy measures and their representation
This page was built for publication: Finding the set of \(k\)-additive dominating measures viewed as a flow problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5115724)