论文信息 - Price of Anarchy for Machines Models - 字舞流文

Price of Anarchy for Machines Models

Berthold Vöcking | Artur Czumaj | A. Czumaj | Berthold Vöcking

[1] Berthold Vöcking. Algorithmic Game Theory: Selfish Load Balancing , 2007 .

[2] Yossi Azar,et al. Tradeoffs in worst-case equilibria , 2003, Theor. Comput. Sci..

[3] Berthold Vöcking,et al. On the structure and complexity of worst-case equilibria , 2007, Theor. Comput. Sci..

[4] Elias Koutsoupias,et al. Coordination mechanisms , 2009, Theor. Comput. Sci..

[5] Marios Mavronicolas,et al. The price of anarchy for polynomial social cost , 2004, Theor. Comput. Sci..

[6] Joseph Y.-T. Leung,et al. Handbook of Scheduling: Algorithms, Models, and Performance Analysis , 2004 .

[7] Artur Czumaj. Selfish Routing on the Internet , 2004, Handbook of Scheduling.

[8] Paul G. Spirakis,et al. Approximate Equilibria and Ball Fusion , 2003, Theory of Computing Systems.

[9] Paul G. Spirakis,et al. The structure and complexity of Nash equilibria for a selfish routing game , 2002, Theor. Comput. Sci..

[10] Berthold Vöcking,et al. Tight bounds for worst-case equilibria , 2002, SODA '02.

[11] Paul G. Spirakis,et al. The Price of Selfish Routing , 2001, STOC '01.

[12] Christos H. Papadimitriou,et al. Worst-case Equilibria , 1999, STACS.

[13] Gaston H. Gonnet,et al. Expected Length of the Longest Probe Sequence in Hash Code Searching , 1981, JACM.