Loading…
Bruteforce Popular Outcome Computation for 2D Euclidean Roommates
Initialize Roommate Game
General
Room Size
Manual
Points
{0: [-5.9, 0.0], 1: [-2.8, 4.7], 2: [-1.9, 3.5], 3: [3.9, 0.4], 4: [5.4, -5.6], 5: [5.5, 7.2], 6: [5.8, 1.6], 7: [7.8, -9.0], 8: [9.5, -2.3]}
Set Manually
Random
Maximum Coordinate Values
X:
Y:
Minimum Coordinate Values
X:
Y:
Number of Agents
Set Randomly
Plot
Coordinates
Rank Table
Distance Table
Generate Popular Outcomes
Generate
Popular outcome plots
Popular outcomes
Find More Popular Outcome
Find More Popular
Input Outcome
[ [0, 1, 2], [3, 4, 5], [6, 7, 8] ]
More Popular Outcomes
Find Equally Popular Outcome
Find Equally Popular
Input Outcome
[ [0, 1, 2], [3, 4, 5], [6, 7, 8] ]
Equally Popular Outcomes
Plot Outcomes Manually
Input Outcomes
[ [[0, 1, 2], [3, 4, 5], [6, 7, 8]], [[0, 2, 4], [1, 3, 5], [6, 7, 8]] ]
Plot
Generate Rank Table
Generate Distance Table
Manual Plots
Rank Table
Distance Table
Compute Popularity Margin
Outcome 1
[[0, 1, 2], [3, 4, 5], [6, 7, 8]]
Outcome 2
[[0, 2, 4], [1, 3, 5], [6, 7, 8]]
Compute
Popularity Margin N(outcome1, outcome2)
*When the room size is 2 and all y-coordinates are 0, line intersections are avoided when drawing the popular outcomes.