Order encryption

[rach-id]

Another attempt considering the fact that its just one round.

[bellaj]

This solution keeps the low probability to drink of 2/N which won't encourage players to support this proposition. a player can argue if we share water we will have a drinking probability of 1.
Players are smart so they intend to maximize their chances and to get the most possible quantity of water. What do you think?

[rach-id]

This solution keeps the low probability to drink of 2/N which won't encourage players to support this proposition.

I think 2/N is the best we can get. Because we dont know the guests, so we dont have any criteria to give some higher probability. So we are in an equiprobable space and thats the best we can do.
I didnt take in mind we can add extra criterias to the guest.

A player can argue if we share water we will be have a drinking probability of 1

I didnt think that ressources can be divided... If so, i dont think there is even a problem, they can just share it since the begining.

[bellaj]

I didnt think that ressources can be divided... If so, i dont think there is even a problem, they can just share it since the begining.

It's a problem, how would be possible to share water in such situation where guests can cheat (not respect an agreement)

[rach-id]

the pourer can do it since he doesnt have any incentive to cheat:

• If the guests are a 2^k

  • Pour 2 cups at the begining
  • take those 2 cups and divide their quantity on other 2 cups
  • take those 4 cups and divide their quantity on other 4 cups
  • etc

• I think there exist ways to divide the cups in case of any number
  (There exist cases like having 2/3, but i dont think the problem is oriented this way...)

Or the pourer can have a device to measure how much water in each cup.