We describe the solution used by the Python-DTU team in the Multi-Agent Programming Contest 2011, where the scenario was called Agents on Mars. We present our auction-based agreement algorithm and discuss our chosen strategy and our choice of technology used for implementing the system. Finally, we present an analysis of the results of the competition as well as propose areas of improvement.

Abstract Nine characteristics of discontinuous agreement are shown to flow from a syntax that deals in whole phi structures and linearisation algorithm renders these when conditions converge. This approach is demonstrably superior reliance solely on syntax, morphology, or the lexicon, outperforming across range morphological syntactic data Afroasiatic languages those Australia Papua New Guinea.

We discuss the formation of a vortex polycrystal in type II superconductors from the competition between pinning and elastic forces. We compute the elastic energy of a deformed grain boundary, which is strongly nonlocal, and obtain the depinning stress for weak and strong pinning. Our estimates for the grain size dependence on the magnetic field strength are in good agreement with previous expe...