A Dynamic Rationalization of Distance Rationalizability
暂无分享,去创建一个
[1] Hannu Nurmi,et al. Closeness Counts in Social Choice , 2008 .
[2] Manfred J. Holler,et al. Power, freedom, and voting , 2008 .
[3] Piotr Faliszewski,et al. On the role of distances in defining voting rules , 2010, AAMAS.
[4] Ariel D. Procaccia,et al. Dynamic Social Choice : Foundations and Algorithms ∗ , 2011 .
[5] Ariel D. Procaccia. Can Approximation Circumvent Gibbard-Satterthwaite? , 2010, AAAI.
[6] Claire Mathieu,et al. Electronic Colloquium on Computational Complexity, Report No. 144 (2006) How to rank with few errors A PTAS for Weighted Feedback Arc Set on Tournaments , 2006 .
[7] Piotr Faliszewski,et al. Good Rationalizations of Voting Rules , 2010, AAAI.
[8] Piotr Faliszewski,et al. On distance rationalizability of some voting rules , 2009, TARK '09.
[9] Ariel D. Procaccia,et al. On the approximability of Dodgson and Young elections , 2009, Artif. Intell..
[10] Martin L. Puterman,et al. Markov Decision Processes: Discrete Stochastic Dynamic Programming , 1994 .
[11] Hannu Nurmi,et al. A Comparison of Some Distance-Based Choice Rules in Ranking Environments , 2004 .