RCV/main.py at main · leonhuang29/RCV · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
from nash import find_nash_equilibria, best_response_right, brute_force_nash

def main():

    left_possibilities = [-1.0, -0.5, 0.0]
    right_possibilities = [0.0, 0.5, 1.0]
    voter_positions = [-1.0, -0.5, 0.0, 0.5, 1.0]
    seats = 3
    k = 3
    density1 = [1, 1, 1, 1, 1]
    output_dir = "results/11111"

    #find_nash_equilibria(left_possibilities, right_possibilities, k, voter_positions, seats)
    #best_response_right(left_possibilities, right_possibilities, k, voter_positions, seats)
    brute_force_nash(left_possibilities, right_possibilities, k, voter_positions, seats, density1, output_dir, csv_name="nash_for_zero_one_restriction.csv")

    left_possibilities = [-1.0, -0.5, 0.0, 0.5]
    right_possibilities = [-0.5, 0.0, 0.5, 1.0]

    #find_nash_equilibria(left_possibilities, right_possibilities, k, voter_positions, seats)
    #best_response_right(left_possibilities, right_possibilities, k, voter_positions, seats)
    brute_force_nash(left_possibilities, right_possibilities, k, voter_positions, seats, density1, output_dir, csv_name="nash_for_half_one_restriction.csv")

    left_possibilities = [-1.0, -0.5, 0.0, 0.5, 1.0]
    right_possibilities = [-1.0, -0.5, 0.0, 0.5, 1.0]

    #find_nash_equilibria(left_possibilities, right_possibilities, k, voter_positions, seats)
    #best_response_right(left_possibilities, right_possibilities, k, voter_positions, seats)
    brute_force_nash(left_possibilities, right_possibilities, k, voter_positions, seats, density1, output_dir, csv_name="nash_for_no_restriction.csv")

if __name__ == "__main__":
    main()