The Equilibrium Existence Problem in Finite Network Congestion Games

First Page		Document Content
Date: 2016-07-12 04:58:24 Game theory Mathematics Congestion game John Glen Wardrop Price of anarchy Nash equilibrium Potential game Best response Traffic flow Network congestion Science and technology Human behavior		The Equilibrium Existence Problem in Finite Network Congestion Games Add to Reading List Source URL: faculty.biu.ac.il Download Document from Source Website File Size: 202,54 KB Share Document on Facebook

	Regret Minimization and the Price of Total Anarchy ∗ Avrim Blum Carnegie Mellon Pittsburgh, PA DocID: 1v6rv - View Document
	CS364A: Algorithmic Game Theory Lecture #11: Selfish Routing and the Price of Anarchy∗ Tim Roughgarden† October 28, DocID: 1tEMj - View Document
	CS364A: Algorithmic Game Theory Lecture #14: Robust Price-of-Anarchy Bounds in Smooth Games∗ Tim Roughgarden† November 6, 2013 DocID: 1tEef - View Document
	X Weighted Congestion Games: The Price of Anarchy, Universal Worst-Case Examples, and Tightness KSHIPRA BHAWALKAR, Stanford University, Stanford, CA, USA MARTIN GAIRING, University of Liverpool, Liverpool, U.K. TIM ROUGH DocID: 1sIRI - View Document
	Algorithms as Mechanisms: The Price of Anarchy of Relax-and-Round ¨ PAUL DUTTING , London School of Economics ¨ Informatik THOMAS KESSELHEIM, Max-Planck-Institut fur DocID: 1sAl2 - View Document