1![Regret Minimization and the Price of Total Anarchy ∗ Avrim Blum Carnegie Mellon Pittsburgh, PA Regret Minimization and the Price of Total Anarchy ∗ Avrim Blum Carnegie Mellon Pittsburgh, PA](https://www.pdfsearch.io/img/b0efcde90de39e567e61c9931e12feef.jpg) | Add to Reading ListSource URL: rsrg.cms.caltech.eduLanguage: English - Date: 2012-12-13 13:02:19
|
---|
2![CS364A: Algorithmic Game Theory Lecture #11: Selfish Routing and the Price of Anarchy∗ Tim Roughgarden† October 28, CS364A: Algorithmic Game Theory Lecture #11: Selfish Routing and the Price of Anarchy∗ Tim Roughgarden† October 28,](https://www.pdfsearch.io/img/4797c938572eaf4ee5e7c7c09f908e45.jpg) | Add to Reading ListSource URL: theory.stanford.edu- Date: 2016-08-30 19:03:35
|
---|
3![CS364A: Algorithmic Game Theory Lecture #14: Robust Price-of-Anarchy Bounds in Smooth Games∗ Tim Roughgarden† November 6, 2013 CS364A: Algorithmic Game Theory Lecture #14: Robust Price-of-Anarchy Bounds in Smooth Games∗ Tim Roughgarden† November 6, 2013](https://www.pdfsearch.io/img/48a6589585e271b58aebc369d90fc4d2.jpg) | Add to Reading ListSource URL: theory.stanford.edu- Date: 2016-08-30 19:05:12
|
---|
4![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 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](https://www.pdfsearch.io/img/223c83d4dd07a6682936359936006af6.jpg) | Add to Reading ListSource URL: theory.stanford.edu- Date: 2014-06-22 18:15:40
|
---|
5![Algorithms as Mechanisms: The Price of Anarchy of Relax-and-Round ¨ PAUL DUTTING , London School of Economics ¨ Informatik THOMAS KESSELHEIM, Max-Planck-Institut fur Algorithms as Mechanisms: The Price of Anarchy of Relax-and-Round ¨ PAUL DUTTING , London School of Economics ¨ Informatik THOMAS KESSELHEIM, Max-Planck-Institut fur](https://www.pdfsearch.io/img/859422e790b724b2dbcdfbb5aa2dc2e6.jpg) | Add to Reading ListSource URL: paulduetting.com- Date: 2015-06-17 14:01:56
|
---|
6![The Price of Anarchy in an Exponential Multi-Server∗ Moshe Haviv† Tim Roughgarden‡ Abstract The Price of Anarchy in an Exponential Multi-Server∗ Moshe Haviv† Tim Roughgarden‡ Abstract](https://www.pdfsearch.io/img/83ec417bc117ba50bcf685f61864a22d.jpg) | Add to Reading ListSource URL: theory.stanford.edu- Date: 2006-09-14 00:31:08
|
---|
7![CS364A: Algorithmic Game Theory Lecture #14: Robust Price-of-Anarchy Bounds in Smooth Games∗ Tim Roughgarden† November 6, 2013 CS364A: Algorithmic Game Theory Lecture #14: Robust Price-of-Anarchy Bounds in Smooth Games∗ Tim Roughgarden† November 6, 2013](https://www.pdfsearch.io/img/a495cb22e2baa940941f74ca37766cb8.jpg) | Add to Reading ListSource URL: theory.stanford.eduLanguage: English - Date: 2015-09-22 16:38:00
|
---|
8![Decision, Risk & Operations Working Papers Series A Mean-Risk Model for the Stochastic Traffic Assignment Problem E. Nikolova and N.E. Stier-Moses Decision, Risk & Operations Working Papers Series A Mean-Risk Model for the Stochastic Traffic Assignment Problem E. Nikolova and N.E. Stier-Moses](https://www.pdfsearch.io/img/940dbc6b752a5ed64438ba0712b75f38.jpg) | Add to Reading ListSource URL: faculty.cse.tamu.eduLanguage: English - Date: 2012-01-14 18:55:06
|
---|
9![Algorithms and Data Structures Winter TermExercises for UnitShow that the price of anarchy for routing games with quadratic latency functions `e (x) = x2 is at most Algorithms and Data Structures Winter TermExercises for UnitShow that the price of anarchy for routing games with quadratic latency functions `e (x) = x2 is at most](https://www.pdfsearch.io/img/b004de5e61a39bea22b84cf7042f1f42.jpg) | Add to Reading ListSource URL: www-tcs.cs.uni-sb.deLanguage: English - Date: 2016-03-29 17:40:19
|
---|
10![CS364A: Algorithmic Game Theory Lecture #15: Best-Case and Strong Nash Equilibria∗ Tim Roughgarden† November 11, CS364A: Algorithmic Game Theory Lecture #15: Best-Case and Strong Nash Equilibria∗ Tim Roughgarden† November 11,](https://www.pdfsearch.io/img/ba36c30f6f64518eb94afbe18ed95f80.jpg) | Add to Reading ListSource URL: theory.stanford.eduLanguage: English - Date: 2015-06-11 10:32:09
|
---|