TY - CONF AB - We study a model of selfish resource allocation that seeks to incorporate dependencies among resources as they exist in in modern networked environments. Our model is inspired by utility functions with constant elasticity of substitution (CES) which is a well-studied model in economics. We consider congestion games with different aggregation functions. In particular, we study $L_p$ norms and analyze the existence and complexity of (approximate) pure Nash equilibria. Additionally, we give an almost tight characterization based on monotonicity properties to describe the set of aggregation functions that guarantee the existence of pure Nash equilibria. AU - Feldotto, Matthias AU - Leder, Lennart AU - Skopalik, Alexander ID - 112 T2 - Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC) TI - Congestion Games with Complementarities ER -