Random order congestion games

DOI10.1287/MOOR.1090.0394zbMATH Open1232.91021OpenAlexW2162904451MaRDI QIDQ3169062FDOQ3169062

Authors: Michal Penn, Maria Polukarov, 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

Recommendations

• Asynchronous congestion games
• Games with congestion-averse utilities
• Atomic congestion games with random players: network equilibrium and the price of anarchy
• Congestion games with load-dependent failures: Identical resources
• Congestion games with capacitated resources

zbMATH Keywords

algorithmsasynchronous distributed systemscongestion gamespure strategy Nash equilibriumrandom order of task execution

Mathematics Subject Classification ID

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

Cited In (9)

• Non-blind strategies in timed network congestion games
• Timed network games
• Exploration costs as a means for improving performance in multiagent systems
• Asynchronous congestion games
• Joint search with self-interested agents and the failure of cooperation enhancers
• Pure Nash equilibria in a generalization of congestion games allowing resource failures
• Pure Nash equilibria in a generalization of congestion games allowing resource failures
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: Random order congestion games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3169062)