TY - JOUR AB - We study a new class of games which generalizes congestion games andits bottleneck variant. We introduce congestion games with mixed objectives to modelnetwork scenarios in which players seek to optimize for latency and bandwidths alike.We characterize the (non-)existence of pure Nash equilibria (PNE), the convergenceof improvement dynamics, the quality of equilibria and show the complexity of thedecision problem. For games that do not possess PNE we give bounds on the approx-imation ratio of approximate pure Nash equilibria. AU - Feldotto, Matthias AU - Leder, Lennart AU - Skopalik, Alexander ID - 669 IS - 4 JF - Journal of Combinatorial Optimization SN - 1382-6905 TI - Congestion games with mixed objectives VL - 36 ER - TY - GEN AU - Kemper, Arne ID - 1186 TI - Pure Nash Equilibria in Robust Congestion Games via Potential Functions ER - TY - GEN AU - Nachtigall, Marcel ID - 1187 TI - Scenario-driven Strategy Analysis in a n-player Composition Game Model ER - TY - GEN AU - Kempf, Jérôme ID - 1188 TI - Learning deterministic bandit behaviour form compositions ER - TY - JOUR AB - In budget games, players compete over resources with finite budgets. For every resource, a player has a specific demand and as a strategy, he chooses a subset of resources. If the total demand on a resource does not exceed its budget, the utility of each player who chose that resource equals his demand. Otherwise, the budget is shared proportionally. In the general case, pure Nash equilibria (NE) do not exist for such games. In this paper, we consider the natural classes of singleton and matroid budget games with additional constraints and show that for each, pure NE can be guaranteed. In addition, we introduce a lexicographical potential function to prove that every matroid budget game has an approximate pure NE which depends on the largest ratio between the different demands of each individual player. AU - Drees, Maximilian AU - Feldotto, Matthias AU - Riechers, Sören AU - Skopalik, Alexander ID - 1369 JF - Journal of Combinatorial Optimization SN - 1382-6905 TI - Pure Nash equilibria in restricted budget games ER - 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 - TY - CONF AB - We study the computation of approximate pure Nash equilibria in Shapley value (SV) weighted congestion games, introduced in [19]. This class of games considers weighted congestion games in which Shapley values are used as an alternative (to proportional shares) for distributing the total cost of each resource among its users. We focus on the interesting subclass of such games with polynomial resource cost functions and present an algorithm that computes approximate pure Nash equilibria with a polynomial number of strategy updates. Since computing a single strategy update is hard, we apply sampling techniques which allow us to achieve polynomial running time. The algorithm builds on the algorithmic ideas of [7], however, to the best of our knowledge, this is the first algorithmic result on computation of approximate equilibria using other than proportional shares as player costs in this setting. We present a novel relation that approximates the Shapley value of a player by her proportional share and vice versa. As side results, we upper bound the approximate price of anarchy of such games and significantly improve the best known factor for computing approximate pure Nash equilibria in weighted congestion games of [7]. AU - Feldotto, Matthias AU - Gairing, Martin AU - Kotsialou, Grammateia AU - Skopalik, Alexander ID - 113 T2 - Proceedings of the 13th International Conference on Web and Internet Economics (WINE) TI - Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games ER - TY - CONF AU - Polevoy, Gleb AU - Trajanovski, Stojan AU - Grosso, Paola AU - de Laat, Cees ID - 17652 KW - flow KW - filter KW - MMSA KW - set cover KW - approximation KW - local ratio algorithm SN - 978-3-319-71150-8 T2 - Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I TI - Filtering Undesirable Flows in Networks ER - TY - CONF AU - Polevoy, Gleb AU - de Weerdt, M.M. ID - 17653 KW - interaction KW - reciprocation KW - contribute KW - shared effort KW - curbing KW - convergence KW - threshold KW - Nash equilibrium KW - social welfare KW - efficiency KW - price of anarchy KW - price of stability T2 - Proceedings of the 29th Benelux Conference on Artificial Intelligence TI - Reciprocation Effort Games ER - TY - CONF AU - Polevoy, Gleb AU - de Weerdt, M.M. ID - 17654 KW - agents KW - projects KW - contribute KW - shared effort game KW - competition KW - quota KW - threshold KW - Nash equilibrium KW - social welfare KW - efficiency KW - price of anarchy KW - price of stability T2 - Proceedings of the 29th Benelux Conference on Artificial Intelligence TI - Competition between Cooperative Projects ER -