论文信息 - How to measure efficiency?

How to measure efficiency?

In the context of applied game theory in networking environments, a number of concepts have been proposed to measure both efficiency and optimality of resource allocations, the most famous certainly being the price of anarchy and the Jain index. Yet, very few have tried to question these measures and compare one to another, in a general framework, which is the aim of the present article.

Arnaud Legrand | Corinne Touati

[1] Raj Jain,et al. A Quantitative Measure Of Fairness And Discrimination For Resource Allocation In Shared Computer Systems , 1998, ArXiv.

[2] Hisao Kameda,et al. Bounds on Benefits and Harms of Adding Connections to Noncooperative Networks , 2004, NETWORKING.

[3] Michael F. Barnsley,et al. Fractals everywhere , 1988 .

[4] Mihalis Yannakakis,et al. On the approximability of trade-offs and optimal access of Web sources , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[5] Jean C. Walrand,et al. Fair end-to-end window-based congestion control , 2000, TNET.

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

[7] Arnaud Legrand,et al. Non-Cooperative Scheduling of Multiple Bag-of-Task Applications , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[8] Marcin Detyniecki,et al. Mathematical Aggregation Operators and their Application to Video Querying , 2000 .