ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 0903.1137
  4. Cited By
Complexity of Terminating Preference Elicitation

Complexity of Terminating Preference Elicitation

6 March 2009
T. Walsh
ArXiv (abs)PDFHTML

Papers citing "Complexity of Terminating Preference Elicitation"

3 / 3 papers shown
Title
Where are the hard manipulation problems?
Where are the hard manipulation problems?
T. Walsh
107
72
0
29 Jul 2010
Is Computational Complexity a Barrier to Manipulation?
Is Computational Complexity a Barrier to Manipulation?
T. Walsh
113
29
0
05 Jul 2010
Where are the really hard manipulation problems? The phase transition in
  manipulating the veto rule
Where are the really hard manipulation problems? The phase transition in manipulating the veto rule
T. Walsh
115
84
0
22 May 2009
1