Sciweavers

6 search results - page 1 / 2
» Computing Possible and Necessary Winners from Incomplete Par...
Sort
View
82
Voted
ECAI
2006
Springer
15 years 4 months ago
Computing Possible and Necessary Winners from Incomplete Partially-Ordered Preferences
Maria Silvia Pini, Francesca Rossi, Kristen Brent ...
132
Voted
AAMAS
2012
Springer
13 years 9 months ago
Winner determination in voting trees with incomplete preferences and weighted votes
In multiagent settings where agents have different preferences, preference aggregation can be an important issue. Voting is a general method to aggregate preferences. We consider ...
Jérôme Lang, Maria Silvia Pini, Franc...
123
Voted
IJCAI
2007
15 years 2 months ago
Incompleteness and Incomparability in Preference Aggregation
We consider how to combine the preferences of multiple agents despite the presence of incompleteness and incomparability in their preference orderings. An agent’s preference orde...
Maria Silvia Pini, Francesca Rossi, Kristen Brent ...
131
Voted
JCSS
2010
112views more  JCSS 2010»
14 years 11 months ago
Towards a dichotomy for the Possible Winner problem in elections based on scoring rules
To make a joint decision, agents (or voters) are often required to provide their preferences as linear orders. To determine a winner, the given linear orders can be aggregated acc...
Nadja Betzler, Britta Dorn
146
Voted
AAAI
2012
13 years 3 months ago
The Price of Neutrality for the Ranked Pairs Method
The complexity of the winner determination problem has been studied for almost all common voting rules. A notable exception, possibly caused by some confusion regarding its exact ...
Markus Brill, Felix A. Fischer