Titlebook: Algorithmic Decision Theory; 4th International Co Toby Walsh Conference proceedings 2015 Springer International Publishing Switzerland 2015

鐵砧

Lecture Notes in Computer Sciencehe definitions of the election systems (when necessary) to handle voters with ties. We show that for natural election systems allowing ties can both increase and decrease the complexity of manipulation and bribery, and we state a general result on the effect of voters with ties on the complexity of control.

Instrumental

會(huì)議

Complexity of Manipulative Actions When Voting with Tieshe definitions of the election systems (when necessary) to handle voters with ties. We show that for natural election systems allowing ties can both increase and decrease the complexity of manipulation and bribery, and we state a general result on the effect of voters with ties on the complexity of control.

DEI

BINGE

Mercurial

集合

Reasoning with Preference Trees over Combinatorial Domains possibilistic logic theories. Finally, we study reasoning with P-trees and establish computational complexity results for the key reasoning tasks of comparing outcomes with respect to orders defined by P-trees, and of finding optimal outcomes.

開頭