8 citations · 8 across the 4 of their papers we have counts for
4 papers
The information-theoretic complexity of differentiable functions
Matthijs Ruijgrok
A measure for the complexity of a differentiable function f(x) on an interval is introduced. It is based on approximations of the function by piecewise constant functions. The meas…
A critique of the Mean Field Approximation in preferential attachment networks
Matthijs Ruijgrok
The Mean Field Approximation (MFA), or continuum method, is often used in courses on Networks to derive the degree distribution of preferential attachment networks. This method is…
A single-item continuous double auction game
Matthijs Ruijgrok
A double auction game with an infinite number of buyers and sellers is introduced. All sellers posses one unit of a good, all buyers desire to buy one unit. Each seller and each bu…
Replicator dynamics with mutations for games with a continuous strategy space
M. Ruijgrok, T. W. Ruijgrok
A partial differential equation is derived, describing the replicator dynamics with mutations of games with a continuous strategy space. This equation is then applied to continuous…