Showing 1 - 10 of 12
In this paper we deal with the set of $k$-additive belieffunctions dominating a given capacity. We follow the lineintroduced by Chateauneuf and Jaffray for dominating probabilities and continued by Grabisch for general $k$-additive measures.First, we show that the conditions for the general...
Persistent link: https://www.econbiz.de/10010750953
Multi-criteria decision analysis studies decision problems in which the alternatives are evaluated on several dimensions or viewpoints. In the problems we consider in this paper, the scales used for assessing the alternatives with respect to a viewpoint are bipolar and univariate or unipolar and...
Persistent link: https://www.econbiz.de/10010738479
In recent years the field of decision analysis has been heavily influenced by the "analytics'' perspective, which integrates advanced data-mining and learning methods, often associated with increasing access to "Big-Data", with decision support systems. This rapidly growing and very successful...
Persistent link: https://www.econbiz.de/10010821195
Learning – i.e. the acquisition of new information that leads to changes in our assessment of uncertainty – plays a prominent role in the international climate policy debate. For example, the view that we should postpone actions until we know more continues to be influential. The latest work...
Persistent link: https://www.econbiz.de/10008793145
complement has no odd hole. In 2002, Chudnovsky, Robertson, Seymour and Thomas proved a decomposition theorem for Berge graphs … saying that every Berge graph either is in a well understood basic class or has some kind of decomposition. Then, Chudnovsky …
Persistent link: https://www.econbiz.de/10010750439
balanced skew partition if it has one. It relies on a new decomposition theorem for Berge graphs, that is more precise than the … at an essential step one of the decomposition theorems of Chudnovsky. …
Persistent link: https://www.econbiz.de/10010750514
complement has no odd hole. In 2002, Chudnovsky, Robertson, Seymour and Thomas proved a decomposition theorem for Berge graphs … saying that every Berge graph either is in a well understood basic class or has some kind of decomposition. Then, Chudnovsky …
Persistent link: https://www.econbiz.de/10010750543
subgraph. Our main theorem states that any connected graph in C is a either in some simple basic class or has a decomposition …-joins. Our decomposition theorem actually gives a complete structure theorem for C, i.e. every graph in C can be built from …
Persistent link: https://www.econbiz.de/10010750604
We prove a decomposition theorem for graphs that do not contain a subdivision of the complete graph on four vertices as …
Persistent link: https://www.econbiz.de/10010750650
This paper investigates the influence of invariance axioms in the decomposition of observed poverty variations into … decomposition are contingent to the invariance axiom choices whilst other are robust to changes in ethical preferences. …
Persistent link: https://www.econbiz.de/10008805947