357 search results - page 29 / 72 » Algorithms for the coalitional manipulation problem |
ATAL
2008
Springer
15 years 6 days ago
2008
Springer
Complexity theory is a useful tool to study computational issues surrounding the elicitation of preferences, as well as the strategic manipulation of elections aggregating togethe...
118
Voted
ICRA
2002
IEEE
15 years 3 months ago
2002
IEEE
We present motion planning for dexterous manipulation by whole arm grasp system based on switching contact modes. Motion planning for such a system should consider changing dynami...
ICRA
2003
IEEE
15 years 3 months ago
2003
IEEE
— Given a set of affine varieties in ℜ3, i.e. planes, lines, and points, the problem tackled in this paper is that of finding all possible configurations for these varieties...
ISSAC
2007
Springer
15 years 4 months ago
2007
Springer
Approximate symbolic computation problems can be formulated as constrained or unconstrained optimization problems, for example: GCD [3, 8, 12, 13, 23], factorization [5, 10], and ...
64
Voted
FOCS
2007
IEEE
15 years 4 months ago
2007
IEEE
We study the role that privacy-preserving algorithms, which prevent the leakage of specific information about participants, can play in the design of mechanisms for strategic age...