Sciweavers

    687 search results - page 6 / 138
    » On The Complexity of Manipulating Elections
    Sort
    View
    IJCAI
    2007
    212views Artificial Intelligence» more  IJCAI 2007»
    Hybrid Elections Broaden Complexity-Theoretic Resistance to Control
    13 years 9 months ago
    Hybrid Elections Broaden Complexity-Theoretic Resistance to Control
    Download  staff.science.uva.nl
    Electoral control refers to attempts by an election’s organizer (“the chair”) to influence the outcome by adding/deleting/partitioning voters or candidates. The groundbreak...
    Edith Hemaspaandra, Lane A. Hemaspaandra, Jör...
    claim paper
    Read More »
    SIAMCOMP
    2011
    139views Software Engineering» more  SIAMCOMP 2011»
    A Quantitative Version of the Gibbard-Satterthwaite Theorem for Three Alternatives
    12 years 10 months ago
    A Quantitative Version of the Gibbard-Satterthwaite Theorem for Three Alternatives
    Download  www.cs.huji.ac.il
    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...
    Ehud Friedgut, Gil Kalai, Nathan Keller, Noam Nisa...
    claim paper
    Read More »
    AAAI
    2006
    117views Intelligent Agents» more  AAAI 2006»
    The Complexity of Bribery in Elections
    13 years 9 months ago
    The Complexity of Bribery in Elections
    Download  staff.science.uva.nl
    We study the complexity of influencing elections through bribery: How computationally complex is it for an external actor to determine whether by a certain amount of bribing voter...
    Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hem...
    claim paper
    Read More »
    ICDCS
    1989
    IEEE
    90views Distributed And Parallel Com...» more  ICDCS 1989»
    Message Complexity of Simple Ring-based Election Algorithms: An Empirical Analysis
    13 years 11 months ago
    Message Complexity of Simple Ring-based Election Algorithms: An Empirical Analysis
    Download  www.vs.inf.ethz.ch
    Friedemann Mattern
    claim paper
    Read More »
    COCOA
    2008
    Springer
    129views Discrete Geometry» more  COCOA 2008»
    Parameterized Complexity of Candidate Control in Elections and Related Digraph Problems
    13 years 9 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 »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.