We are interested in how cooperation can arise in types of environments, such as open systems, where little or nothing is known about the other agents. We view the negotiation problem as a strategic and communication rich process between different local preference/decision models. This contrasts with the classical cooperative game theoretic (axiomatic) view of negotiation process as a centralized and linear optimization problem. Although unconcerned with the processes of negotiation, such axiomatic models of negotiation (in particular those of mechanism design tradition) has assumed optimality can be achieved through design of normative roles of interactions that incents agents to act rationally (Neumann and Morgemstern 194.4),(Rosenschein and Zlotkin 1994),(Binmore 1990),(Shehory and Kraus 1995),(Sandholm 1999). Likewise, in eration research the focus is the design of optimal solution algorithms based on mathematical programming techniques (Kraus 1997),(Ehtamo, Ketteunen, and Hamalainen 2001),(Heiskanen 1999),(Teich et al. 1996). In both cases optimality is achieved because: a) the geometry of the solution set is assumed to be described by a closed and convex set (therefore there is a bounded number of solution points), b) the objective functions of the individuals (the utility function) are concave and differentiable and c) some global information (such as the actual utility of the agents or the utility gradient increase vector (Ehtamo, Ketteunen, and Hamalainen 2001)) is stored by a (hypothetical) centralized mediator that (incents) acts to direct problem solvers towards pareto-optimality. However, although analytically elegant, such optimality can not be guaranteed in decentralized autonomous agent systems operating in open environments where information is sparse. Indeed, lack of information or knowledge oftenteads to inefficiencies and suboptimality in the negotiated outcome.