Recognizing Linked Domain in Polynomial Time

12/13/2017 ∙ by Yongjie Yang, et al. ∙ 0

The celebrated Gibbard-Satterthwaite Theorem states that any surjective social choice function which is defined over the universal domain of preferences and is strategy-proof must be dictatorial. Aswal, Chatterji and Sen generalize the Gibbard-Satterthwaite theorem by showing that the Gibbard-Satterthwaite theorem still holds if the universal domain is replaced with the linked domain. In this note, we show that determining whether an election is linked can be done in polynomial time.

READ FULL TEXT VIEW PDF
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.

References

  • [1] N. Aswal, S. Chatterji, and A. Sen. Dictatorial domains. Economic Theory, 22(1):45–62, 2003.
  • [2] A. Gibbard. Manipulation of voting schemes: A general result. Econometrica., 41(4):587–601, 1973.
  • [3] A. Pramanik. Further results on dictatorial domains. Social Choice and Welfare, 45(2):379–398, 2015.
  • [4] M. Satterthwaite. Strategy-proofness and Arrow’s conditions: Existence and correspondence theorems for voting procedures and social welfare functions. Journal of Economic Theory, 10(2):187–217, 1975.