Stock markets have been studied for years in economy and finance academic departments by relying on the idea of a general homo economicus that makes rational choices. Classical approaches use equational representation to enable a global markets characterization, but they fail to explain the link between individual behaviours and the global market dynamic and trends that emerge. Schelling semina...

In manufacturing institutes the only access way to maximum profit is identifying the production mix of the products based on the limitations such as policies and politics, demand and production processes. This study identifies the constraints of a tile-manufacturing company including constraints in its production and demand line using LINGO software version 15, and identifying production bottle...

In this paper we describe a parallel agent based computing system. The agents are placed on GPU memory and executed in parallel on the GPU. We discuss the difficulties in creating this system and provide solutions to each of the problems encountered. We then go on to describe a test bed application for the implementation of our ideas. Following this, we test our application sand discuss the res...

With the growing complexity of the current power grid, there is an increasing need for intelligent operations coordinating energy supply and demand. A key feature of the smart grid vision is that intelligent mechanisms will coordinate the production, transmission, and consumption of energy in a distributed and reliable way. Economic Dispatch (ED) and Demand Response (DR) are two key problems th...

Simulating complex systems may require to handle a huge number of entities, raising scalability issues. In this respect, GPGPU is a relevant approach. However, GPU programming is a very specific approach that limits both accessibility and re-usability of developed frameworks. We here present our approach for integrating GPU in TurtleKit, a multi-agent based simulation platform. Especially, we s...

Bollobás, Brightwell and Leader [2] showed that there are at most 2( n 2)+o(n 2) 2-SAT functions on n variables, and conjectured that in fact almost every 2-SAT function is unate: i.e., has a 2-SAT formula in which no variable’s positive and negative literals both appear. We prove their conjecture, finding the number of 2-SAT functions on n variables to be 2( n 2)+n(1 + o(1)). As a corollary of...