Design issues in implementing a cooperative search among heterogeneous agents to aid information management
Bibliographic record
Abstract
Searching for information is an ubiquitous need in today's data-oriented environments. However, a request for search often entails the service and cooperation of tools managing a diversified set of tasks. In this article, we explore how tools in the form of cooperating agents can be deployed for information management. We describe an agent framework called GAME (goal-oriented, agent-managed environment), and focus on how GAME agents search cooperatively for information requested by a user. Cooperative search entails several issues such as coordinating agent activities, maintaining transparency to agent heterogeneity, and designing information formats to be shared among the agents that require examination. This article analyzes these issues and describes how they are handled in the GAME framework. Cooperative search effectively supports collaboration and information sharing not only among agents in a domain, but also among GAME agents developed across domains. We illustrate the application of cooperative search in task-oriented domains such as Manufacturing and Front Office showing how GAME promotes intradomain and interdomain collaboration in a Factory environment.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.021 | 0.028 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.003 | 0.004 |
| Scholarly communication | 0.006 | 0.008 |
| Open science | 0.005 | 0.004 |
| Research integrity | 0.004 | 0.003 |
| Insufficient payload (model declined to judge) | 0.003 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".