2882 search results - page 10 / 577 » Enhancements to the Voting Algorithm |
STOC
1991
ACM
15 years 3 months ago
1991
ACM
111
Voted
ATAL
2010
Springer
15 years 23 days ago
2010
Springer
In many multiagent settings, situations arise in which agents must collectively make decisions while not every agent is supposed to have an equal amount of influence in the outcom...
ISAAC
2005
Springer
15 years 5 months ago
2005
Springer
This paper addresses the problem of constructing voting protocols that are hard to manipulate. We describe a general technique for obtaining a new protocol by combining two or more...
110
click to vote
COLT
1993
Springer
15 years 3 months ago
1993
Springer
In this paper we demonstrate how weighted majority voting with multiplicative weight updating can be applied to obtain robust algorithms for learning binary relations. We first pre...
101
click to vote
SIAMCOMP
1998
14 years 11 months ago
1998
We build on the classical greedy sequential set cover algorithm, in the spirit of the primal-dual schema, to obtain simple parallel approximation algorithms for the set cover probl...