-
Notifications
You must be signed in to change notification settings - Fork 28
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
added potential solutions #13
base: master
Are you sure you want to change the base?
Conversation
Signed-off-by: Ayoub <ayoubtaleb.edu@gmail.com>
We look for a single solution not many. Second proposition: |
I think the second proposition has some good insights. let's consider the host can only confirm something is true(example confirm labels after their unveil) but he will not perform any action or enforce something on the guests. |
Well assuming the guests are smart and they know some basic cooperative game theory knowledge, they will have to respect the rules since they know It is their best shot at drinking water and satisfying their thirst (or else the solution will not be applied and they will all stay thirsty). let's take the following payoff matrix of any 2 random guests as an example: ( where -1 means no one will be able to drink water since the cups are not on the table)
And since our game is deterministic ( winner will be only chosen after all guests respect the rules and put their cups on the table thus no deadlock), while also being fair and fully verifiable after. It is statistically better to go out with a 2/N chance than waiting to be the last infinitely and staying thirsty not drinking at all.
Well my last solution is about a trustless and fair solution to all the guests. For example in a smart contract, the code and the agreements contained there will be executed automatically and be fully transparent and verifiable. For the specifics, once they agree, any Verifiable Random Function or even a merit-based game could work here (If they all agree on it of course.) |
Well, consider the host can only confirm something if the labels are but he will not perform any action or enforce something on the guests. This will be a bit tricky but will not deviate from the original proposal. This process will be executed as follows: The guests will be divided into 1 picker guest and N-1 labelers.
The two guests with the labels corresponding to the first and last cup can now drink/share the water depending on their altruism/selfishness, as all the cups are put on the table and there will be no deadlock. As for why would the guests would accept such solution, It is because it's their only shot to quench their thirst as explained in my last reply. Any feedback is appreciated so I can modify my original answer. |
Signed-off-by: Ayoub ayoubtaleb.edu@gmail.com