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_2zbMATH Open1452.68223OpenAlexW2483944947MaRDI QIDQ5115724FDOQ5115724
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
Recommendations
Reasoning under uncertainty in the context of artificial intelligence (68T37) Fuzzy measure theory (28E10)
Cites Work
- Title not available (Why is that?)
- Upper and Lower Probabilities Induced by a Multivalued Mapping
- On the vertices of the \(k\)-additive core
- Cores of convex games
- Title not available (Why is that?)
- On the foundations of combinatorial theory I. Theory of M�bius Functions
- Super-modularity: Applications to convex games and to the greedy algorithm for LP
- The core of games on ordered structures and graphs
- Some characterizations of lower probabilities and other monotone capacities through the use of Möbius inversion
- \(k\)-order additive discrete fuzzy measures and their representation
- Theory of capacities
- OPTIMIZATION ISSUES FOR FUZZY MEASURES
- Axiomatic structure of \(k\)-additive capacities
- A Simplified Bargaining Model for the n-Person Cooperative Game
- Towards a frequentist theory of upper and lower probability
- \(k\)-balanced games and capacities
- Exact bounds of the Möbius inverse of monotone set functions
- Title not available (Why is that?)
- Dominance of capacities by \(k\)-additive belief functions
- Identification of fuzzy measures from sample data with genetic algorithms
- Title not available (Why is that?)
Cited In (1)
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)
