Adaptive multiagent algorithms based upon the behaviour of social insects are powerful decentralised systems capable of solving complex problems. The intelligence of such a system ...
We consider the problem of computing all Nash equilibria in bimatrix games (i.e., nonzero-sum two-player noncooperative games). Computing all Nash equilibria for large bimatrix ga...
We introduce MAGENTA’s commercial multi-agent systems technology, and illustrate its practical use by describing a field-tested application in the area of logistics/scheduling....
Jonathan Himoff, Petr Skobelev, Michael Wooldridge
The problem of solving sparse Systems of Linear Algebraic Equations (SLAE) by parallel Monte Carlo numerical methods is considered. The almost optimal Monte Carlo algorithms are pr...
Abstract. Lattice basis reduction is the problem of finding short vectors in lattices. The security of lattice based cryptosystems is based on the hardness of lattice reduction. Fu...