4 papers
Entropy Bounds for Local Coordination and Graph Amenability
Ron Peretz, Dean Kraizberg
We study local pure coordination games on finite graphs. In these games, each vertex must choose one of two symmetric actions using only local information, and the cost is the aver…
Dynamic Averaging on Regular Graphs
Dean Kraizberg
We study a dynamic averaging process on finite regular graphs with bounded, time-varying load arrivals. At each discrete time , an edge is chosen uniformly at random, a load $0\…
A Weak Structural Form of Commutative Equivalence in Finite Codes
Dean Kraizberg
We investigate the structural relationship between prefix-free codes over the binary alphabet and a class of unlabeled rooted trees, which we call \emph{symmetric} trees. We establ…
Winning Criteria for Open Games: A Game-Theoretic Approach to Prefix Codes
Dean Kraizberg
We study two-player games with alternating moves played on infinite trees. Our main focus is on the case where the trees are full (regular) and the winning set is open (with respec…