On the impact of combinatorial structure on congestion games
From MaRDI portal
Publication:3452191
DOI10.1145/1455248.1455249zbMath1325.91010OpenAlexW1978317291MaRDI QIDQ3452191
Berthold Vöcking, Heiko Röglin, Heiner Ackermann
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
Related Items (69)
Congestion Games with Complementarities ⋮ On the Complexity of Pareto-optimal Nash and Strong Equilibria ⋮ Concurrent imitation dynamics in congestion games ⋮ Uniqueness of equilibria in atomic splittable polymatroid congestion games ⋮ Congestion games with mixed objectives ⋮ Efficient coordination mechanisms for unrelated machine scheduling ⋮ Computing equilibria: a computational complexity perspective ⋮ Equilibrium computation in resource allocation games ⋮ Computing Approximate Nash Equilibria in Network Congestion Games with Polynomially Decreasing Cost Functions ⋮ A Selective Tour Through Congestion Games ⋮ Best-response dynamics in combinatorial auctions with item bidding ⋮ On the performance of mildly greedy players in cut games ⋮ Computing Approximate Equilibria in Weighted Congestion Games via Best-Responses ⋮ Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions ⋮ Coordination Games on Weighted Directed Graphs ⋮ On the complexity of Pareto-optimal Nash and strong equilibria ⋮ Computing pure Nash and strong equilibria in bottleneck congestion games ⋮ Pure Nash equilibria in a generalization of congestion games allowing resource failures ⋮ Dynamics in network interaction games ⋮ On the impact of player capability on congestion games ⋮ The price of anarchy in series-parallel network congestion games ⋮ Congestion Games with Mixed Objectives ⋮ Computing Approximate Nash Equilibria in Network Congestion Games ⋮ Convergence to equilibria in distributed, selfish reallocation processes with weighted tasks ⋮ Capacitated network design games ⋮ Congestion games with capacitated resources ⋮ Convergence to approximate Nash equilibria in congestion games ⋮ A logarithmic approximation for polymatroid congestion games ⋮ Performance of one-round walks in linear congestion games ⋮ Greediness and equilibrium in congestion games ⋮ Stability vs. optimality in selfish ring routing ⋮ On best response dynamics in weighted congestion games with polynomial delays ⋮ Resource buying games ⋮ Computation and efficiency of potential function minimizers of combinatorial congestion games ⋮ The complexity of pure equilibria in mix-weighted congestion games on parallel links ⋮ Price of anarchy and an approximation algorithm for the binary-preference capacitated selfish replication game ⋮ Settling the Complexity of Local Max-Cut (Almost) Completely ⋮ Network movement games ⋮ COMPUTING NASH EQUILIBRIA FOR TWO-PLAYER RESTRICTED NETWORK CONGESTION GAMES IS $\mathcal{PLS}$-COMPLETE ⋮ Approximate Nash equilibria in anonymous games ⋮ The impact of social ignorance on weighted congestion games ⋮ Combinatorial optimization with interaction costs: complexity and solvable cases ⋮ Subgames within large games and the heuristic of imitation ⋮ Congestion games with linearly independent paths: convergence time and price of anarchy ⋮ Competitive routing over time ⋮ Malicious Bayesian Congestion Games ⋮ Congestion games viewed from M-convexity ⋮ Pure Nash equilibria in a generalization of congestion games allowing resource failures ⋮ Decentralized beneficiary behavior in humanitarian supply chains: models, performance bounds, and coordination mechanisms ⋮ Leadership in singleton congestion games: what is hard and what is easy ⋮ Optimal matroid bases with intersection constraints: valuated matroids, M-convex functions, and their applications ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Cost-sharing games in real-time scheduling systems ⋮ 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 ⋮ Complexity and Optimality of the Best Response Algorithm in Random Potential Games ⋮ Efficiency of Equilibria in Uniform Matroid Congestion Games ⋮ Management of Variable Data Streams in Networks ⋮ Dynamics of Profit-Sharing Games ⋮ Uniqueness of Equilibria in Atomic Splittable Polymatroid Congestion Games ⋮ The Price of Stability of Weighted Congestion Games ⋮ Complexity and Approximability of Optimal Resource Allocation and Nash Equilibrium over Networks ⋮ The Price of Stability of Weighted Congestion Games ⋮ The Complexity of Necklace Splitting, Consensus-Halving, and Discrete Ham Sandwich ⋮ Equilibria in Multiclass and Multidimensional Atomic Congestion Games ⋮ Timed network games ⋮ Pure Nash Equilibria in Resource Graph Games
This page was built for publication: On the impact of combinatorial structure on congestion games
