The complexity of probabilistic lobbying (Q1662102): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q59864911, #quickstatements; #temporary_batch_1712272666262
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The Complexity of Probabilistic Lobbying / 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: Llull and Copeland Voting Computationally Resist Bribery and Constructive Control / rank
 
Normal rank
Property / cites work
 
Property / cites work: How Hard Is Bribery in Elections? / rank
 
Normal rank
Property / cites work
 
Property / cites work: A formal theory of lobbying behaviour / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5844986 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The all-pay auction with complete information / 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: Voting schemes for which it can be difficult to tell who won the election / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact analysis of Dodgson elections / 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: The complexity of Kemeny elections / 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: Single transferable vote resists strategic voting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Financial Cryptography and Data Security / 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: Dichotomy for voting systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3624050 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3624161 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the coalitional manipulation problem / 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: Anyone but him: the complexity of precluding an alternative / 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: Sincere-Strategy Preference-Based Approval Voting Fully Resists Constructive Control and Broadly Resists Destructive Control / 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: Computational Aspects of Approval Voting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Copeland Voting Fully Resists Constructive Control / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of bribery and manipulation in tournaments with uncertain information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Turing way to parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards Fully Multivariate Algorithmics: Some New Results and Directions in Parameter Ecology / 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: Q3624141 / rank
 
Normal rank
Property / cites work
 
Property / cites work: ParamILS: An Automatic Algorithm Configuration Framework / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial vs. Complete Domination: t-Dominating Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient probabilistically checkable proofs and applications to approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527015 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the approximability of Dodgson and Young elections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterizing by the number of numbers / rank
 
Normal rank

Latest revision as of 10:14, 16 July 2024

scientific article
Language Label Description Also known as
English
The complexity of probabilistic lobbying
scientific article

    Statements

    The complexity of probabilistic lobbying (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    17 August 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    computational complexity
    0 references
    parameterized complexity
    0 references
    approximability
    0 references
    computational social choice
    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
    0 references
    0 references