An algorithm for finding the vertices of the \(k\)-additive monotone core
From MaRDI portal
Publication:412376
DOI10.1016/j.dam.2011.11.013zbMath1237.91029OpenAlexW2084070134MaRDI QIDQ412376
Pedro Miranda, Michel Grabisch
Publication date: 4 May 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2011.11.013
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Characterizing isometries on the order polytope with an application to the theory of fuzzy measures
- On the structure of the \(k\)-additive fuzzy measures
- \(k\)-balanced games and capacities
- Two poset polytopes
- 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
- Non-additive measure and integral
- Tolerant or intolerant character of interacting criteria in aggregation by the Choquet integral.
- 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
- Alternative Representations of Discrete Fuzzy Measures for Decision Making
- A CLASS OF FUZZY MEASURES BASED ON TRIANGULAR NORMS A general framework for the combination of uncertain information
- Bayes-like Decision Making with Upper and Lower Probabilities
- p-SYMMETRIC 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]
This page was built for publication: An algorithm for finding the vertices of the \(k\)-additive monotone core
