scientific article
From MaRDI portal
Publication:3524727
zbMath1152.91329MaRDI QIDQ3524727
Publication date: 12 September 2008
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (22)
The line planning routing game ⋮ Efficient coordination mechanisms for unrelated machine scheduling ⋮ Computational social choice for coordination in agent networks ⋮ Using inverse optimization to learn cost functions in generalized Nash games ⋮ A game-theoretic analysis of deep neural networks ⋮ Computing pure Nash and strong equilibria in bottleneck congestion games ⋮ The Value of Information in Selfish Routing ⋮ Smart routing of electric vehicles for load balancing in smart grids ⋮ An Online Learning Approach to a Multi-player N-armed Functional Bandit ⋮ Repeated congestion games with bounded rationality ⋮ Degrading network capacity may improve performance: private versus public monitoring in the Braess paradox ⋮ When is Selfish Routing Bad? The Price of Anarchy in Light and Heavy Traffic ⋮ Price of anarchy for highly congested routing games in parallel networks ⋮ Constraint games for stable and optimal allocation of demands in SDN ⋮ Competitive routing over time ⋮ Achieving target equilibria in network routing games without knowing the latency functions ⋮ The price of anarchy of affine congestion games with similar strategies ⋮ On the Price of Anarchy of Highly Congested Nonatomic Network Games ⋮ Delegation and ambiguity in correlated equilibrium ⋮ Selfishness Need Not Be Bad ⋮ Heuristic optimization for multi-depot vehicle routing problem in ATM network model ⋮ Online Learning of Nash Equilibria in Congestion Games
This page was built for publication:
