@inproceedings{ddd5dbcdc3be4ca6801b25e09f8e5dc5,
title = "How good is bargained routing?",
abstract = "Game theoretic models have been widely employed in many networking contexts. Research to date has mainly focused on non-cooperative networking games, where the selfish agents cannot reach a binding agreement on the way they would share the network infrastructure and the operating points are the Nash equilibria. These are typically inefficient, as manifested by large values of the Price of Anarchy (PoA). Many approaches have been proposed for mitigating this problem, however under the standing assumption of a non-cooperative game.",
author = "Gideon Blocq and Ariel Orda",
year = "2012",
doi = "10.1109/INFCOM.2012.6195636",
language = "الإنجليزيّة",
isbn = "9781467307758",
series = "Proceedings - IEEE INFOCOM",
pages = "2453--2461",
booktitle = "2012 Proceedings IEEE INFOCOM, INFOCOM 2012",
note = "IEEE Conference on Computer Communications, INFOCOM 2012 ; Conference date: 25-03-2012 Through 30-03-2012",
}