The learnability of voting rules.
Ariel D. ProcacciaAviv ZoharYoni PelegJeffrey S. RosenscheinPublished in: Artif. Intell. (2009)
Keyphrases
- scoring rules
- voting rules
- computational social choice
- finite automata
- computationally hard
- boolean functions
- cartesian product
- rank aggregation
- learning algorithm
- uniform convergence
- np hardness
- pattern languages
- social choice
- partial order
- uniform distribution
- inductive inference
- np hard
- inductive logic programming
- winner determination
- membership queries
- special case
- multi agent
- pac learning
- orders of magnitude
- sufficient conditions
- cooperative
- weighted majority
- single peaked
- machine learning