铁砧
发表于 2025-3-30 09:26:22
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
发表于 2025-3-30 15:19:25
http://reply.papertrans.cn/16/1530/152920/152920_52.png
会议
发表于 2025-3-30 17:02:06
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
发表于 2025-3-30 21:55:42
http://reply.papertrans.cn/16/1530/152920/152920_54.png
BINGE
发表于 2025-3-31 04:01:04
http://reply.papertrans.cn/16/1530/152920/152920_55.png
Mercurial
发表于 2025-3-31 06:52:44
http://reply.papertrans.cn/16/1530/152920/152920_56.png
集合
发表于 2025-3-31 11:24:52
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.
开头
发表于 2025-3-31 14:28:07
http://reply.papertrans.cn/16/1530/152920/152920_58.png