On the impact of combinatorial structure on congestion games
From MaRDI portal
Publication:3452191
DOI10.1145/1455248.1455249zbMATH Open1325.91010OpenAlexW1978317291MaRDI QIDQ3452191FDOQ3452191
Authors: Heiner Ackermann, Heiko Röglin, Berthold Vöcking 
Publication date: 11 November 2015
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1455248.1455249
Recommendations
Cited In (75)
- Nash equilibria in two-resource congestion games with player-specific payoff functions
- Settling the complexity of local max-cut (almost) completely
- Efficiency of equilibria in uniform matroid congestion games
- Generalizations of weighted matroid congestion games: pure Nash equilibrium, sensitivity analysis, and discrete convex function
- Cost-sharing games in real-time scheduling systems
- Project games
- Pure Nash equilibria in a generalization of congestion games allowing resource failures
- Pure Nash equilibria in a generalization of congestion games allowing resource failures
- Computing better approximate pure Nash equilibria in cut games via semidefinite programming
- On the impact of player capability on congestion games
- The price of anarchy in series-parallel network congestion games
- Malicious Bayesian Congestion Games
- Pure Nash Equilibria in Resource Graph Games
- Timed network games
- The impact of social ignorance on weighted congestion games
- On the impact of singleton strategies in congestion games
- Computation and efficiency of potential function minimizers of combinatorial congestion games
- Optimal matroid bases with intersection constraints: valuated matroids, M-convex functions, and their applications
- Uniqueness of equilibria in atomic splittable polymatroid congestion games
- Concurrent imitation dynamics in congestion games
- Efficient coordination mechanisms for unrelated machine scheduling
- Subgames within large games and the heuristic of imitation
- The complexity of welfare maximization in congestion games
- The Complexity of Necklace Splitting, Consensus-Halving, and Discrete Ham Sandwich
- Leadership in singleton congestion games: what is hard and what is easy
- Computing Nash equilibria for two-player restricted network congestion games is \(\mathcal{PLS}\)-complete
- Complexity and approximability of optimal resource allocation and Nash equilibrium over networks
- Convergence to approximate Nash equilibria in congestion games
- On best response dynamics in weighted congestion games with polynomial delays
- Congestion games viewed from M-convexity
- Computing Approximate Nash Equilibria in Network Congestion Games with Polynomially Decreasing Cost Functions
- Totally unimodular congestion games
- Timed network games
- Equilibrium computation in resource allocation games
- Computing pure Nash and strong equilibria in bottleneck congestion games
- Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy
- Decentralized beneficiary behavior in humanitarian supply chains: models, performance bounds, and coordination mechanisms
- Congestion games with capacitated resources
- Pure Nash equilibria in player-specific and weighted congestion games
- Best-response dynamics in combinatorial auctions with item bidding
- Complexity and optimality of the best response algorithm in random potential games
- Management of Variable Data Streams in Networks
- Congestion games with linearly independent paths: convergence time and price of anarchy
- Computing Approximate Nash Equilibria in Network Congestion Games
- Capacitated network design games
- Congestion games with mixed objectives
- Resource buying games
- Cost-sharing games in real-time scheduling systems
- Uniqueness of equilibria in atomic splittable polymatroid congestion games
- A selective tour through congestion games
- On the performance of mildly greedy players in cut games
- Congestion games with complementarities
- Coordination games on weighted directed graphs
- The complexity of pure equilibria in mix-weighted congestion games on parallel links
- Dynamics of Profit-Sharing Games
- Convergence to equilibria in distributed, selfish reallocation processes with weighted tasks
- Performance of one-round walks in linear congestion games
- Competitive routing over time
- Combinatorial optimization with interaction costs: complexity and solvable cases
- Price of anarchy and an approximation algorithm for the binary-preference capacitated selfish replication game
- The price of stability of weighted congestion games
- The price of stability of weighted congestion games
- On the complexity of Pareto-optimal Nash and strong equilibria
- On the complexity of Pareto-optimal Nash and strong equilibria
- Greediness and equilibrium in congestion games
- Stability vs. optimality in selfish ring routing
- Network movement games
- Approximate Nash equilibria in anonymous games
- Equilibria in Multiclass and Multidimensional Atomic Congestion Games
- Computing equilibria: a computational complexity perspective
- Dynamics in network interaction games
- A logarithmic approximation for polymatroid congestion games
- Congestion Games with Mixed Objectives
- Computing approximate equilibria in weighted congestion games via best-responses
- Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions
This page was built for publication: On the impact of combinatorial structure on congestion games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3452191)
