Gallery
Share
Explore

icon picker
Connection Oriented Cluster Match

Connor McCormick
A toy implementation of Connection Oriented Cluster Match, a collusion-proof quadratic funding mechanism.

You can find the paper here:
https://papers.ssrn.com/sol3/papers.cfm?abstract_id=4311507
⁠
⁠

Original code on which this is based:
https://github.com/Jmiller4/plural-qf/blob/14a163d7df0206a30f2af0bb6077adb9a246c806/pluralqf.py#L7
⁠
⁠

Agents
Name
Contribution
Groups
Memberships
1
0 Alice
$100.00
B
1
2
1 Bob
$1.00
C
1
3
2 Charlee
$15.00
A
1
4
3 Doug
$1.00
A
B
C
3
5
4 Emma
$10.00
C
1
There are no rows in this table
⁠
Groups
Name
Members
Member Count
1
A
2 Charlee
3 Doug
2
2
B
0 Alice
3 Doug
2
3
C
1 Bob
3 Doug
4 Emma
3
There are no rows in this table
⁠

⁠
Regenerate Friend Matrix
⁠
click this button each time you add or remove a group or an agent

You don’t need to regenerate after editing anything highlighted green
Friend Matrix
⁠

Contribution Amount
$127.00
⁠
⁠

Quadratic Matching
$39.75
⁠
← Warning! calculation currently isn’t correct. If you’d like to use this ping me on twitter
@connormcmk
⁠
to prompt me to fix it

Total Funding
$166.75
⁠


Want to print your doc?
This is not the way.
Try clicking the ⋯ next to your doc name or using a keyboard shortcut (
CtrlP
) instead.