Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
2
search results - page 1 / 1
»
Parameterized Complexity of Candidate Control in Elections a...
Sort
relevance
views
votes
recent
update
View
thumb
title
10
click to vote
COCOA
2008
Springer
129
views
Discrete Geometry
»
more
COCOA 2008
»
Parameterized Complexity of Candidate Control in Elections and Related Digraph Problems
13 years 5 months ago
Download
theinf1.informatik.uni-jena.de
Nadja Betzler, Johannes Uhlmann
claim paper
Read More »
8
click to vote
AAAI
2010
132
views
Intelligent Agents
»
more
AAAI 2010
»
Cloning in Elections
13 years 1 months ago
Download
ccc.cs.uni-duesseldorf.de
We consider the problem of manipulating elections via cloning candidates. In our model, a manipulator can replace each candidate c by one or more clones, i.e., new candidates that...
Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko
claim paper
Read More »
« Prev
« First
page 1 / 1
Last »
Next »