DeepAI AI Chat
Log In Sign Up

Reputation blackboard systems

by   José F. Fontanari, et al.

Blackboard systems are motivated by the popular view of task forces as brainstorming groups in which specialists write promising ideas to solve a problem in a central blackboard. Here we study a minimal model of blackboard system designed to solve cryptarithmetic puzzles, where hints are posted anonymously on a public display (standard blackboard) or are posted together with information about the reputations of the agents that posted them (reputation blackboard). We find that the reputation blackboard always outperforms the standard blackboard, which, in turn, always outperforms the independent search. The asymptotic distribution of the computational cost of the search, which is proportional to the total number of agent updates required to find the solution of the puzzle, is an exponential distribution for those three search heuristics. Only for the reputation blackboard we find a nontrivial dependence of the mean computational cost on the system size and, in that case, the optimal performance is achieved by a single agent working alone, indicating that, though the blackboard organization can produce impressive performance gains when compared with the independent search, it is not very supportive of cooperative work.


page 1

page 2

page 3

page 4


Agent-based models of collective intelligence

Collective or group intelligence is manifested in the fact that a team o...

Quadratic speedup of global search using a biased crossover of two good solutions

The minimisation of cost functions is crucial in various optimisation fi...

Gaussian Max-Value Entropy Search for Multi-Agent Bayesian Optimization

We study the multi-agent Bayesian optimization (BO) problem, where multi...

Differentiable User Models

Probabilistic user modeling is essential for building collaborative AI s...

Sensitivity analysis of chaotic systems using a frequency-domain shadowing approach

We present a frequency-domain method for computing the sensitivities of ...

Computational cost for determining an approximate global minimum using the selection and crossover algorithm

This work examines the expected computational cost to determine an appro...

Dual perspective method for solving the point in a polygon problem

A novel method has been introduced to solve a point inclusion in a polyg...