Replication Data for: Optimal Bounds for the No-Show Paradox via SAT Solving
<|begin_of_text|><|start_header_id|>system<|end_header_id|> You are a research archivist expert in dataset metadata. Answer the question truthfully.  <|eot_id|><|start_header_id|>user<|end_header_id|> Here is the Description of a dataset. Description:'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' . Please return only a json list of at most 3 Keywords corresponding to the Description:.<|eot_id|><|start_header_id|>assistant<|end_header_id|> {"Answer" : ["computational social choice"]} <|eot_id|>
 Here is the Description of a dataset. Description:'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' . Please return only a json list of at most 3 Keywords corresponding to the Description:.
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
computational social choice