Parameterized complexity of control by voter selection in Maximin, Copeland, Borda, Bucklin, and Approval election systems (Q391210): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Hong Liu / rank
Normal rank
 
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.tcs.2013.05.019 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1964053454 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of social choice and welfare. Vol. 1. / 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: Parameterized complexity of candidate control in elections and related digraph problems / 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: Q4393480 / 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: Multimode Control Attacks on Elections / 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: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of control problems in Maximin election / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized computational complexity of control problems in voting systems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 04:46, 7 July 2024

scientific article
Language Label Description Also known as
English
Parameterized complexity of control by voter selection in Maximin, Copeland, Borda, Bucklin, and Approval election systems
scientific article

    Statements

    Identifiers