Search Results - subject:"computation"

Did you mean: subject:"competition" (132,564 results)

Using Simulated Annealing to Compute the Trembles of Trembling Hand Perfection

McDonald, Stuart - Society for Computational Economics - SCE - 2002

Persistent link: https://www.econbiz.de/10005345388

fiscal policy and endogenous fluctuations

senesi, pietro - Society for Computational Economics - SCE - 2002

Persistent link: https://www.econbiz.de/10005345394

Chapter 45 Computing equilibria for two-person games

Von Stengel, Bernhard - In: Handbook of game theory with economic applications : …, (pp. 1723-1759). 2002

. Algorithms for computing simply stable equilibria and perfect equilibria are explained. The computation of equilibria for … suitable for computation. In the sequence form, pure strategies of a player are replaced by sequences of choices along a play …

Persistent link: https://www.econbiz.de/10014024500

symposium articles: A differentiable homotopy to compute Nash equilibria of n -person games

Herings, P. Jean-Jacques; Peeters, Ronald J.A.P. - In: Economic Theory 18 (2001) 1, pp. 159-185

The literature on the computation of Nash equilibria in n-person games is dominated by simplicial methods. This paper …

Persistent link: https://www.econbiz.de/10005371106

Parallel dynamics and computational complexity of the Bak–Sneppen model

Machta, J.; Li, X.-N. - In: Physica A: Statistical Mechanics and its Applications 300 (2001) 1, pp. 245-270

The parallel computational complexity of the Bak–Sneppen evolution model is studied. It is shown that Bak–Sneppen histories can be generated by a massively parallel computer in a time that is polylogarithmic in the length of the history. In this parallel dynamics, histories are built up via...

Persistent link: https://www.econbiz.de/10010871836

Symplectic computation of solitary waves for general Sine–Gordon equations

Lu, Xiaowu - In: Mathematics and Computers in Simulation (MATCOM) 55 (2001) 4, pp. 519-532

We present a class of symplectic schemes for the computation of solutions of the general Sine–Gordon systems. These …

Persistent link: https://www.econbiz.de/10011050658

An improved method to estimate the fractal dimension of physical fractals based on the Hausdorff definition

Martı́nez-López, F.; Cabrerizo-Vı́lchez, M.A.; … - In: Physica A: Statistical Mechanics and its Applications 298 (2001) 3, pp. 387-399

In this paper we present an algorithm to estimate the Hausdorff fractal dimension. The algorithm uses a recursive formula with a fast enough convergence. The accuracy of results is independent on the size, i.e., degree of definition of the fractal set. This fact is particularly useful when...

Persistent link: https://www.econbiz.de/10011061585

Large matrix–vector products on distributed bus networks with communication delays using the divisible load paradigm: performance analysis and simulation

Chan, S.K; Bharadwaj, V; Ghose, D - In: Mathematics and Computers in Simulation (MATCOM) 58 (2001) 1, pp. 71-92

processing nodes for efficient processing. We consider the problem of scheduling a very large matrix–vector product computation …

Persistent link: https://www.econbiz.de/10010749373

Techniques for parallel quasi-Monte Carlo integration with digital sequences and associated problems

Schmid, Wolfgang Ch.; Uhl, Andreas - In: Mathematics and Computers in Simulation (MATCOM) 55 (2001) 1, pp. 249-257

Currently, in the context of quasi-Monte Carlo applications the most effective low-discrepancy sequences are digital (t, s)-sequences.

Persistent link: https://www.econbiz.de/10010749978

Computational Principles of Mobile Robotics

Jenkin, M. - In: Industrial Robot: An International Journal 28 (2001) 1, pp. 80-81

Persistent link: https://www.econbiz.de/10014833866