Choquet Integral as Maximum of Integrals with Respect to Belief Functions
We study the problem of representing the Choquet integral w.r.t. an arbitrary capacity as maximum of integrals w.r.t. belief functions. We propose an algorithm and prove that for 2-additive capacities it allows to obtain a decomposition with the lowest number of elements.
Unable to display preview. Download preview PDF.
- Korte, B.H., Vygen, J.: Combinatorial optimization: theory and algorithms. Springer (2008) ISBN 3540718435Google Scholar
- Lovász, L.: Submodular functions and convexity. Mathematical Programming: the State of the Art, 235–257 (1983)Google Scholar
- Timonin, M.: Maximization of the Choquet integral over a convex set and its application to resource allocation problems. Annals of Operations Research (2011) (under review)Google Scholar