• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

On the computability of binary social choice rules in an infinite society and the halting problem.

Yasuhito Tanaka
Published in: Appl. Math. Comput. (2008)
Keyphrases
  • social choice
  • artificial intelligence
  • association rules
  • machine learning
  • background knowledge
  • attribute values
  • computational complexity
  • preference aggregation