Source coding for a simple network

We consider the problem of source coding subject to a fidelity criterion for a simple network connecting a single source with two receivers via a common channel and two private channels. The region of attainable rates is formulated as an information-theoretic minimization. Several upper and lower bounds are developed and shown to actually yield a portion of the desired region in certain cases.