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

中和

Dependable Computing – EDCC 2022 Workshopsn, and a value 0

瘋狂

CHURL

Petechiae

forbid

收養(yǎng)

G. Masseboeuf,J. Pulou,J. L. Rainardning of the items. For that task, we compare two combinatorial approaches. The first one allows to calculate a consensus partition, namely the median partition of the profile, which is the partition of . whose sum of distances to the individual partitions is minimum. Then, the collective classes are

Confess

Silke Draber,Bernhard Eschermanners, we can use the preferences of the users we have already processed to increase the efficiency of the elicitation process for the remaining users. However, current methods either require strong prior knowledge about the users’ preferences or can be overly cautious and inefficient. Our method, bas

Oratory

https://doi.org/10.1007/3-540-48254-7 regulatory inspections of sites - and consequently losing revenue - is minimized. In the proposed decision model the regulatory authority is an adversary. The outcome of an inspection is a Bernoulli-distributed random variable whose parameter is a function of production decisions. Our goal is to op

考博

Lecture Notes in Computer Science providing minimal and complete explanations, a problem relevant in critical situations where the stakes are very high. More specifically, we are after explanations with minimal cost supporting the fact that a choice is the weighted Condorcet winner in a multi-attribute problem. We introduce differe

菊花