摘要
We prove the conjecture by Diaconis and Eriksson (J. Symbolic Comput. 41(2):182-195, 2006) that the Markov degree of the Birkhoff model is three. In fact, we prove the conjecture in a generalization of the Birkhoff model, where each voter is asked to rank a fixed number, say r, of candidates among all candidates.
- 出版日期2014-8