Titlebook: Algorithmic Decision Theory; Second International Ronen I. Brafman,Fred S. Roberts,Alexis Tsoukiàs Conference proceedings 2011 Springer-Ver

stratum-corneum

https://doi.org/10.1007/978-3-319-54422-9le direction of consistent improvement of objectives. We show how such preference information combined with a dominance relation principle results in a Chebyshev-type scalarizing model, which can be used in early stages of decision making processes for deriving preferred solutions without trading off.

anaerobic

Dependable Computing – EDCC 2024 Workshopsfor inferring the . II preference parameters using the NSGA-II evolutionary multi-objective optimization algorithm. Results obtained on artificial datasets suggest that our method offers promising new perspectives in that field of research.

喊叫

Aprope

Gianluca Furano,Alessandra Menicucci paths for the adversaries. We show that this problem is NP-complete, even for a single adversary. For the case of multiple adversaries, we provide an upper bound by showing that the corresponding problem is in ., the second level of the polynomial hierarchy, and we suspect it is complete for this class.

易于交谈

,A Bi-objective Optimization Model to Eliciting Decision Maker’s Preferences for the PROMETHEE II Mefor inferring the . II preference parameters using the NSGA-II evolutionary multi-objective optimization algorithm. Results obtained on artificial datasets suggest that our method offers promising new perspectives in that field of research.

bizarre

匍匐前进

Bribery in Path-Disruption Games, paths for the adversaries. We show that this problem is NP-complete, even for a single adversary. For the case of multiple adversaries, we provide an upper bound by showing that the corresponding problem is in ., the second level of the polynomial hierarchy, and we suspect it is complete for this class.

PHON

How Hard Is it to Bribe the Judges? A Study of the Complexity of Bribery in Judgment Aggregation,o specific judgment aggregation procedures to a whole class of such procedures, and we obtain stronger results by considering not only the classical complexity (NP-hardness) but the parameterized complexity (W[2]-hardness) of these problems with respect to natural parameters. Furthermore, we introdu

Cirrhosis

A Translation Based Approach to Probabilistic Conformant Planning,n, and a value 0

Irksome

Committee Selection with a Weight Constraint Based on a Pairwise Dominance Relation,ly, we assume that we only have a classification of the items into ordered classes. We aim at generating the set of preferred subsets of items, according to a pairwise dominance relation between subsets that naturally extends the ordering relation over classes [4,16]. We first show that the problem