On complexity of lobbying in multiple referenda (Q2463791): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q57359948, #quickstatements; #temporary_batch_1719448105926
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Single transferable vote resists strategic voting / 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: The computational difficulty of manipulating an election / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing majority-rule equilibrium in spatial voting games / 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: On complexity of lobbying in multiple referenda / rank
 
Normal rank
Property / cites work
 
Property / cites work: New directions in cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Richer Understanding of the Complexity of Election Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4536344 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact analysis of Dodgson elections / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of Kemeny elections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact complexity of the winner problem for Young elections / rank
 
Normal rank

Latest revision as of 13:58, 27 June 2024

scientific article
Language Label Description Also known as
English
On complexity of lobbying in multiple referenda
scientific article

    Statements

    On complexity of lobbying in multiple referenda (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    6 December 2007
    0 references
    0 references
    lobbying
    0 references
    referendum
    0 references
    parametrized complexity
    0 references
    0 references
    0 references