Browsing by Subject "Non-zero probability"
Now showing items 1-3 of 3
(2009)Given an arbitrary network of interconnected nodes, each with an initial value from a discrete set, we consider the problem of distributively disseminating these initial values under the constraint that the nodes can only ...
(2004)We study Nash equilibria in a discrete routing game that combines features of the two most famous models for non-cooperative routing, the KP model  and the Wardrop model . In our model, users share parallel links. ...
(2008)In a discrete routing game, each of n selfish users employs a mixed strategy to ship her (unsplittable) traffic over m parallel links. The (expected) latency on a link is determined by an arbitrary non-decreasing, non-constant ...