Resistance to bribery when aggregating soft constraints

We investigate a multi-agent scenario where agents express their preferences over a large set of decisions via soft constraints. We consider sequential procedures (based on Plurality, Approval, and Borda) to aggregate agents' preferences and we study their resistance to bribery attempts to influence the result of the aggregation.

[1]  Toby Walsh,et al.  Winner determination in voting trees with incomplete preferences and weighted votes , 2011, Autonomous Agents and Multi-Agent Systems.

[2]  Maria Silvia Pini,et al.  Bribery in Voting Over Combinatorial Domains Is Easy , 2012, ISAIM.

[3]  Ronen I. Brafman,et al.  Finding the Next Solution in Constraint- and Preference-Based Knowledge Representation Formalisms , 2010, KR.

[4]  Piotr Faliszewski,et al.  Nonuniform Bribery , 2007, AAMAS.

[5]  M. Trick,et al.  The computational difficulty of manipulating an election , 1989 .

[6]  Francesca Rossi,et al.  Multi-Agent Soft Constraint Aggregation via Sequential Voting , 2011, IJCAI.

[7]  K. Arrow,et al.  Handbook of Social Choice and Welfare , 2011 .

[8]  Lirong Xia,et al.  Sequential composition of voting rules in multi-issue domains , 2009, Math. Soc. Sci..

[9]  Francesca Rossi,et al.  Multi-agent Soft Constraint Aggregation - A Sequential Approach , 2011, ICAART.

[10]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[11]  R. Dechter,et al.  Inference Schemes for M Best Solutions for Soft CSPs , 2011 .

[12]  Francesca Rossi,et al.  Bribery in voting with CP-nets , 2013, Annals of Mathematics and Artificial Intelligence.

[13]  Piotr Faliszewski,et al.  How Hard Is Bribery in Elections? , 2006, J. Artif. Intell. Res..

[14]  Toby Walsh,et al.  Handbook of Constraint Programming , 2006, Handbook of Constraint Programming.

[15]  Vincent Conitzer,et al.  When are elections with few candidates hard to manipulate? , 2007, J. ACM.

[16]  Michael R. Fellows,et al.  On complexity of lobbying in multiple referenda , 2006 .

[17]  Toby Walsh,et al.  Incompleteness and incomparability in preference aggregation: Complexity results , 2011, Artif. Intell..