Binary linear programming solutions and non-approximability for control problems in voting systems (Q741772): 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2013.08.032 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2140647829 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Digraphs / 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: How hard is it to control an election? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Aspects of Approval Voting / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Making a Distinguished Vertex Minimum Degree by Vertex Deletion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of candidate control in elections and related digraph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079613 / 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: How Hard Is Bribery in Elections? / 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: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / 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: 50 Years of Integer Programming 1958-2008 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Voter Antagonism and the Paradox of Voting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579475 / rank
 
Normal rank

Latest revision as of 01:47, 9 July 2024

scientific article
Language Label Description Also known as
English
Binary linear programming solutions and non-approximability for control problems in voting systems
scientific article

    Statements

    Binary linear programming solutions and non-approximability for control problems in voting systems (English)
    0 references
    0 references
    0 references
    12 September 2014
    0 references
    graph algorithms
    0 references
    digraph modification problems
    0 references
    binary linear programming formulations
    0 references
    approximation
    0 references
    computational social choice
    0 references
    control problems
    0 references
    voting
    0 references

    Identifiers