The learnability of voting rules
From MaRDI portal
Publication:840821
DOI10.1016/j.artint.2009.03.003zbMath1191.68524OpenAlexW2067594415MaRDI QIDQ840821
Ariel D. Procaccia, Aviv Zohar, Yoni Peleg, Jeffrey S. Rosenschein
Publication date: 14 September 2009
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2009.03.003
Related Items
Voting: a machine learning approach, Optimal social choice functions: a utilitarian view, Incentive compatible regression learning, Robust winner determination in positional scoring rules with uncertain weights, Algorithms for strategyproof classification, On the approximability of Dodgson and Young elections, A new perspective on implementation by voting trees, Optimizing positional scoring rules for rank aggregation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Dichotomy for voting systems
- Anyone but him: the complexity of precluding an alternative
- How hard is it to control an election?
- A heuristic technique for multi-agent planning
- Learnability and rationality of choice.
- Sophisticated voting rules: The case of two tournaments
- Probably Approximate Learning of Sets and Functions
- When are elections with few candidates hard to manipulate?
- Social Choice Scoring Functions
- A new perspective on implementation by voting trees
- Financial Cryptography and Data Security
- Linear programming. Foundations and extensions