Manipulation can be hard in tractable voting systems even for constant-sized coalitions (Q465694): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2032316105 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1108.4439 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How hard is it to control an election? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence of clones as a criterion for voting rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3112639 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How Hard Is Bribery in Elections? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Campaign management under approval-driven voting rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3648456 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Why the Count de Borda cannot beat the Marquis de Condorcet / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Borda method is most likely to respect the Condorcet principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3266133 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Manipulation of Voting Schemes: A General Result / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strategy-proofness and Arrow's conditions: existence and correspondence theorems for voting procedures and social welfare functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2783476 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3057670 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of the single-peaked domain / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-Transitivity, Rational Choice and Collective Decisions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability in Voting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5844986 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strategic manipulability without resoluteness or shared beliefs: Gibbard-Satterthwaite generalized / rank
 
Normal rank
Property / cites work
 
Property / cites work: Manipulation of Schemes that Mix Voting with Chance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Straightforwardness of Game Forms with Lotteries as Outcomes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computational difficulty of manipulating an election / rank
 
Normal rank
Property / cites work
 
Property / cites work: Voting schemes for which it can be difficult to tell who won the election / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single transferable vote resists strategic voting / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Consistent Extension of Condorcet’s Election Principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Manipulation of social choice functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Aggregation of Preferences with Variable Electorate / rank
 
Normal rank
Property / cites work
 
Property / cites work: Social Choice Scoring Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of Kemeny elections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact analysis of Dodgson elections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the coalitional manipulation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of and algorithms for the manipulation of Borda, Nanson's and Baldwin's voting rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simplified NP-complete satisfiability problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The subgraph homeomorphism problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: When are elections with few candidates hard to manipulate? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3624050 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How large should a coalition be to manipulate an election? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reflections on Multivariate Algorithmics and Problem Parameterization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4012216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Critical Behavior in the Satisfiability of Random Boolean Expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4475628 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Financial Cryptography and Data Security / rank
 
Normal rank
Property / cites work
 
Property / cites work: Llull and Copeland Voting Computationally Resist Bribery and Constructive Control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid Elections Broaden Complexity-Theoretic Resistance to Control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Swap Bribery / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of measuring, electing, and ranking / rank
 
Normal rank
Property / cites work
 
Property / cites work: The shield that never was: societies with single-peaked preferences are more open to manipulation and control / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of manipulative attacks in nearly single-peaked electorates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dichotomy for voting systems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 04:40, 9 July 2024

scientific article
Language Label Description Also known as
English
Manipulation can be hard in tractable voting systems even for constant-sized coalitions
scientific article

    Statements

    Manipulation can be hard in tractable voting systems even for constant-sized coalitions (English)
    0 references
    0 references
    0 references
    24 October 2014
    0 references
    computational social choice
    0 references
    manipulation
    0 references
    voting theory
    0 references
    complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references