How to measure efficiency?

Authors:
Arnaud Legrand;Corinne Touati
Affiliations:
CNRS-INRIA, LIG laboratory, MESCAL project, Grenoble, France;CNRS-INRIA, LIG laboratory, MESCAL project, Grenoble, France
Venue:
Proceedings of the 2nd international conference on Performance evaluation methodologies and tools
Year:
2007

Citing 5
Cited 0

Fractals everywhere

Fractals everywhere
Fair end-to-end window-based congestion control

IEEE/ACM Transactions on Networking (TON)
On the approximability of trade-offs and optimal access of Web sources

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Generalized nash bargaining solution for bandwidth allocation

Computer Networks: The International Journal of Computer and Telecommunications Networking
Worst-case equilibria

STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.