Weakly-acyclic (internet) routing games
type: Item
instance of: scholarly article
title: Weakly-acyclic (internet) routing games
zbMATH Open document ID: 1380.91032
author: Roee Engelberg
author: Michael Schapira
published in: Theory of Computing Systems
publication date: 2017-11-07T00:00:00Z
Mathematics Subject Classification ID: 91A43
Mathematics Subject Classification ID: 68M11
zbMATH DE Number: 6803514
zbMATH Keywords: weakly-acyclic games
zbMATH Keywords: routing games
zbMATH Keywords: convergence to Nash equilibrium
zbMATH Keywords: best-response dynamics
MaRDI profile type: Publication
full work available at URL: s00224-013-9474-z
OpenAlex ID: W2181112974
cites work: A Classification of Weakly Acyclic Games
cites work: Fault Tolerant Implementation
cites work: On the structure of weakly acyclic games
cites work: Q3579412
cites work: Learning in games by random sampling
cites work: Improvement dynamics in games with strategic complementarities
cites work: Q3549685
cites work: Payoff-Based Dynamics for Multiplayer Weakly Acyclic Games
cites work: Congestion games with player-specific payoff functions
cites work: Potential games
cites work: A class of games possessing pure-strategy Nash equilibria
cites work: On the Existence of Pure Strategy Nash Equilibria in Integer–Splittable Weighted Congestion Games
cites work: The Evolution of Conventions
DOI: 10.1007/S00224-013-9474-Z
Recommended article: Weakly-Acyclic (Internet) Routing Games
Recommended article: Q4630386
Recommended article: On the core of routing games
Recommended article: Efficient graph topologies in network routing games
Recommended article: Interdomain Routing and Games
Recommended article: Two-terminal routing games with unknown active players
Recommended article: A Game-Theoretic Approach to Routing under Adversarial Conditions
Recommended article: Robust bottleneck routing games
Recommended article: On the structure of weakly acyclic games
description: scientific article; zbMATH DE number 6803514