Toward Computing the Margin of Victory in Single Transferable Vote Elections (Q5139621): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: SCIP: solving constraint integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single transferable vote resists strategic voting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of Computational Social Choice / 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: Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5283030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey / rank
 
Normal rank

Latest revision as of 03:42, 24 July 2024

scientific article; zbMATH DE number 7283447
Language Label Description Also known as
English
Toward Computing the Margin of Victory in Single Transferable Vote Elections
scientific article; zbMATH DE number 7283447

    Statements

    Identifiers