5 search results - page 1 / 1 » A Quantitative Version of the Gibbard-Satterthwaite Theorem ... |
SIAMCOMP
2011
12 years 7 months ago
2011
The Gibbard-Satterthwaite theorem states that every non-dictatorial election rule among at least three alternatives can be strategically manipulated. We prove a quantitative versi...
SIGECOM
2008
ACM
13 years 4 months ago
2008
ACM
The Gibbard-Satterthwaite Theorem states that (in unrestricted settings) any reasonable voting rule is manipulable. Recently, a quantitative version of this theorem was proved by ...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
The well-known Impossibility Theorem of Arrow asserts that any Generalized Social Welfare Function (GSWF) with at least three alternatives, which satisfies Independence of Irrelev...
JSC
2007
13 years 4 months ago
2007
We present new deterministic and probabilistic algorithms that reduce the factorization of dense polynomials from several to one variable. The deterministic algorithm runs in sub-...
ICS
2009
Tsinghua U.
13 years 11 months ago
2009
Tsinghua U.
With the current trend toward multicore architectures, improved execution performance can no longer be obtained via traditional single-thread instruction level parallelism (ILP), ...