Sciweavers

    2 search results - page 1 / 1
    » Parameterized Complexity of Candidate Control in Elections a...
    Sort
    View
    COCOA
    2008
    Springer
    129views Discrete Geometry» more  COCOA 2008»
    Parameterized Complexity of Candidate Control in Elections and Related Digraph Problems
    15 years 4 months ago
    Parameterized Complexity of Candidate Control in Elections and Related Digraph Problems
    Download  theinf1.informatik.uni-jena.de
    Nadja Betzler, Johannes Uhlmann
    claim paper
    Read More »
    AAAI
    2010
    132views Intelligent Agents» more  AAAI 2010»
    Cloning in Elections
    15 years 26 days ago
    Cloning in Elections
    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 »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    i2PDF i2Img i2Text i2OCR i2Symbol i2Type i2Speak i2Style i2Arabic i2Bopomo Latex Equation Editor
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2026, USA.