pith. sign in

arxiv: 1802.03669 · v1 · pith:AZF556OUnew · submitted 2018-02-11 · 💻 cs.GT · cs.SI

The Power Allocation Game on A Network: A Paradox

classification 💻 cs.GT cs.SI
keywords paradoxallocationgameadditionaldecreasenetworkpowertotal
0
0 comments X
read the original abstract

The well-known Braess paradox in congestion games states that adding an additional road to a transportation network may increase the total travel time, and consequently decrease the overall efficiency. Motivated by this, this paper presents a paradox in a similar spirit emerging from another distributed resource allocation game on networks, namely the power allocation game between countries developed in \cite{allocation}. The paradox is that by having additional friends may actually decrease a country's total welfare in equilibrium. Conditions for this paradox to occur as well as some price of anarchy results are also derived.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.