Reasoning with PCP-nets in a Multi-Agent Context

C. Cornelio, U. Grandi, J. Goldsmith, N. Mattei, F. Rossi, K. Brent Venable

Election type Ordinal
Culture Hand-Crafted
Candidates {1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 2048, 4096, 8192, 16384, 32768, 65536, 131072, 262144, 524288, 1048576, 2097152, 4194304, 8388608, 16777216, 33554432, 67108864, 134217728, 268435456, 536870912, 1073741824}
Voters {1}
The number of candidates is $2^m$, where $m = 0, \dots, 30$ is the number of binary issues.
Instances 10000
100 PCP-nets tested over 100 outcome pairs each
Parameters None
Notes (P)CP nets with polytree structure. Issues can depend on up to m-1, m/2 or m/4 issues (where m is the number of issues)
Motivation multimodal preferences “a user’s preferences over a set of cars, which can be described by their colors, technical specifications, cost, reliability,etc.” (not 100% their motivation but related and relevant)