scientific article

zbMath1231.68146MaRDI QIDQ3549719

Alexander Skopalik, Berthold Vöcking

Publication date: 5 January 2009

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Noncooperative games (91A10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (32)

Congestion Games with Complementarities ⋮ Concurrent imitation dynamics in congestion games ⋮ Congestion games with mixed objectives ⋮ On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games ⋮ 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 ⋮ Computing approximate Nash equilibria in network congestion games ⋮ Generalized mirror descents in congestion games ⋮ 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 ⋮ Computing pure Nash and strong equilibria in bottleneck congestion games ⋮ The quality of equilibria for set packing and throughput scheduling games ⋮ \(\mathcal{NP}\)-hardness of pure Nash equilibrium in scheduling and network design games ⋮ Congestion Games with Mixed Objectives ⋮ Computing Approximate Nash Equilibria in Network Congestion Games ⋮ Convergence to approximate Nash equilibria in congestion games ⋮ On the performance of approximate equilibria in congestion games ⋮ Convergence and approximation in potential games ⋮ A logarithmic approximation for polymatroid congestion games ⋮ Performance of one-round walks in linear congestion games ⋮ Equilibria, fixed points, and complexity classes ⋮ On best response dynamics in weighted congestion games with polynomial delays ⋮ Short sequences of improvement moves lead to approximate equilibria in constraint satisfaction games ⋮ The impact of social ignorance on weighted congestion games ⋮ Competitive routing over time ⋮ Dynamic resource allocation games ⋮ Fast Convergence of Best-Reply Dynamics in Aggregative Games ⋮ Dynamic Resource Allocation Games ⋮ Dynamics of Profit-Sharing Games

This page was built for publication: