We propose a single-valued solution that extends both the consistent Shapley value of Maschler and Owen (1989) and Raiffa's discrete bargaining solution to a large class of NTU games. Though not axiomatized, the solution is motivated via the Nash program. In this respect, we follow an approach that is similar to the one initiated by Hart and Mas-Collel (1996).