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

带来墨水

MITE

庄严

A Complete Conclusion-Based Procedure for Judgment Aggregationective judgment on the same propositions. Three procedures for successfully aggregating judgments sets are: premise-based procedure, conclusion-based procedure and distance-based merging. The conclusion-based procedure has been little investigated because it provides a way to aggregate the conclusio

绅士

连锁

Manipulating Tournaments in Cup and Round Robin Competitions cup competitions, two of the most popular types of sporting competitions in polynomial time. In addition, we show that finding the minimal number of games that need to be thrown to manipulate the result can also be determined in polynomial time. Finally, we show that there are several different var

expeditious

Iterated Majority Votingto an alternative state, as proposed by one of them. Examples for instantiations of this model include the step-wise refinement of a bill of law by means of amendments to be voted on, as well as resource allocation problems, where agents successively alter the current allocation by means of a sequen

CRAMP

Committee Selection with a Weight Constraint Based on Lexicographic Rankings of Individualsrtain weight (or cost). Hence, the choice of the .-committee has to satisfy a weight (or budget) constraint: The sum of the weights of all selected committee members must not exceed a given value .. While the former part of the problem is a typical question in Social Choice Theory, the latter stems

Minutes

子女

Subset Weight Maximization with Two Competing Agentstheir weights in the solution set. In each round each agent submits one item for inclusion in the solution. We study two natural rules to decide the winner of each round: Rule 1 picks among the two submitted items the item with larger weight, Rule 2 the item with smaller weight. The winning item is

使绝缘