  We study a new class of games which generalizes congestion games and its
bottleneck variant. We introduce congestion games with mixed objectives to
model network scenarios in which players seek to optimize for latency and
bandwidths alike. We characterize the existence of pure Nash equilibria (PNE)
and the convergence of improvement dynamics. For games that do not possess PNE
we give bounds on the approximation ratio of approximate pure Nash equilibria.
