We investigate the convergence of the price of anarchy after a limited number of moves in the classical multicast communication game when the underlying communication networks is ...
— We study a priority service where users are free to choose the priority of their traffic, but are charged accordingly by the network. We assume that each user chooses prioriti...
—We consider the situation where N nodes share a common access point. With each node i there is an associated buffer and channel state that change in time. Node i dynamically cho...
Eitan Altaian, Konstantin Avrachenkov, Nicolas Bon...
: Players of epistemic games--computer games that simulate professional practica— have been shown to develop epistemic frames: a profession’s particular way of seeing and solvi...
We introduce the (private) entropy of a directed graph (in a new network coding sense) as well as a number of related concepts. We show that the entropy of a directed graph is ide...