HackMD
  • Prime
    Prime  Full-text search on all paid plans
    Search anywhere and reach everything in a Workspace with Prime plan.
    Got it
    • Prime  Full-text search on all paid plans
      Prime  Full-text search on all paid plans
      Search anywhere and reach everything in a Workspace with Prime plan.
      Got it
      • Options
      • Versions and GitHub Sync
      • Transfer ownership
      • Delete this note
      • Template
      • Insert from template
      • Export
      • Dropbox
      • Google Drive
      • Gist
      • Import
      • Dropbox
      • Google Drive
      • Gist
      • Clipboard
      • Download
      • Markdown
      • HTML
      • Raw HTML
      • Sharing Link copied
      • /edit
      • View mode
        • Edit mode
        • View mode
        • Book mode
        • Slide mode
        Edit mode View mode Book mode Slide mode
      • Note Permission
      • Read
        • Owners
        • Signed-in users
        • Everyone
        Owners Signed-in users Everyone
      • Write
        • Owners
        • Signed-in users
        • Everyone
        Owners Signed-in users Everyone
      • More (Comment, Invitee)
      • Publishing
        Everyone on the web can find and read all notes of this public team.
        After the note is published, everyone on the web can find and read this note.
        See all published notes on profile page.
      • Commenting Enable
        Disabled Forbidden Owners Signed-in users Everyone
      • Permission
        • Forbidden
        • Owners
        • Signed-in users
        • Everyone
      • Invitee
      • No invitee
    Menu Sharing Help
    Menu
    Options
    Versions and GitHub Sync Transfer ownership Delete this note
    Export
    Dropbox Google Drive Gist
    Import
    Dropbox Google Drive Gist Clipboard
    Download
    Markdown HTML Raw HTML
    Back
    Sharing
    Sharing Link copied
    /edit
    View mode
    • Edit mode
    • View mode
    • Book mode
    • Slide mode
    Edit mode View mode Book mode Slide mode
    Note Permission
    Read
    Owners
    • Owners
    • Signed-in users
    • Everyone
    Owners Signed-in users Everyone
    Write
    Owners
    • Owners
    • Signed-in users
    • Everyone
    Owners Signed-in users Everyone
    More (Comment, Invitee)
    Publishing
    Everyone on the web can find and read all notes of this public team.
    After the note is published, everyone on the web can find and read this note.
    See all published notes on profile page.
    More (Comment, Invitee)
    Commenting Enable
    Disabled Forbidden Owners Signed-in users Everyone
    Permission
    Owners
    • Forbidden
    • Owners
    • Signed-in users
    • Everyone
    Invitee
    No invitee
       owned this note    owned this note      
    Published Linked with GitHub
    Like BookmarkBookmarked
    Subscribed
    • Any changes
      Be notified of any changes
    • Mention me
      Be notified of mention me
    • Unsubscribe
    Subscribe
    # Investigate the Optimality Gap as an Indicator of Collusion on Gitcoin Grants ###### tags: `Research` For more background information on this collaboration, read [this Notion TL;DR](https://www.notion.so/blockscience/Gitcoin-Modelling-Co-Lab-TL-DR-4e115525dbc0430289bb78d60ad79a04). ## Intro **One of the primary considerations of using Quadratic Funding as a governance policy over fund allocation is the threat of collusion**. But what is collusion in graph-theoretical terms? Describing private intent through available public structures is a common hurdle when designing equitable incentive structures, and a comprehensive definition is often out of reach. However, it is possible to infer what happens when looking into the actual consequences of successful collusion. We can imagine that colluders will optimize their tactics and strategies for maximizing their objective of maximizing funding outcomes, while organic actors will have a more random structure due to the diversity and heterogenity of tactics and choice functions. For the Gitcoin Grants case, this means that the neighboring graph structures for colluding grants might be highly optimized for funding, while the ones for organic grants would not present a highly optimized collaboration structure. In this research plan, we explore the above idea by using Neighbor Subgraphs as a proxy for those network structures. We then examine the gap between the transactions in these subgraphs as they occurred in reality, compared with an idealized optimal transaction order that maximizes funding - **we call this measure the 'optimality gap'.** As a working question, **we hypothesize that this optimality has a bi-modal distribution:** - **'Cluster of communities with large Optimality Gap'** representing low optimization of funding on behalf of organic grants - **'Cluster of communities with small Optimality Gap'**, which could indicate grants which are adopting colluding strategies. *An example of a bi-modal distribution. Source: https://medium.com/precarious-physicist/teaching-a-class-with-a-bimodal-distribution-if-you-have-one-c9629ac15469*: ![Bimodal distribution](https://i.imgur.com/8J2Vsgo.png) ## Definitions D0: The full contribution graph $G$, for each vertex is either a grant (whose nodes constitute the set $\mathcal{G}$) or a contributor (constituing the set $\mathcal{C}$). All edges go from a vertex of type contributor to a vertex of type grant. D1: $NeighborsSubgraph(g)= \{n \in \mathcal{G} \;: d(g, n) \leq 3 \}$ - $n$: node (grant or contributor) - $g$: grant - $d(u, v)$: Degree distance between nodes $u$ and $v$ *The Neighbors Subgraph for a given grant is somewhat similiar to the 'expansion 3' subgraph. Source: https://stackoverflow.com/questions/63534977/how-to-get-neighbor-nodes* ![](https://i.imgur.com/LMVT1Wj.png) --- D2: The Quadratic Match of a subgraph is the sum of quadratic match of all the grants contained inside it. --- D3: The metric of interest is the Quadratic Match for a Neighbors Subgraph associated with a grant $g$. - Alternatively, we can understand the quadratic match of the subgraph as being the utility function. --- D4: The *real subgraph of a grant* is the NeighborsSubgraph that is induced from original graph. --- D5: The *optimal subgraph of a grant* is the *real subgraph* where the edges are rewired such that metric of interest in regards to the induced subgraph is maximized. *Example of graphs with the same amount of nodes and edges. Source: https://www.researchgate.net/publication/332979502_Global_Robustness_vs_Local_Vulnerabilities_in_Complex_Synchronous_Networks* ![](https://i.imgur.com/1OsWyni.png) --- D6: Optimality gap is the one minus the fraction between the metric of the neighbors real subgraph and the optimal subgraph: $$OptimalityGap=\left(1-\frac{M_r}{M_o}\right)$$ <!-- ### On optimality suppose there is an optimization problem $\max_x f(x)$ then the optimal arguement is $x^*$ s.t $M_0=f(x^*)$, for any observed value $x$ (in this case the real graph), then we have $M_r = f(x)$ --> ## Hypothesis H1: The optimality gap per grant distribution on the Gitcoin Grants network is bimodal, with a larger density on the high side. - This could be indirectly interpreted(*) that the mode associated with small gap is a 'colluders' mode, and the one with large gap would be the 'common' mode. ## Methodology The execution of this research plan will be done partly through public working sessions, which will have live streams and live coding sessions with community participation, while BSci researchers will implement the required definitions and mechanisms as well as integrating with the available data. We will use the Rounds 8 dataset and matching algorithm. Through those, we'll perform a Exploratory Data Analysis over the optimality gap metric, seeking to characterize the associated distribution as well as exploring emergent properties that may arise. ## Applications If hypothesis is confirmed: - Small optimality gap implies high optimization for funding, - Actionability of policies on the optimality gap: set thresholds for human evaluation of grants with small gap. Else: - Change D1 so that it uses subgraphs from community detection algorithms - Formulate an alternative for H1 - Formulate an alternative for D3 Note that these applications are not exhaustive. ## Next Steps - Testing H1 for the dynamical network instead of static network - Evaluating the Optimality Gap by using live data on next Grants round - Expanding D1 or D5 to include temporal neighbors or windows - use community detection subgraphs and solve optimal rewiring to $m$ grants rather than just $1$. - **There's a world of science out there to explore - let's get started!** *Gitcoin Grants Round 7 on Kumu. Red nodes are donors, green nodes are grants. Source: https://gitcoin.co/blog/towards-computer-aided-governance-of-gitcoin-grants/* ![](https://miro.medium.com/max/1512/1*dAod3qJhm9mSJg6jb5dXdw.gif)

    Import from clipboard

    Advanced permission required

    Your current role can only read. Ask the system administrator to acquire write and comment permission.

    This team is disabled

    Sorry, this team is disabled. You can't edit this note.

    This note is locked

    Sorry, only owner can edit this note.

    Reach the limit

    Sorry, you've reached the max length this note can be.
    Please reduce the content or divide it to more notes, thank you!

    Import from Gist

    Import from Snippet

    or

    Export to Snippet

    Are you sure?

    Do you really want to delete this note?
    All users will lost their connection.

    Create a note from template

    Create a note from template

    Oops...
    This template is not available.


    Upgrade

    All
    • All
    • Team
    No template found.

    Create custom template


    Upgrade

    Delete template

    Do you really want to delete this template?

    This page need refresh

    You have an incompatible client version.
    Refresh to update.
    New version available!
    See releases notes here
    Refresh to enjoy new features.
    Your user state has changed.
    Refresh to load new user state.

    Sign in

    Forgot password

    or

    By clicking below, you agree to our terms of service.

    Sign in via Facebook Sign in via Twitter Sign in via GitHub Sign in via Dropbox Sign in via Google

    New to HackMD? Sign up

    Help

    • English
    • 中文
    • Français
    • Deutsch
    • 日本語
    • Español
    • Català
    • Ελληνικά
    • Português
    • italiano
    • Türkçe
    • Русский
    • Nederlands
    • hrvatski jezik
    • język polski
    • Українська
    • हिन्दी
    • svenska
    • Esperanto
    • dansk

    Documents

    Tutorials

    Book Mode Tutorial

    Slide Mode Tutorial

    YAML Metadata

    Contacts

    Facebook

    Twitter

    Feedback

    Send us email

    Resources

    Releases

    Pricing

    Blog

    Policy

    Terms

    Privacy

    Cheatsheet

    Syntax Example Reference
    # Header Header 基本排版
    - Unordered List
    • Unordered List
    1. Ordered List
    1. Ordered List
    - [ ] Todo List
    • Todo List
    > Blockquote
    Blockquote
    **Bold font** Bold font
    *Italics font* Italics font
    ~~Strikethrough~~ Strikethrough
    19^th^ 19th
    H~2~O H2O
    ++Inserted text++ Inserted text
    ==Marked text== Marked text
    [link text](https:// "title") Link
    ![image alt](https:// "title") Image
    `Code` Code 在筆記中貼入程式碼
    ```javascript
    var i = 0;
    ```
    var i = 0;
    :smile: :smile: Emoji list
    {%youtube youtube_id %} Externals
    $L^aT_eX$ LaTeX
    :::info
    This is a alert area.
    :::

    This is a alert area.

    Versions

    Versions and GitHub Sync

    Sign in to link this note to GitHub Learn more
    This note is not linked with GitHub Learn more
     
    Add badge Pull Push GitHub Link Settings
    Upgrade now

    Version named by    

    More Less
    • Edit
    • Delete

    Note content is identical to the latest version.
    Compare with
      Choose a version
      No search result
      Version not found

    Feedback

    Submission failed, please try again

    Thanks for your support.

    On a scale of 0-10, how likely is it that you would recommend HackMD to your friends, family or business associates?

    Please give us some advice and help us improve HackMD.

     

    Thanks for your feedback

    Remove version name

    Do you want to remove this version name and description?

    Transfer ownership

    Transfer to
      Warning: is a public team. If you transfer note to this team, everyone on the web can find and read this note.

        Link with GitHub

        Please authorize HackMD on GitHub

        Please sign in to GitHub and install the HackMD app on your GitHub repo. Learn more

         Sign in to GitHub

        HackMD links with GitHub through a GitHub App. You can choose which repo to install our App.

        Push the note to GitHub Push to GitHub Pull a file from GitHub

          Authorize again
         

        Choose which file to push to

        Select repo
        Refresh Authorize more repos
        Select branch
        Select file
        Select branch
        Choose version(s) to push
        • Save a new version and push
        • Choose from existing versions
        Available push count

        Upgrade

        Pull from GitHub

         
        File from GitHub
        File from HackMD

        GitHub Link Settings

        File linked

        Linked by
        File path
        Last synced branch
        Available push count

        Upgrade

        Danger Zone

        Unlink
        You will no longer receive notification when GitHub file changes after unlink.

        Syncing

        Push failed

        Push successfully