Titlebook: Algorithmic Decision Theory; First International Francesca Rossi,Alexis Tsoukias Conference proceedings 2009 Springer-Verlag Berlin Heidel

施魔法

Preferences in an Open World may be acquired during the decision making process, the set of criteria is usually kept fixed. In this paper, we study the addition of new criteria and examine how this may refine or even reverse the existing preferences. We identify essential changes in the preference order and show that these cha

exclamation

一加就噴出

Inverse Analysis from a , Robustness Denotation of Valued Outranking Relationsker acknowledges for his pairwise outranking statements in a Multiple Criteria Decision Aiding process. The main result consists in showing that with the help of a mixed integer linear programming model this kind of a priori knowledge is sufficient for estimating adequate numerical significance weights.

耕種

https://doi.org/10.1007/978-3-642-04428-1agents; calculus; complexity; data mining; decision rules; decision theory; envy-free; fuzzy logic; imprecis

Ledger

978-3-642-04427-4Springer-Verlag Berlin Heidelberg 2009

Polydipsia

Algorithmic Decision Theory978-3-642-04428-1Series ISSN 0302-9743 Series E-ISSN 1611-3349

削減

https://doi.org/10.1007/978-1-349-16014-3y results concerning efficiency and fairness in resource allocation problems: we prove that the problem of deciding whether a given allocation is Pareto-optimal is .-complete, and that the problem of deciding whether there is a Pareto-efficient and envy-free allocation is .-complete.

割公牛膨脹

Offstage

Coordinate