Discursive Dilemma Source
Optimal Decision Rules for the Discursive Dilemma
Brought to you by:
alabert
Menu
▾
▴
Tree [aad586] default tip / History
| File | Date | Author | Commit |
|---|---|---|---|
| Paradox.py | 2022-09-20 |
Aureli Alabert
|
[45c9e3] initial commit |
| README.md | 2022-10-28 |
Aureli Alabert
|
[aad586] Typos corrected in READNE.md |
| custom_inputs.py | 2022-09-20 |
Aureli Alabert
|
[45c9e3] initial commit |
| functions.py | 2022-09-20 |
Aureli Alabert
|
[45c9e3] initial commit |
| nodes.py | 2022-09-20 |
Aureli Alabert
|
[45c9e3] initial commit |
Read Me
Discursive Dilemma
This is the accompanying software of the paper "Optimal Decision Rules for the Discursive Dilemma", by A. Alabert, M. Farré, and R. Montes, submitted for publication. A preprint can be found in https://arxiv.org/abs/2210.13100
To run the program, use python Paradox.py. Enter the committee size n, the weight w of false positive versus false negatives, and the competencies θ of the committee members separated by commas. If the list is shorter than the committee size, the last number is reused (in particular, one only number means same competence for all members); if the list is longer, the last numbers are ignored.
The slider Top Rules can be moved up to 5; the rankings will include this number of ``best rules''. The limit 5 can be easily changed editing the source code.
Press the RUN button to obtain the rankings. The rules are described by the antichains of the upper set containing the voting tables that yield the positive conclusion "C". For example, [1110, 2001] means that the upper set is formed by tables (1110), (2001), (2100), (3000) (and the transposed table (2010)).
