Time Average Replicator and Best-Reply Dynamics
Mathematics of Operations Research
Accelerating population-based search heuristics by adaptive resource allocation
Proceedings of the 15th annual conference on Genetic and evolutionary computation
| Hi-index | 0.00 |
The exponential weight algorithm has been introduced in the framework of discrete time on-line problems. Given an observed process $$\{X_m\}_{m=1,2,\ldots}$$ the input at stage m + 1 is an exponential function of the sum $$S_m = \sum_{\ell = 1}^m X_{\ell}$$. We define the analog algorithm for a continuous time process X t and prove similar properties in terms of external or internal consistency. We then deduce results for discrete time from their counterpart in continuous time. Finally we compare this approach to another continuous time approximation of a discrete time exponential algorithm based on the average sum S m /m.