You are viewing a single comment's thread from:
RE: People Rank - Using Page Rank Algorithm for Better Curation and Rewards
Maybe some sort of algorithm that says if you vote XX or more and your posts were XX % successful, you get a bit extra? As to spread out the votes but in a sort of way where everyone gets to vote on more widespread content, as opposed to the "sure thing" votes that tend to be cast. Also I think more content discovery methods would help ALOT. We are walled in right now to a list of hashtags and need something more intuitive... IMO.
I think you should get more curation rewards for voting something that is not expected to do well but does( value investing in my field) For instance if a poster averages 5c a post and then nails it , the curation rewards should be higher for the value of post above 5c ( or Lower if under 5c) This encourages posters to read, consider if this is really good and not just reward posters with good track record. Maybe it's a 25% bonus or penalty for voters in first 30minutes on all value above the average. The later voters would be he source of this reward.
Although this idea seems really great at the surface, it has deep Sybil attack vulnerabilities and be gamed to destroy the system.
This is why non-experts are not allowed to design the system. But thanks for sharing your idea any way. Open source is that maybe via enough sharing of ideas, we can happenstance on a winning one.
I like that idea, because you are using the same amount of voting % whether you are voting on a new posters content, or a veterans content.
What would you think about each day having some sort of "bonus" vote carrying a bit more weight. Maybe 3 a day that would give you a higher curation reward. I don't know if that is feasible, but I think it would be something interesting to explore.
Without the early incentive, you'll just vote for all the most successful posts late.
We agree, but no one knows how to fix that. Not Facebook, not Reddit, not Twitter, etc.. It is an industry wide unsolved problem.