Finding the Set of k-additive Dominating Measures Viewed as a Flow Problem
From MaRDI portal
Publication:5115724
DOI10.1007/978-3-319-40596-4_2zbMath1452.68223OpenAlexW2483944947MaRDI QIDQ5115724
Michel Grabisch, Pedro Miranda
Publication date: 18 August 2020
Published in: Information Processing and Management of Uncertainty in Knowledge-Based Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-40596-4_2
Reasoning under uncertainty in the context of artificial intelligence (68T37) Fuzzy measure theory (28E10)
Cites Work
- Axiomatic structure of \(k\)-additive capacities
- \(k\)-balanced games and capacities
- 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
- Towards a frequentist theory of upper and lower probability
- \(k\)-order additive discrete fuzzy measures and their representation
- Exact bounds of the Möbius inverse of monotone set functions
- Dominance of capacities by \(k\)-additive belief functions
- Identification of fuzzy measures from sample data with genetic algorithms
- On the vertices of the \(k\)-additive core
- Cores of convex games
- Theory of capacities
- OPTIMIZATION ISSUES FOR FUZZY MEASURES
- Upper and Lower Probabilities Induced by a Multivalued Mapping
- A Simplified Bargaining Model for the n-Person Cooperative Game
- [https://portal.mardi4nfdi.de/wiki/Publication:5731810 On the foundations of combinatorial theory I. Theory of M�bius Functions]
- The core of games on ordered structures and graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
