Maria Silvia Pini

Francesco Sambo

Proceedings of the Intelligent Autonomous Systems 13, 2014

Stable matching problems with soft constraints.

[BibT_eX]

[DOI]

Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2014

2013

Bribery in voting with CP-nets.

[BibT_eX]

[DOI]

Nicholas Mattei

Ann. Math. Artif. Intell., 2013

Stability, Optimality and Manipulation in Matching Problems with Weighted Preferences.

[BibT_eX]

[DOI]

Algorithms, 2013

Local Search Approaches in Stable Matching Problems.

[BibT_eX]

[DOI]

Algorithms, 2013

Combining Recommender and Reputation Systems to Produce Better Online Advice.

[BibT_eX]

[DOI]

Proceedings of the Modeling Decisions for Artificial Intelligence, 2013

Resistance to bribery when aggregating soft constraints.

[BibT_eX]

[DOI]

Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2013

The complexity of losing voters.

[BibT_eX]

[DOI]

Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2013

Bribery in Voting With Soft Constraints.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, 2013

A Framework for Aggregating Influenced CP-Nets and its Resistance to Bribery.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, 2013

2012

Winner determination in voting trees with incomplete preferences and weighted votes.

[BibT_eX]

[DOI]

Auton. Agents Multi Agent Syst., 2012

Influence and aggregation of preferences over combinatorial domains.

[BibT_eX]

[DOI]

Nicolas Maudet

Proceedings of the International Conference on Autonomous Agents and Multiagent Systems, 2012

Bribery in voting over combinatorial domains is easy.

[BibT_eX]

[DOI]

Nicholas Mattei

Proceedings of the International Conference on Autonomous Agents and Multiagent Systems, 2012

2011

Uncertainty in bipolar preference problems.

[BibT_eX]

[DOI]

J. Exp. Theor. Artif. Intell., 2011

Incompleteness and incomparability in preference aggregation: Complexity results.

[BibT_eX]

[DOI]

Artif. Intell., 2011

Manipulation complexity and gender neutrality in stable marriage procedures.

[BibT_eX]

[DOI]

Auton. Agents Multi Agent Syst., 2011

Weights in stable marriage problems increase manipulation opportunities.

[BibT_eX]

[DOI]

Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge (TARK-2011), 2011

Multi-Agent Soft Constraint Aggregation via Sequential Voting.

[BibT_eX]

[DOI]

Giorgio Dalla Pozza

Proceedings of the IJCAI 2011, 2011

Stability and Optimality in Matching Problems with Weighted Preferences.

[BibT_eX]

[DOI]

Proceedings of the Agents and Artificial Intelligence - Third International Conference, 2011

Stability in Matching Problems with Weighted Preferences.

[BibT_eX]

Proceedings of the ICAART 2011 - Proceedings of the 3rd International Conference on Agents and Artificial Intelligence, Volume 2, 2011

A Local Search Approach to Solve Incomplete Fuzzy CSPs.

[BibT_eX]

Proceedings of the ICAART 2011 - Proceedings of the 3rd International Conference on Agents and Artificial Intelligence, Volume 1, 2011

Possible and necessary winners in voting trees: majority graphs vs. profiles.

[BibT_eX]

[DOI]

Proceedings of the 10th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2011), 2011

Procedural fairness in stable marriage problems.

[BibT_eX]

[DOI]

Proceedings of the 10th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2011), 2011

2010

Soft constraint problems with uncontrollable variables.

[BibT_eX]

[DOI]

J. Exp. Theor. Artif. Intell., 2010

From soft constraints to bipolar preferences: modelling framework and solving issues.

[BibT_eX]

[DOI]

J. Exp. Theor. Artif. Intell., 2010

Stable marriage problems with quantitative preferences

[BibT_eX]

[DOI]

CoRR, 2010

Local search for stable marriage problems

[BibT_eX]

[DOI]

CoRR, 2010

Interval-valued soft constraint problems.

[BibT_eX]

[DOI]

Nic Wilson

Ann. Math. Artif. Intell., 2010

Elicitation strategies for soft constraint problems with missing preferences: Properties, algorithms and experimental studies.

[BibT_eX]

[DOI]

Artif. Intell., 2010

Local Search for Stable Marriage Problems with Ties and Incomplete Lists.

[BibT_eX]

[DOI]

Proceedings of the PRICAI 2010: Trends in Artificial Intelligence, 2010

Local search algorithms on the Stable Marriage Problem: Experimental Studies.

[BibT_eX]

[DOI]

Proceedings of the ECAI 2010, 2010

Male optimality and uniqueness in stable marriage problems with partial orders.

[BibT_eX]

[DOI]

Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2010), 2010

2009

Aggregating Partially Ordered Preferences.

[BibT_eX]

[DOI]

J. Log. Comput., 2009

Preference Aggregation over Restricted Ballot Languages: Sincerity and Strategy-Proofness.

[BibT_eX]

[DOI]

Ulle Endriss

Proceedings of the IJCAI 2009, 2009

Manipulation and gender neutrality in stable marriage procedures.

[BibT_eX]

[DOI]

Proceedings of the 8th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2009), 2009

2008

Dealing with Incomplete Agents' Preferences and an Uncertain Agenda in Group Decision Making via Sequential Majority Voting.

[BibT_eX]

[DOI]

Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Eleventh International Conference, 2008

Robust Solutions in Unstable Optimization Problems.

[BibT_eX]

[DOI]

Rina Dechter

Proceedings of the Recent Advances in Constraints, 2008

Elicitation Strategies for Fuzzy Constraint Problems with Missing Preferences: Algorithms and Experimental Studies.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2008

2007

Incompleteness and Incomparability in Preference Aggregation.

[BibT_eX]

[DOI]

Proceedings of the IJCAI 2007, 2007

Winner Determination in Sequential Majority Voting.

[BibT_eX]

[DOI]

Jérôme Lang

Proceedings of the IJCAI 2007, 2007

Dealing with Incomplete Preferences in Soft Constraint Problems.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2007

2006

Computing Possible and Necessary Winners from Incomplete Partially-Ordered Preferences.

[BibT_eX]

Proceedings of the ECAI 2006, 17th European Conference on Artificial Intelligence, August 29, 2006

Bipolar Preference Problems.

[BibT_eX]

Proceedings of the ECAI 2006, 17th European Conference on Artificial Intelligence, August 29, 2006

Bipolar Preference Problems: Framework, Properties and Solving Techniques.

[BibT_eX]

[DOI]

Proceedings of the Recent Advances in Constraints, 2006

Strategic voting when aggregating partially ordered preferences.

[BibT_eX]

[DOI]

Proceedings of the 5th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2006), 2006

2005

Aggregating partially ordered preferences: impossibility and possibility results.

[BibT_eX]

[DOI]

Proceedings of the 10th Conference on Theoretical Aspects of Rationality and Knowledge (TARK-2005), 2005

Possibility Theory for Reasoning About Uncertain Soft Constraints.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 2005

Uncertainty in Soft Constraint Problems.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2005

Uncertainty in soft constraint problem.

[BibT_eX]

[DOI]