190 likes | 331 Views
Bundling Attacks in Judgment Aggregation. Reshef Meir Joint work with Noga Alon , Dvir Falik and Moshe Tennenholtz. Example. A committee needs to decide on purchasing computing equipment for the school. There are three optional features:. Example.
E N D
Bundling Attacks in Judgment Aggregation Reshef Meir Joint work with NogaAlon, DvirFalik and Moshe Tennenholtz
Example • A committee needs to decide on purchasing computing equipment for the school. There are three optional features:
Example • A committee needs to decide on purchasing computing equipment for the school. There are three optional features:
Example • By a majority decision, no feature is approved.
Example • By a majority decision, no feature is approved. • Suppose the vendor offers all features in a single bundle:
Example • By a majority decision, no feature is approved. • Suppose the vendor offers all features in a single bundle:
Example • By a majority decision, no feature is approved. • Suppose the vendor offers all features in a single bundle: • Bundling is common in commercial and political settings
Model • We consider a binary matrix A • m issues (columns) • n judges (rows) • The chair has some goal vector • W.l.o.g.: to approve all issues • Can partition the issues to bundles • Each judge approves or rejects each bundle P : C1 C2 C3
Model • We consider a binary matrix A • m issues (columns) • n judges (rows) • The chair has some goal vector • W.l.o.g.: to approve all issues • Can partition the issues to bundles • Each judge approves or rejects each bundle P : C1 C2 C3
Bundling attacks • We saw that sometimes the chair can revert the entire outcome • Even with a single bundle • Known as the “Ostrogorski paradox” • It seems that the chair has a lot of power • Even more power if we allow for arbitrary partitions
NP-hard NP-hard The power of the chair • Does a bundling attack exist often? • According to what distribution? • Is it (computationally) easy to find a bundling attack? • Problem 1: find a perfect partition (approve all issues) • Reduction from IS-TRIPARTITE-GRAPH • Problem 2: find a good bundle (approve at least k issues) • Reduction from OPTIMAL-LOBBYING [Christian et al. ‘07] • Also follows from [Alon et al. ‘13]
Frequency of bundling attacks • Consider a random preference matrix A • aij =1w.p. p, and otherwise 0 • Many issues and voters: m,n∞ • How often does a (perfect) partition exist? • How often can the chair approve at least k issues?
Frequency of bundling attacks • Consider a random preference matrix A • aij =1w.p. p, and otherwise 0 • Many issues and voters: m,n∞ • How often does a (perfect) partition exist? • How often can the chair approve at least k issues? X V ?
Frequency of bundling attacks • Consider a random preference matrix A • aij=1w.p. p=0.5 • Many issues: m∞, any number of voters n >1 Theorem: W.h.p, there is a perfect bundling attack Moreover, it can be found efficiently (thus the problem is easy in the average case) X V V
Proof outline • Find many “copies” of the Ostrogorskiparadox • Put each copy in a bundle • Put all other columns in a single bundle C* • The density of C* is slightly more than 0.5 C1 C2 • All small bundles are approved • C* is approved w.h.p.
Future directions • Adding constraints on allowed partitions • Only small bundles, etc. • Adding restrictions on allowed matrices • Interdependencies among issues [Conitzer, Lang, Xia ‘09] • Logical constraints [Endriss,Grandi, Porello ’10] • Gerrymandering Issues Voters
Future directions • Adding constraints on allowed partitions • Only small bundles, etc. • Adding restrictions on allowed matrices • Interdependencies among issues [Conitzer, Lang, Xia ‘09] • Logical constraints [Endriss,Grandi, Porello ’10] • Gerrymandering Voters Issues “District”
Thank you! Questions?