Sciweavers

357 search results - page 6 / 72
» Is Computational Complexity a Barrier to Manipulation
Sort
View
PVM
2007
Springer
15 years 11 months ago
A Virtual Test Environment for MPI Development: Quick Answers to Many Small Questions
Abstract. MPI implementations are faced with growingly complex network configurations containing multiple network interfaces per node, NAT, or dual stacks. To implement handling l...
Wolfgang Schnerring, Christian Kauhaus, Dietmar Fe...
ATAL
2010
Springer
15 years 6 months ago
Manipulation of copeland elections
We resolve an open problem regarding the complexity of unweighted coalitional manipulation, namely, the complexity of Copeland -manipulation for {0, 1}. Copeland , 0 1, is an...
Piotr Faliszewski, Edith Hemaspaandra, Henning Sch...
ATAL
2009
Springer
16 years 8 days ago
False name manipulations in weighted voting games: splitting, merging and annexation
An important aspect of mechanism design in social choice protocols and multiagent systems is to discourage insincere and manipulative behaviour. We examine the computational compl...
Haris Aziz, Mike Paterson
IJFCS
2007
109views more  IJFCS 2007»
15 years 5 months ago
Computational Power of intramolecular gene Assembly
The process of gene assembly in ciliates, an ancient group of organisms, is one of the most complex instances of DNA manipulation known in any organism. Three molecular operations...
Tseren-Onolt Ishdorj, Ion Petre, Vladimir Rogojin
ATAL
2008
Springer
15 years 7 months ago
A broader picture of the complexity of strategic behavior in multi-winner elections
Recent work by Procaccia, Rosenschein and Zohar [14] established some results regarding the complexity of manipulation and control in elections with multiple winners, such as elec...
Reshef Meir, Ariel D. Procaccia, Jeffrey S. Rosens...