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

TIA742

愤怒历史

figurine

On Multi-dimensional Envy-Free Mechanismst the first polynomial-communication envy-free profit-maximizing combinatorial auctions for general bidders. In this context, envy-free prices can be interpreted as anonymous non-discriminatory prices. Additionally, we study the canonical makespan-minimizing scheduling problem of unrelated machines,

桉树

Stable Rankings in Collective Decision Making with Imprecise Information is able to provide imprecise information on his/her preferences about the relative importance of the criteria that have to be taken into account..We first propose an approach based on the assumption that the final evaluation depends on the complete group since no possibility exists that the group m

notification

Ornament

nitroglycerin

A Prescriptive Approach for Eliciting Imprecise Weight Statements in an MCDA Processhods for weights within MCDA. We highlight the discrepancy between how elicitation is handled in current decision analysis applications and the abilities of real decision-makers to provide what is required from them. Based on theory and highlighted problems with current methods, we propose a novel a

fatuity

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 weig

Immunization

maroon