7 This paper presents a new algorithm that can be used to compute an approximation to the median of a set of strings. The approximate median is obtained through the successive improvements of a partial solution. The edit distance from the partial solution to all the strings in the set is computed in each iteration, thus accounting for the frequency of each of the edit operations in all the posi...

We address the problem of solving complex Bayesian games, characterized by high-dimensional type and action spaces, many (> 2) players, general-sum payoffs. Our approach applies to symmetric one-shot with no given analytic structure. represent agent strategies in parametric form as neural networks, apply natural evolution (NES) [wierstra2014natural] for deep model optimization. For pure equi...