Two-terminal routing games with unknown active players
type: Item
instance of: scholarly article
title: Two-terminal routing games with unknown active players
zbMATH Open document ID: 1195.91014
author: Itai Ashlagi
author: Dov Monderer
author: Moshe Tennenholtz
published in: Artificial Intelligence
publication date: 2009-12-21T00:00:00Z
Mathematics Subject Classification ID: 91A43
zbMATH DE Number: 5650768
zbMATH Keywords: routing games
zbMATH Keywords: ignorance
zbMATH Keywords: safety-level equilibrium
MaRDI profile type: Publication
full work available at URL: j.artint.2009.07.002
OpenAlex ID: W1975500573
cites work: Robust game theory
cites work: Q3056948
cites work: Q4633887
cites work: Competitive routing in networks with polynomial costs
cites work: Q3409969
cites work: The price of selfish routing
cites work: Congestion games with player-specific payoff functions
cites work: Potential games
cites work: Non-cooperative games
cites work: A class of games possessing pure-strategy Nash equilibria
cites work: How bad is selfish routing?
cites work: Potential games with continuous player sets
DOI: 10.1016/J.ARTINT.2009.07.002
description: scientific article; zbMATH DE number 5650768