Login / Signup

Arrow's Possibility Theorem for one-dimensional single-peaked preferences.

Lars EhlersTon Storcken
Published in: Games Econ. Behav. (2008)
Keyphrases
  • single peaked
  • computationally hard
  • np hard
  • fixed parameter tractability
  • social choice
  • multi dimensional
  • preference aggregation
  • reinforcement learning
  • cooperative
  • special case
  • np complete
  • path planning