Four friends are playing a game. They have a pool of 100 dollars. Let's say that they have a unit square, with the corners located at (0,0),(1,0), (1,1), and (0, 1). Each player would sequentially take turn marking a point on the unit square. After the 4 markers are placed, the square is divided into 4 region, each centered at one of the markers. The rule for region division is that if any point on the square has the smallest distance to marker i, then it belongs to marker i. Apply that to the infinite number of points consisting the square, and you have the area associated with each marker. At this stage, each player wins an amount of the $100 that is proportional to their polygon's area. For instance, if player A mark a point so that he has 50% of the area, he wins $50 bucks. The remaining money are divided proportionally between the other 3.
Here is an example.
Here, there are four point marked on the square, and the square is divided into 4 regions by the rule defined above. Note that boundaries between any two regions are actually lines that are equidistant from the two marked locations. The pink point has the largest area (about 35%), so the player who placed that point wins about $35.
1) Suppose that you are playing this game, and you have to go first. Where would you mark your point? Assume your opponents will each try to maximize their winnings, with no collusion between any two party.
2) suppose that you are playing this game, and you're offered the choice to go first, second, third, or last, which would you pick to ensure the highest expected winning? Assume your opponents will each try to maximize their winnings, with no collusion between any two party.
Question
bushindo
Four friends are playing a game. They have a pool of 100 dollars. Let's say that they have a unit square, with the corners located at (0,0),(1,0), (1,1), and (0, 1). Each player would sequentially take turn marking a point on the unit square. After the 4 markers are placed, the square is divided into 4 region, each centered at one of the markers. The rule for region division is that if any point on the square has the smallest distance to marker i, then it belongs to marker i. Apply that to the infinite number of points consisting the square, and you have the area associated with each marker. At this stage, each player wins an amount of the $100 that is proportional to their polygon's area. For instance, if player A mark a point so that he has 50% of the area, he wins $50 bucks. The remaining money are divided proportionally between the other 3.
Here is an example.
Here, there are four point marked on the square, and the square is divided into 4 regions by the rule defined above. Note that boundaries between any two regions are actually lines that are equidistant from the two marked locations. The pink point has the largest area (about 35%), so the player who placed that point wins about $35.
1) Suppose that you are playing this game, and you have to go first. Where would you mark your point? Assume your opponents will each try to maximize their winnings, with no collusion between any two party.
2) suppose that you are playing this game, and you're offered the choice to go first, second, third, or last, which would you pick to ensure the highest expected winning? Assume your opponents will each try to maximize their winnings, with no collusion between any two party.
Edited by bushindoLink to comment
Share on other sites
7 answers to this question
Recommended Posts
Join the conversation
You can post now and register later. If you have an account, sign in now to post with your account.