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

EXERT

書(shū)目名稱Algorithmic Decision Theory影響因子(影響力)




書(shū)目名稱Algorithmic Decision Theory影響因子(影響力)學(xué)科排名




書(shū)目名稱Algorithmic Decision Theory網(wǎng)絡(luò)公開(kāi)度




書(shū)目名稱Algorithmic Decision Theory網(wǎng)絡(luò)公開(kāi)度學(xué)科排名




書(shū)目名稱Algorithmic Decision Theory被引頻次




書(shū)目名稱Algorithmic Decision Theory被引頻次學(xué)科排名




書(shū)目名稱Algorithmic Decision Theory年度引用




書(shū)目名稱Algorithmic Decision Theory年度引用學(xué)科排名




書(shū)目名稱Algorithmic Decision Theory讀者反饋




書(shū)目名稱Algorithmic Decision Theory讀者反饋學(xué)科排名

Cupidity

歌唱隊(duì)

0302-9743 ataway, NJ, USA, in October 2011.The 24 revised full papers presented were carefully reviewed and selected from 50 submissions.978-3-642-24872-6978-3-642-24873-3Series ISSN 0302-9743 Series E-ISSN 1611-3349

predict

MAUVE

Commonplace

Optometrist

Irina Alam,Lara Dolecek,Puneet Guptaed by using the MOPI conditions. Since a 2-additive capacity is related to all binary alternatives, this inconsistencies checking can be more complex if the set of alternatives is very large. In this paper, we show that it is possible to limited the test of MOPI conditions to the only alternatives used in the preferential information.

Charitable

Efficiently Eliciting Preferences from a Group of Users,However, current methods either require strong prior knowledge about the users’ preferences or can be overly cautious and inefficient. Our method, based on standard techniques from non-parametric statistics, allows the controller to choose a balance between prior knowledge and efficiency. This balance is investigated through experimental results.

expeditious

Minimal and Complete Explanations for Critical Multi-attribute Decisions,r explanations with minimal cost supporting the fact that a choice is the weighted Condorcet winner in a multi-attribute problem. We introduce different languages for explanation, and investigate the problem of producing minimal explanations with such languages.

FLIT