This paper presents protocols and strategies for coalition formation with incomplete information under time constraints. It focuses on strategies for coalition members to distribute revenues amongst themselves. Such strategies should preferably be stable, lead to a fair distribution, and maximize the social welfare of the agents. These properties are only partially supported by existing coalition formation mechanisms. In particular, stability and the maximization of social welfare are supported only in the case of complete information, and only at a high computational complexity. Recent studies on coalition formation with incomplete and uncertain information address revenue distribution in a naïve manner. In this study we specifically refer to environments with limited computational resources and incomplete information. We propose a variety of strategies for revenue distribution, including the strategy in which the agents attempt to distribute the estimated net value of a coalition e...