You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Create a numerical simulation of the model to further verify that the calculation in the prototype works as expected. Furthermore, such a simulation framework could be used to illustrate the impact of different parameters lexicon would like to implement in the future.
Design the form for collecting attributes about users (e.g. affiliation etc.). To design the form one must evaluate which set of variables is possible to incorporate into the model.
Prove collusion-resistance for quadratic voting
The proof of collusion resistance in https://papers.ssrn.com/sol3/papers.cfm?abstract_id=4311507 uses the model of quadratic finance (QF) as a baseline. However, in section 1.4. they show how their results can be applied to QV. We could use this as a baseline to proof collusion resistance of QV explicitly. We could use the re-written model of collusion resistance for outreach and as a baseline for possible extensions that we might want to include.
Fine grained attenuation of voting power
Collusion resistant QV is possible due to a strategy called Connection-Oriented Cluster Match. The proof relies on the fact that the attenuation of the interaction term (e.g. if two users have the same affiliation) is relatively coarse. That is, every contribution is either square rooted (e.g. if two users have the same affiliation) or not. One could imagine a more finely grained attenuation than this. However, whether a more fine grained attenuation is collusion-resistant or not must be proven.
Preference model for collusion resistant QV
Develop a preference model that describes which variables should and should not be taken into account for collusion resistant QV as well as their impact.
The text was updated successfully, but these errors were encountered:
This epic outlines the possible research activities at
lexicon
. The following list is not exhaustive and might change.lexicon
would like to implement in the future.Connection-Oriented Cluster Match
. The proof relies on the fact that the attenuation of the interaction term (e.g. if two users have the same affiliation) is relatively coarse. That is, every contribution is either square rooted (e.g. if two users have the same affiliation) or not. One could imagine a more finely grained attenuation than this. However, whether a more fine grained attenuation is collusion-resistant or not must be proven.The text was updated successfully, but these errors were encountered: