Replication Data for: Optimal Bounds for the No-Show Paradox via SAT Solving
收藏NIAID Data Ecosystem2026-03-09 收录
下载链接：
https://doi.org/10.7910/DVN/TGIQB7
下载链接
链接失效反馈官方服务：
资源简介：
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.
创建时间：
2016-06-11
