상세검색
최근 검색어 전체 삭제
다국어입력
즐겨찾기0
학술저널

Coalitionally strategy-proof voting rules for separable weak orderings

Coalitionally strategy-proof voting rules for separable weak orderings

  • 21
047809.jpg

  In the framework of multiple objects choice (e.g. candidate selection, membership, and qualification problems) with separable preferences (weak ordering), we characterize a family of voting rules that satisfy coalitional strategy-proofness, which requires that no group of agents can benefit simultaneously by jointly misrepresenting their preferences.

Abstract<BR>1. Introduction<BR>2. Model and basic concepts<BR>3. Results<BR>Acknowledgments<BR>References<BR>

(0)

(0)

로딩중