Sciweavers

116 search results - page 2 / 24
» Anonymity-Proof Voting Rules
Sort
View
AAMAS
2012
Springer
12 years 1 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...
JCSS
2010
112views more  JCSS 2010»
13 years 4 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
AAAI
2008
13 years 8 months ago
Optimal False-Name-Proof Voting Rules with Costly Voting
One way for agents to reach a joint decision is to vote over the alternatives. In open, anonymous settings such as the Internet, an agent can vote more than once without being det...
Liad Wagman, Vincent Conitzer
CORR
2011
Springer
148views Education» more  CORR 2011»
12 years 9 months ago
Dominating Manipulations in Voting with Partial Information
We consider manipulation problems when the manipulator only has partial information about the votes of the nonmanipulators. Such partial information is described by an information...
Vincent Conitzer, Toby Walsh, Lirong Xia
SIGECOM
2010
ACM
147views ECommerce» more  SIGECOM 2010»
13 years 10 months ago
Socially desirable approximations for Dodgson's voting rule
In 1876 Charles Lutwidge Dodgson suggested the intriguing voting rule that today bears his name. Although Dodgson’s rule is one of the most well-studied voting rules, it suffers...
Ioannis Caragiannis, Christos Kaklamanis, Nikos Ka...