The computational difficulty of manipulating an election (Q1824524): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
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: Q4198785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Manipulation of social choice functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / 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: Choice and complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On effectively computable realizations of choice functions / 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: The Voting Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simplified NP-complete satisfiability problem / rank
 
Normal rank

Revision as of 10:00, 20 June 2024

scientific article
Language Label Description Also known as
English
The computational difficulty of manipulating an election
scientific article

    Statements

    The computational difficulty of manipulating an election (English)
    0 references
    0 references
    0 references
    0 references
    1989
    0 references
    computational complexity
    0 references
    voting rule
    0 references
    strategy manipulation
    0 references
    NP-complete
    0 references

    Identifiers