  In a combinatorial exchange setting, players place sell (resp. buy) bids on
combinations of traded goods. Besides the question of finding an optimal
selection of winning bids, the question of how to share the obtained profit is
of high importance. The egalitarian allocation is a well-known solution concept
of profit sharing games which tries to distribute profit among players in a
most equal way while respecting individual contributions to the obtained
profit. Given a set of winning bids, we construct a special network graph and
show that every flow in said graph corresponds to a core payment. Furthermore,
we show that the egalitarian allocation can be characterized as an almost equal
maximum flow which is a maximum flow with the additional property that the
difference of flow value on given edge sets is bounded by a constant. With
this, we are able to compute the egalitarian allocation in polynomial time.
