TY - GEN
T1 - How good is bargained routing?
AU - Blocq, Gideon
AU - Orda, Ariel
PY - 2012
Y1 - 2012
N2 - 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.
AB - 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.
UR - https://www.scopus.com/pages/publications/84861581403
U2 - 10.1109/INFCOM.2012.6195636
DO - 10.1109/INFCOM.2012.6195636
M3 - Conference contribution
SN - 9781467307758
T3 - Proceedings - IEEE INFOCOM
SP - 2453
EP - 2461
BT - 2012 Proceedings IEEE INFOCOM, INFOCOM 2012
T2 - IEEE Conference on Computer Communications, INFOCOM 2012
Y2 - 25 March 2012 through 30 March 2012
ER -