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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disopt.2013.10.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2569303878 / rank
 
Normal rank

Revision as of 00:01, 20 March 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