Suppose you can make infinitely many copies of yourself. Each of them starts his/her life in a Hilberts Hotel, where each room is labeled by an element in the [free group](http://en.wikipedia.org/wiki/Free_group) with two generators, and structured as the Cayley graph of the group. (All the room have the same size, so in particular this hotel is not embedded in $\mathbb{R}^3$!) In the beginning, each clone have 1£. If they all cooperate, they can get richer exponentially fast: If they all give all their money to the neighbor in the direction of $e$, then everyone except the person in $e$ will receive money from three persons, so after n transactions he will have $3^n$£ (and $e$ will receive money from 4 persons, so he will be even richer). 


**Question:** Suppose instead that the rooms were unlabeled. You can decide on a strategy before being copied, and you are allowed to use randomness in this strategy. However, all the copies will be identical, so all of them will think that they are the original "you". Each of the copies can send money and information to each of their four neighbors once each day. Is there a strategy that will make each of them rich exponentially fast?


 **Comment:**  If only one of the copies thought he/she was the original you, you could solve the problem: The real you is consider to be $e$. The first day he/she tells his/her neighbors. The next day the neightbors send 2/3 of their money to $e$ and tell their neighbors that "the original you" is in this direction, and so on. With this strategy, each copy become rich exponentialy fast, although it will take some time ("distance to $e$" +3 days) before it starts. 


I originally asked the question on my blog, [here](http://sunejakobsen.wordpress.com/2011/09/24/economy-in-an-infinite-world/). 



How to get rich in a Hilberts Hotel?
No, you cannot get rich with identical copies on the unlabeled tree. This is a special case of the Mass Transport Principle - take a look at the book of [Lyons and Peres](http://mypage.iu.edu/~rdlyons/prbtree/prbtree.html), chapter 8.


