Sciweavers

5 search results - page 1 / 1
» Winner determination in voting trees with incomplete prefere...
Sort
View
AAMAS
2012
Springer
12 years 7 days 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...
IJCAI
2007
13 years 6 months ago
Winner Determination in Sequential Majority Voting
Voting rules map collections of preference orderings over a set of candidates (one for each voter) to candidates. Now, in many contexts, we have to consider the case where either t...
Jérôme Lang, Maria Silvia Pini, Franc...
AAAI
2008
13 years 6 months ago
Determining Possible and Necessary Winners under Common Voting Rules Given Partial Orders
Usually a voting rule requires agents to give their preferences as linear orders. However, in some cases it is impractical for an agent to give a linear order over all the alterna...
Lirong Xia, Vincent Conitzer
JCSS
2010
112views more  JCSS 2010»
13 years 2 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
CORR
2006
Springer
154views Education» more  CORR 2006»
13 years 4 months ago
How Hard Is Bribery in Elections?
We study the complexity of influencing elections through bribery: How computationally complex is it for an external actor to determine whether by paying certain voters to change t...
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hem...