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
Desirability function is based on the assumption of the Nash equilibrium, and therefore does not consider the possibility of the over-saturation of the pools.
As a consequence, an over-saturated pool will have the same desirability, and therefore ranking, than any non- or fully saturated pool.
Though, I understand the logic of the decision, but I think the desirability and therefore the ranking should consider the over-saturated pools to indirectly incentivase the users to delegate to the non-saturated pools.
This new addition could be considered as some max threshold i.e. max 100% of the desirability, which depends only on the level of the oversaturation of the relevant pool.
This can be very easily implemented in the haskell code by slightly modifying these three function belows:
I do not think it is necessary as the non-myopic reward would consider the oversaturated stake later anyway.
But, it would be a nice to have feature for checking the oversaturation at the ranking/desirability part too and not just in the non-myopic reward, to allow some others to be fit in the k number of pools instead of an over-saturated one.
The current ranking scheme is operating as designed; a change to the design needs to be proposed and considered more widely. Issues here are more for things we know we want to change!
Desirability function is based on the assumption of the Nash equilibrium, and therefore does not consider the possibility of the over-saturation of the pools.
As a consequence, an over-saturated pool will have the same desirability, and therefore ranking, than any
non-
orfully saturated
pool.Though, I understand the logic of the decision, but I think the desirability and therefore the ranking should consider the over-saturated pools to indirectly incentivase the users to delegate to the
non-saturated
pools.This new addition could be considered as some
max threshold
i.e. max 100% of the desirability, which depends only on the level of the oversaturation of the relevant pool.This can be very easily implemented in the haskell code by slightly modifying these three function belows:
The text was updated successfully, but these errors were encountered: