The learnability of voting rules (Q840821): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: How hard is it to control an election? / 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: Q3772828 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Financial Cryptography and Data Security / 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: A new perspective on implementation by voting trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dichotomy for voting systems / 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: Learnability and rationality of choice. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probably Approximate Learning of Sets and Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3624050 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sophisticated voting rules: The case of two tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear programming. Foundations and extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Social Choice Scoring Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579475 / rank
 
Normal rank

Latest revision as of 22:55, 1 July 2024

scientific article
Language Label Description Also known as
English
The learnability of voting rules
scientific article

    Statements

    Identifiers