GitHub

/GNSP contains all files for our codes and the supplementary material for the following paper:

Mohsin, F., Han, Q., Ruan, S., Chen, P. Y., Rossi, F., & Xia, L. (2024). Computational Complexity of Verifying the Group No-show Paradox. IJCAI-24.

Name		Name	Last commit message	Last commit date
Latest commit History 27 Commits
GNSP		GNSP
__pycache__		__pycache__
dataset		dataset
smoothed_complexity_codes		smoothed_complexity_codes
soc		soc
synthetic_data		synthetic_data
AI_copeland.py		AI_copeland.py
README.md		README.md
bruteforce.py		bruteforce.py
cvxopt_test.py		cvxopt_test.py
cvxpy_test.py		cvxpy_test.py
fixed_m_anonymous_r_polynomial.py		fixed_m_anonymous_r_polynomial.py
ilp_gp.py		ilp_gp.py
ilp_gp_new.py		ilp_gp_new.py
ilp_sandbox.py		ilp_sandbox.py
ilp_test_preflib.py		ilp_test_preflib.py
mallows_gen.py		mallows_gen.py
notes.md		notes.md
ortools_test.py		ortools_test.py
output_generation.py		output_generation.py
preflib_utils.py		preflib_utils.py
sandbox_preflib.py		sandbox_preflib.py
scipy_test.py		scipy_test.py
stv_mm_sandbox.py		stv_mm_sandbox.py
testing.py		testing.py
testing_preflib.py		testing_preflib.py
testing_preflib_sat.py		testing_preflib_sat.py
testing_v2.py		testing_v2.py
voting_rules.py		voting_rules.py
voting_utils.py		voting_utils.py

Provide feedback