Computational Aspects of Approval Voting (Q2829683): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1528175708 / 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: Condorcet Social Choice Functions / 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: How hard is it to control an election? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact analysis of Dodgson elections / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic technique for multi-agent planning / 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: Exact complexity of the winner problem for Young elections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Going from theory to practice: the mixed success of approval voting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approval voting: three examples / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dichotomy for voting systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Anyone but him: the complexity of precluding an alternative / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximability of Dodgson's rule / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized juntas and NP-hard sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sincere-Strategy Preference-Based Approval Voting Fully Resists Constructive Control and Broadly Resists Destructive Control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guarantees for the success frequency of an algorithm for finding Dodgson-election winners / 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: Frequency of correctness versus average polynomial time / rank
 
Normal rank

Latest revision as of 21:18, 12 July 2024

scientific article
Language Label Description Also known as
English
Computational Aspects of Approval Voting
scientific article

    Statements

    Computational Aspects of Approval Voting (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    8 November 2016
    0 references

    Identifiers

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