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

Type two computability of social choice functions and the Gibbard-Satterthwaite theorem in an infinite society.

Yasuhito Tanaka
Published in: Appl. Math. Comput. (2007)
Keyphrases
  • social choice
  • machine learning
  • multi agent systems
  • computationally feasible
  • computational social choice
  • artificial intelligence
  • cooperative
  • multi dimensional
  • np complete
  • incentive compatible