Random Order Congestion Games

DOI10.1287/moor.1090.0394zbMath1232.91021OpenAlexW2162904451MaRDI QIDQ3169062

Maria Polukarov, Michal Penn, Moshe Tennenholtz

Publication date: 27 April 2011

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://eprints.soton.ac.uk/267884/1/ROCG_MOR_final_16Mar2009.pdf

zbMATH Keywords

algorithmscongestion gamesasynchronous distributed systemspure strategy Nash equilibriumrandom order of task execution

Mathematics Subject Classification ID

Noncooperative games (91A10) Applications of game theory (91A80) (n)-person games, (n>2) (91A06)

Related Items (8)

Pure Nash equilibria in a generalization of congestion games allowing resource failures ⋮ Unnamed Item ⋮ Exploration costs as a means for improving performance in multiagent systems ⋮ Joint search with self-interested agents and the failure of cooperation enhancers ⋮ Pure Nash equilibria in a generalization of congestion games allowing resource failures ⋮ Unnamed Item ⋮ Non-blind strategies in timed network congestion games ⋮ Timed network games

This page was built for publication: Random Order Congestion Games