Replication Data for: Optimal Bounds for the No-Show Paradox via SAT Solving
收藏DataONE2016-06-11 更新2024-06-26 收录
下载链接：
https://search.dataone.org/view/sha256:66cf650e7340603f0f00b3f34aabbdd4596e1c6f8189a1092d90d3cc3adb4928
下载链接
链接失效反馈官方服务：
资源简介：
Contains look-up tables that specify voting rules that were generated by a SAT solver which satisfy Condorcet consistency and participation for m = 4 alternatives and up to 11 [optimistic: 16, pessimistic: 13] voters. Also contains python scripts that verfiy that these functions indeed satisfy these axioms.
创建时间：
2023-11-21
