882 research outputs found
A Deterministic Polynomial--Time Algorithm for Constructing a Multicast Coding Scheme for Linear Deterministic Relay Networks
We propose a new way to construct a multicast coding scheme for linear
deterministic relay networks. Our construction can be regarded as a
generalization of the well-known multicast network coding scheme of Jaggi et
al. to linear deterministic relay networks and is based on the notion of flow
for a unicast session that was introduced by the authors in earlier work. We
present randomized and deterministic polynomial--time versions of our algorithm
and show that for a network with destinations, our deterministic algorithm
can achieve the capacity in uses of the
network.Comment: 12 pages, 2 figures, submitted to CISS 201
Robustness of Dynamics in Games: A Contraction Mapping Decomposition Approach
A systematic framework for analyzing dynamical attributes of games has not
been well-studied except for the special class of potential or near-potential
games. In particular, the existing results have shortcomings in determining the
asymptotic behavior of a given dynamic in a designated game. Although there is
a large body literature on developing convergent dynamics to the Nash
equilibrium (NE) of a game, in general, the asymptotic behavior of an
underlying dynamic may not be even close to a NE. In this paper, we initiate a
new direction towards game dynamics by studying the fundamental properties of
the map of dynamics in games. To this aim, we first decompose the map of a
given dynamic into contractive and non-contractive parts and then explore the
asymptotic behavior of those dynamics using the proximity of such decomposition
to contraction mappings. In particular, we analyze the non-contractive behavior
for better/best response dynamics in discrete-action space sequential/repeated
games and show that the non-contractive part of those dynamics is well-behaved
in a certain sense. That allows us to estimate the asymptotic behavior of such
dynamics using a neighborhood around the fixed point of their contractive part
proxy. Finally, we demonstrate the practicality of our framework via an example
from duopoly Cournot games
- …