Verifying Randomised Social Choice
暂无分享,去创建一个
[1] Johannes Hölzl,et al. A Verified Compiler for Probability Density Functions , 2015, ESOP.
[2] Tobias Nipkow,et al. Social Choice Theory in HOL , 2009, Journal of Automated Reasoning.
[3] W. Tucker. The Lorenz attractor exists , 1999 .
[4] K. Arrow. A Difficulty in the Concept of Social Welfare , 1950, Journal of Political Economy.
[5] Daniel G. Espinoza. On Linear Programming, Integer Programming and Cutting Planes , 2006 .
[6] M. Viana. What’s new on lorenz strange attractors? , 2000 .
[7] Tobias Nipkow,et al. Arrow and Gibbard-Satterthwaite , 2008, Arch. Formal Proofs.
[8] Clemens Ballarin. Locales: A Module System for Mathematical Theories , 2013, Journal of Automated Reasoning.
[9] Felix Brandt,et al. Proving the Incompatibility of Efficiency and Strategyproofness via SMT Solving , 2016, IJCAI.
[10] Freek Wiedijk,et al. Formalizing Arrow’s theorem , 2009 .
[11] A. Gibbard. Manipulation of Schemes That Mix Voting with Chance , 1977 .
[12] Peter Gammie,et al. Some classical results in Social Choice Theory , 2008, Arch. Formal Proofs.
[13] William J. Cook,et al. Exact solutions to linear programming problems , 2007, Oper. Res. Lett..
[14] Manuel Eberl. The Incompatibility of SD-Efficiency and SD-Strategy-Proofness , 2016, Arch. Formal Proofs.
[15] Felix Brandt,et al. Voting with Ties: Strong Impossibilities via SAT Solving , 2018, AAMAS.
[16] Tobias Nipkow,et al. A FORMAL PROOF OF THE KEPLER CONJECTURE , 2015, Forum of Mathematics, Pi.
[17] Manuel Eberl. Randomised Social Choice Theory , 2016, Arch. Formal Proofs.
[18] Felix Brandt,et al. The Incompatibility of Fishburn-Strategyproofness and Pareto-Efficiency , 2018, Arch. Formal Proofs.
[19] Felix Brandt,et al. The Impossibility of Extending Random Dictatorship to Weak Preferences , 2015, ArXiv.